The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics & Theoretical Computer Science
2001, volume: 4, number: 2

  1. Anna Bernasconi
    On a hierarchy of Boolean functions hard to compute in constant depth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:79-90 [Journal]
  2. Johannes Grassberger, Günther Hörmann
    A note on representations of the finite Heisenberg group and sums of greatest common divisors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:91-100 [Journal]
  3. Roberto Mantaci, Fanja Rakotondrajao
    A permutations representation that knows what "Eulerian" means. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:101-108 [Journal]
  4. Chính T. Hoàng, Van Bang Le
    P4-Colorings and P4-Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:109-122 [Journal]
  5. Eugene Curtin
    Cubic Cayley graphs with small diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:123-132 [Journal]
  6. C. R. Subramanian
    Paths of specified length in random k-partite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:133-138 [Journal]
  7. Nir Menakerman, Raphael Rom
    Analysis of Transmissions Scheduling with Packet Fragmentation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:139-156 [Journal]
  8. David W. Krumme, Paraskevi Fragopoulou
    Minimum Eccentricity Multicast Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:157-172 [Journal]
  9. Michel Habib, Christophe Paul, Laurent Viennot
    Linear time recognition of P4-indifference graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:173-178 [Journal]
  10. Timo Peichl, Heribert Vollmer
    Finite Automata with Generalized Acceptance Criteria. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:179-192 [Journal]
  11. Martin Müller, Joachim Niehren, Ralf Treinen
    The first-order theory of ordering constraints over feature trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:193-234 [Journal]
  12. C. D. Randazzo, Henrique Pacca Loureiro Luna, P. Mahey
    Benders decomposition for local access network design with two technologies. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:235-246 [Journal]
  13. Vince Grolmusz
    A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:247-254 [Journal]
  14. Damien Magoni, Jean-Jacques Pansiot
    Oriented multicast routing algorithm applied to network-level agent search. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:255-272 [Journal]
  15. Ján Manuch
    Defect Effect of Bi-infinite Words in the Two-element Case. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:273-290 [Journal]
  16. Lawrence S. Moss
    Simple Equational Specifications of Rational Arithmetic. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:291-300 [Journal]
  17. Jessica H. Fong, Martin Strauss
    An Approximate Lp Difference Algorithm for Massive Data Streams. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:301-322 [Journal]
  18. Gabrielle Assunta Grün
    An Efficient Algorithm for the Maximum Distance Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:323-350 [Journal]
  19. Pascal Koiran
    The topological entropy of iterated piecewise affine maps is uncomputable. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:351-356 [Journal]
  20. Anna E. Frid
    Overlap-free symmetric D0L words. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:357-362 [Journal]
  21. Werner Schachinger
    Asymptotic normality of recursive algorithms via martingale difference arrays. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:363-398 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002