SODA Conference 2007 Conference Paper
Restricted strip covering and the sensor cover problem
- Adam L. Buchsbaum
- Alon Efrat
- Shaili Jain
- Suresh Venkatasubramanian
- Ke Yi 0001
Author name cluster
Adam L. Buchsbaum
Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.
12 papers
2 author rows
Possible papers
12TCS Journal 2003 Journal Article
On finding common neighborhoods in massive graphs
- Adam L. Buchsbaum
- Raffaele Giancarlo
- Jeffery R. Westbrook
STOC Conference 2003 Conference Paper
OPT versus LOAD in dynamic storage allocation
- Adam L. Buchsbaum
- Howard J. Karloff
- Claire Mathieu
- Nick Reingold
- Mikkel Thorup
SODA Conference 2002 Conference Paper
Improving table compression with combinatorial optimization
- Adam L. Buchsbaum
- Glenn S. Fowler
- Raffaele Giancarlo
SODA Conference 2000 Conference Paper
Engineering the compression of massive tables: an experimental approach
- Adam L. Buchsbaum
- Donald F. Caldwell
- Kenneth Ward Church
- Glenn S. Fowler
- S. Muthukrishnan 0001
SODA Conference 2000 Conference Paper
Maintaining hierarchical graph views
- Adam L. Buchsbaum
- Jeffery R. Westbrook
SODA Conference 2000 Conference Paper
On external memory graph traversal
- Adam L. Buchsbaum
- Michael H. Goldwasser
- Suresh Venkatasubramanian
- Jeffery R. Westbrook
STOC Conference 1998 Conference Paper
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators
- Adam L. Buchsbaum
- Haim Kaplan
- Anne Rogers
- Jeffery R. Westbrook
SODA Conference 1996 Conference Paper
Selecting Training Inputs via Greedy Rank Covering
- Adam L. Buchsbaum
- Jan P. H. van Santen
SODA Conference 1993 Conference Paper
Confluently Persistent Deques via Data Structural Bootstrapping
- Adam L. Buchsbaum
- Robert Endre Tarjan
FOCS Conference 1992 Conference Paper
Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues
- Adam L. Buchsbaum
- Rajamani Sundar
- Robert Endre Tarjan
The authors provide an efficient implementation of catenable mindeques. To prove that the resulting data structure achieves constant amortized time per operation, they consider order preserving path compression. They prove a linear bound on deque ordered spine-only path compression, a case of order persevering path compression employed by the data structure. >
SODA Conference 1990 Conference Paper
A Data Structure for Arc Insertion and Regular Path Finding
- Adam L. Buchsbaum
- Paris C. Kanellakis
- Jeffrey Scott Vitter