A tight lower bound for the train reversal problem
- Alok Aggarwal
- Tom Leighton
- 1990
- Information Processing Letters
Publications
82 results at Information Processing Letters
Generating pseudo-random permutations and maximum flow algorithms
- Noga Alon
- 1990
- Information Processing Letters
Endmarkers can make a difference
- Moshe Y. Vardi
- 1990
- Information Processing Letters
Computing the longest diagonal of a simple polygon
- Alok Aggarwal
- Subhash Suri
- 1990
- Information Processing Letters
An improvement of Goldberg, Plotkin and Vaidya's maximal node-disjoint paths algorithm
- Kazuo Iwano
- 1989
- Information Processing Letters
On computing the closest boundary point on the convex hull
- Alok Aggarwal
- Michael Hawrylycz
- 1989
- Information Processing Letters
Fault-tolerant routing in unique-path multistage interconnection networks
- Anujan Varma
- 1989
- Information Processing Letters
A linear time algorithm for finding all farthest neighbors in a convex polygon
- Alok Aggarwal
- Dina Kravets
- 1989
- Information Processing Letters
A note on the reduction of two-way automata to one-way automata
- Moshe Y. Vardi
- 1989
- Information Processing Letters
A generalized model for understanding evasiveness
- Alok Aggarwal
- Don Coppersmith
- et al.
- 1989
- Information Processing Letters