The SCEAS System
Navigation Menu

Conferences in DBLP

Advanced Courses (ac)
2001 (conf/ac/2001cdm)

  1. Martin Aigner
    Lattice Paths and Determinants. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:1-12 [Conf]
  2. Helmut Alt
    The Nearest Neighbor. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:13-24 [Conf]
  3. Bernd Gärtner, Emo Welzl
    Explicit and Implicit Enforcing - Randomized Optimization. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:25-46 [Conf]
  4. Tor Helleseth
    Codes over Z4. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:47-55 [Conf]
  5. Heinz Adolf Jung
    Degree Bounds for Long Paths and Cycles in k-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:56-60 [Conf]
  6. Christoph Meinel, Christian Stangier
    Data Structures for Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:61-78 [Conf]
  7. Rolf H. Möhring
    Scheduling under Uncertainty: Bounding the Makespan Distribution. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:79-97 [Conf]
  8. Hans Jürgen Prömel, Anusch Taraz
    Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:98-118 [Conf]
  9. Günter Rote
    Division-Free Algorithms for the Determinant and the Pfaffian: Algebraic and Combinatorial Approaches. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:119-135 [Conf]
  10. Ralph-Hardo Schulz
    Check Character Systems and Anti-symmetric Mappings. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:136-147 [Conf]
  11. Gernot Stroth
    Algorithms in Pure Mathematics. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:148-158 [Conf]
  12. Günter M. Ziegler
    Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:159-172 [Conf]
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