The SCEAS System
Navigation Menu

Search the dblp DataBase


Paul J. Tanenbaum: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum
    Snap Rounding Line Segments Efficiently in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:284-293 [Conf]
  2. Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman
    Characterization and Recognition of Point-Halfspace and Related Orders. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:234-245 [Conf]
  3. Paul J. Tanenbaum, Carlos de la Mora, Piotr Wojciechowski, Olga Kosheleva, Vladik Kreinovich, Scott A. Starks, Alexandr V. Kuzminykh
    Robust Methodology for Characterizing System Response to Damage: Approach Based on Partial Order. [Citation Graph (0, 0)][DBLP]
    LSSC, 2003, pp:276-283 [Conf]
  4. Paul J. Tanenbaum
    Bound Graph Polysemy. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  5. Peter C. Fishburn, Paul J. Tanenbaum, Ann N. Trenk
    Linear Discrepancy and Bandwidth. [Citation Graph (0, 0)][DBLP]
    Order, 2001, v:18, n:3, pp:237-245 [Journal]
  6. Paul J. Tanenbaum, Ann N. Trenk, Peter C. Fishburn
    Linear Discrepancy and Weak Discrepancy of Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    Order, 2001, v:18, n:3, pp:201-225 [Journal]

Search in 0.002secs, Finished in 0.002secs
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