Paul J. Tanenbaum

According to our database, Paul J. Tanenbaum authored at least 7 papers between 1994 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2003

Robust Methodology for Characterizing System Response to Damage: Approach Based on Partial Order.

Paul J. Tanenbaum, Carlos de la Mora, Piotr Wojciechowski, Olga Kosheleva, Vladik Kreinovich, Scott A. Starks, Alexandr V. Kuzminykh

Proceedings of the Large-Scale Scientific Computing, 4th International Conference, 2003

2001

Linear Discrepancy and Weak Discrepancy of Partially Ordered Sets.

Paul J. Tanenbaum, Ann N. Trenk, Peter C. Fishburn

Order, 2001

Linear Discrepancy and Bandwidth.

Peter C. Fishburn, Paul J. Tanenbaum, Ann N. Trenk

Order, 2001

2000

Bound Graph Polysemy.

Paul J. Tanenbaum

Electron. J. Comb., 2000

1999

Simultaneous intersection representation of pairs of graphs.

Paul J. Tanenbaum

J. Graph Theory, 1999

1997

Snap Rounding Line Segments Efficiently in Two and Three Dimensions.

Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1994

Characterization and Recognition of Point-Halfspace and Related Orders.

Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994