The SCEAS System
Navigation Menu

Search the dblp DataBase


Oliver Pretzel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Oliver Pretzel
    Extended Classical Goppa Codes. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2001, v:11, n:6, pp:447-454 [Journal]
  2. Oliver Pretzel
    On reorienting graphs by pushing down maximal vertices--II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:226-239 [Journal]
  3. Oliver Pretzel
    Finding Recursions for Multidimensional Arrays. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:1, pp:1-14 [Journal]
  4. Oliver Pretzel
    Characterization of simple edge-firing games. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:5, pp:235-236 [Journal]
  5. Oliver Pretzel
    On the Dimension of Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1977, v:22, n:2, pp:146-152 [Journal]
  6. Oliver Pretzel, Dale Youngs
    Cycle Lengths and Graph Orientations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:4, pp:544-0 [Journal]
  7. Oliver Pretzel
    Partial geometric codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2506-2512 [Journal]
  8. Oliver Pretzel
    A construction for partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:32, n:1, pp:59-68 [Journal]
  9. Oliver Pretzel
    A non-covering graph of girth six. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:241-244 [Journal]
  10. Oliver Pretzel, Dale Youngs
    Balanced graphs and noncovering graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:279-287 [Journal]

Search in 0.003secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002