| 2008 |
|---|
| 25 | Rectangular layouts and contact graphs. Adam L. Buchsbaum, Emden R. Gansner, Cecilia Magdalena Procopiuc, Suresh Venkatasubramanian. ACM Transactions on Algorithms (4) (2008). Cited by 5Web SearchBibTeXDownload |
| 24 | Guest editorial. Alistair A. McEwan, Ümit Bilge, C. C. Su, Erwin Pesch, Denis Trystram. ACM Transactions on Algorithms (4) (2008). Cited by 5Web SearchBibTeXDownload |
| 23 | Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery Westbrook. SIAM J. Comput. (38): 1533-1573 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 22 | Directed graphs and rectangular layouts. Adam L. Buchsbaum, Emden R. Gansner, Suresh Venkatasubramanian. APVIS 2007, 61-64. Cited by 1Web SearchBibTeXDownload |
| 21 | Restricted strip covering and the sensor cover problem. Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi. SODA 2007, 1056-1063. Cited by 8Web SearchBibTeXDownload |
| 2006 |
|---|
| 20 | Restricted Strip Covering and the Sensor Cover Problem. Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi. CoRR (abs/cs/0605102) (2006). Web SearchBibTeXDownload |
| 19 | Rectangular Layouts and Contact Graphs. Adam L. Buchsbaum, Emden R. Gansner, Cecilia Magdalena Procopiuc, Suresh Venkatasubramanian. CoRR (abs/cs/0611107) (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 18 | Corrigendum: a new, simpler linear-time dominators algorithm. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook. ACM Trans. Program. Lang. Syst. (27): 383-387 (2005). Web SearchBibTeXDownload |
| 17 | Biased Skip Lists. Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich. Algorithmica (42): 31-48 (2005). Web SearchBibTeXDownload |
| 2004 |
|---|
| 16 | Three-Dimensional Layers of Maxima. Adam L. Buchsbaum, Michael T. Goodrich. Algorithmica (39): 275-286 (2004). Web SearchBibTeXDownload |
| 15 | OPT Versus LOAD in Dynamic Storage Allocation. Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup. SIAM J. Comput. (33): 632-646 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 14 | Fast prefix matching of bounded strings. Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang. ACM Journal of Experimental Algorithmics (8) (2003). Web SearchBibTeXDownload |
| 13 | Fast Prefix Matching of Bounded Strings. Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang. ALENEX 2003, 128-140. Web SearchBibTeX |
| 12 | OPT versus LOAD in dynamic storage allocation. Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup. STOC 2003, 556-564. Web SearchBibTeXDownload |
| 2002 |
|---|
| 11 | Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook. CoRR (cs.DS/0207061) (2002). Web SearchBibTeXDownload |
| 10 | Three-Dimensional Layers of Maxima. Adam L. Buchsbaum, Michael T. Goodrich. ESA 2002, 257-269. Web SearchBibTeXDownload |
| 9 | Biased Skip Lists. Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich. ISAAC 2002, 1-13. Web SearchBibTeXDownload |
| 2001 |
|---|
| 8 | Visualizing and Analyzing Software Infrastructures. Adam L. Buchsbaum, Yih-Farn Chen, Huale Huang, Eleftherios Koutsofios, John M. Mocenigo, Anne Rogers, Michael Jankowsky, Spiros Mancoridis. IEEE Software (18): 62-70 (2001). Web SearchBibTeXDownload |
| 2000 |
|---|
| 7 | Range Searching Over Tree Cross Products. Adam L. Buchsbaum, Michael T. Goodrich, Jeffery Westbrook. ESA 2000, 120-131. Web SearchBibTeXDownload |
| 6 | Engineering the compression of massive tables: an experimental approach. Adam L. Buchsbaum, Donald F. Caldwell, Kenneth Ward Church, Glenn S. Fowler, S. Muthukrishnan. SODA 2000, 175-184. Cited by 50Web SearchBibTeXDownload |
| 5 | On external memory graph traversal. Adam L. Buchsbaum, Michael H. Goldwasser, Suresh Venkatasubramanian, Jeffery Westbrook. SODA 2000, 859-860. Cited by 81Web SearchBibTeXDownload |
| 1998 |
|---|
| 4 | A New, Simpler Linear-Time Dominators Algorithm. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook. ACM Trans. Program. Lang. Syst. (20): 1265-1296 (1998). Web SearchBibTeXDownload |
| 3 | Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook. STOC 1998, 279-288. Web SearchBibTeXDownload |
| 1991 |
|---|
| 2 | A Data Dtructure for Arc Insertion and Regular Path Finding. Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter. Ann. Math. Artif. Intell. (3): 187-210 (1991). Web SearchBibTeXDownload |
| 1990 |
|---|
| 1 | A Data Structure for Arc Insertion and Regular Path Finding. Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter. SODA 1990, 22-31. Web SearchBibTeXDownload |
