2008 | ||
---|---|---|
49 | EE | Adam L. Buchsbaum, Raffaele Giancarlo: Table Compression. Encyclopedia of Algorithms 2008 |
48 | EE | Adam L. Buchsbaum, Emden R. Gansner, Cecilia Magdalena Procopiuc, Suresh Venkatasubramanian: Rectangular layouts and contact graphs. ACM Transactions on Algorithms 4(1): (2008) |
47 | EE | Adam L. Buchsbaum: Guest editorial. ACM Transactions on Algorithms 4(2): (2008) |
46 | EE | Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery Westbrook: Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. SIAM J. Comput. 38(4): 1533-1573 (2008) |
45 | EE | Adam L. Buchsbaum, Raffaele Giancarlo, Balázs Rácz: New results for finding common neighborhoods in massive graphs in the data stream model. Theor. Comput. Sci. 407(1-3): 302-309 (2008) |
2007 | ||
44 | EE | Adam L. Buchsbaum, Emden R. Gansner, Suresh Venkatasubramanian: Directed graphs and rectangular layouts. APVIS 2007: 61-64 |
43 | EE | Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi: Restricted strip covering and the sensor cover problem. SODA 2007: 1056-1063 |
2006 | ||
42 | EE | Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi: Restricted Strip Covering and the Sensor Cover Problem CoRR abs/cs/0605102: (2006) |
41 | EE | Adam L. Buchsbaum, Emden R. Gansner, Cecilia Magdalena Procopiuc, Suresh Venkatasubramanian: Rectangular Layouts and Contact Graphs CoRR abs/cs/0611107: (2006) |
2005 | ||
40 | EE | James S. Plank, Adam L. Buchsbaum, Rebecca L. Collins, Michael G. Thomason: Small Parity-Check Erasure Codes - Exploration and Observations. DSN 2005: 326-335 |
39 | EE | Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook: Corrigendum: a new, simpler linear-time dominators algorithm. ACM Trans. Program. Lang. Syst. 27(3): 383-387 (2005) |
38 | EE | Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich: Biased Skip Lists. Algorithmica 42(1): 31-48 (2005) |
2004 | ||
37 | EE | Adam L. Buchsbaum, Michael T. Goodrich: Three-Dimensional Layers of Maxima. Algorithmica 39(4): 275-286 (2004) |
36 | EE | Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup: OPT Versus LOAD in Dynamic Storage Allocation. SIAM J. Comput. 33(3): 632-646 (2004) |
2003 | ||
35 | Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang: Fast Prefix Matching of Bounded Strings. ALENEX 2003: 128-140 | |
34 | EE | Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup: OPT versus LOAD in dynamic storage allocation. STOC 2003: 556-564 |
33 | EE | Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang: Fast prefix matching of bounded strings. ACM Journal of Experimental Algorithmics 8: (2003) |
32 | EE | Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo: Improving table compression with combinatorial optimization. J. ACM 50(6): 825-851 (2003) |
31 | EE | Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook: On finding common neighborhoods in massive graphs. Theor. Comput. Sci. 1-3(299): 707-718 (2003) |
2002 | ||
30 | EE | Adam L. Buchsbaum, Michael T. Goodrich: Three-Dimensional Layers of Maxima. ESA 2002: 257-269 |
29 | EE | Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich: Biased Skip Lists. ISAAC 2002: 1-13 |
28 | EE | Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo: Improving table compression with combinatorial optimization. SODA 2002: 213-222 |
27 | EE | James Abello, Adam L. Buchsbaum, Jeffery Westbrook: A Functional Approach to External Graph Algorithms. Algorithmica 32(3): 437-458 (2002) |
26 | EE | Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo: Improving Table Compression with Combinatorial Optimization CoRR cs.DS/0203018: (2002) |
25 | EE | Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook: Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators CoRR cs.DS/0207061: (2002) |
2001 | ||
24 | Adam L. Buchsbaum, Jack Snoeyink: Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers Springer 2001 | |
23 | EE | Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook: An Approximate Determinization Algorithm for Weighted Finite-State Automata. Algorithmica 30(4): 503-526 (2001) |
22 | EE | Adam L. Buchsbaum, Yih-Farn Chen, Huale Huang, Eleftherios Koutsofios, John M. Mocenigo, Anne Rogers, Michael Jankowsky, Spiros Mancoridis: Visualizing and Analyzing Software Infrastructures. IEEE Software 18(5): 62-70 (2001) |
2000 | ||
21 | EE | Adam L. Buchsbaum, Raffaele Giancarlo: Algorithmic Aspects of Speech Recognition: A Synopsis. CPM 2000: 27-32 |
20 | Adam L. Buchsbaum, Michael T. Goodrich, Jeffery Westbrook: Range Searching Over Tree Cross Products. ESA 2000: 120-131 | |
19 | EE | Adam L. Buchsbaum, Donald F. Caldwell, Kenneth Ward Church, Glenn S. Fowler, S. Muthukrishnan: Engineering the compression of massive tables: an experimental approach. SODA 2000: 175-184 |
18 | EE | Adam L. Buchsbaum, Jeffery Westbrook: Maintaining hierarchical graph views. SODA 2000: 566-575 |
17 | EE | Adam L. Buchsbaum, Michael H. Goldwasser, Suresh Venkatasubramanian, Jeffery Westbrook: On external memory graph traversal. SODA 2000: 859-860 |
16 | EE | Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook: On the Determinization of Weighted Finite Automata. SIAM J. Comput. 30(5): 1502-1531 (2000) |
1998 | ||
15 | EE | James Abello, Adam L. Buchsbaum, Jeffery Westbrook: A Functional Approach to External Graph Algorithms. ESA 1998: 332-343 |
14 | EE | Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook: On the Determinization of Weighted Finite Automata. ICALP 1998: 482-493 |
13 | EE | Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook: Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. STOC 1998: 279-288 |
12 | EE | Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery Westbrook: A New, Simpler Linear-Time Dominators Algorithm. ACM Trans. Program. Lang. Syst. 20(6): 1265-1296 (1998) |
1997 | ||
11 | Hiyan Alshawi, Adam L. Buchsbaum, Fei Xia: A Comparison of Head Transducers and Transfer for a Limited Domain Translation Application. ACL 1997: 360-365 | |
10 | EE | Adam L. Buchsbaum, Raffaele Giancarlo: Algorithmic Aspects in Speech Recognition: An Introduction. ACM Journal of Experimental Algorithmics 2: 1 (1997) |
1996 | ||
9 | Adam L. Buchsbaum, Jan P. H. van Santen: Selecting Training Inputs via Greedy Rank Covering. SODA 1996: 288-295 | |
1995 | ||
8 | Adam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan: Lazy Structure Sharing for Query Optimization Acta Inf. 32(3): 255-270 (1995) | |
7 | Adam L. Buchsbaum, Robert Endre Tarjan: Confluently Persistent Deques via Data-Structural Bootstrapping. J. Algorithms 18(3): 513-547 (1995) | |
6 | Adam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan: Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues. SIAM J. Comput. 24(6): 1190-1206 (1995) | |
1993 | ||
5 | Adam L. Buchsbaum, Robert Endre Tarjan: Confluently Persistent Deques via Data Structural Bootstrapping. SODA 1993: 155-164 | |
4 | Adam L. Buchsbaum, Martin C. Carlisle: Determining Uni-Connectivity in Directed Graphs. Inf. Process. Lett. 48(1): 9-12 (1993) | |
1992 | ||
3 | Adam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan: Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues FOCS 1992: 40-49 | |
1991 | ||
2 | Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter: A Data Dtructure for Arc Insertion and Regular Path Finding. Ann. Math. Artif. Intell. 3(2-4): 187-210 (1991) | |
1990 | ||
1 | Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter: A Data Structure for Arc Insertion and Regular Path Finding. SODA 1990: 22-31 |