#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1994

2003

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Paul J. Tanenbaum, Ann N. Trenk, Peter C. Fishburn
- Order
- 2001

The linear discrepancy of a partially ordered set P = (X,≺) is the least integer k for which there exists an injection f : X → Z satisfying (i) if x ≺ y then f (x) < f (y) and (ii) if x ‖ y then |f… (More)

- Peter C. Fishburn, Paul J. Tanenbaum, Ann N. Trenk
- Order
- 2001

The linear discrepancy of a partially ordered set P = (X;), denoted by ld(P), is the least integer k for which there exists an injection f : X ! Z satisfying (i) if x y, then f (x) < f (y); and (ii)… (More)

- Michael T. Goodrich, Leonidas J. Guibas, John Hershberger, Paul J. Tanenbaum
- Symposium on Computational Geometry
- 1997

We study the problem of robustly rounding a set S of n line segments in R2 using the snap rounding paradigm. In this paradigm each pixel containing an endpoint or intersection point is called “hot,”… (More)

We characterize the codominance pairspairs of posets that admit simultaneous dominance representations in the (x; y)-and (?x; y)-coordinate systemssand present a linear algorithm to recognize them… (More)

- Paul J. Tanenbaum
- Electr. J. Comb.
- 2000

Bound polysemy is the property of any pair (G1, G2) of graphs on a shared vertex set V for which there exists a partial order on V such that any pair of vertices has an upper bound precisely when the… (More)

We characterize the polysemic interval pairs|pairs of posets that admit simultaneous interval and interval-containment representations|and present algorithms to recognize them and construct polysemic… (More)

To describe the response of engineering complex systems to various damage mechanics, engineers have traditionally use number-valued utilities to describe the results of different possible outcomes,… (More)

- Paul J. Tanenbaum
- Journal of Graph Theory
- 1999

- Michael T. Goodrich, Leonidas J. Guibasy, John Hershberger, Paul J. Tanenbaum
- 1997

We study the problem of robustly rounding a set S of n line segments in R 2 using the snap rounding paradigm. In this paradigm each pixel containing an endpoint or intersection point is called \hot,"… (More)

- Paul J. Tanenbaum, Carlos de la Mora, +4 authors Alexandr V. Kuzminykh
- LSSC
- 2003

To describe the response of engineering complex systems to various damage mechanics, engineers have traditionally use number-valued utilities to describe the results of diierent possible outcomes,… (More)