default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdam L. Buchsbaum
Person information
- affiliation: AT&T Inc
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[r2]Raffaele Giancarlo, Adam L. Buchsbaum:
Table Compression. Encyclopedia of Algorithms 2016: 2193-2198- 2011
- [j24]James S. Plank
, Adam L. Buchsbaum, Bradley T. Vander Zanden:
Minimum density RAID-6 codes. ACM Trans. Storage 6(4): 16:1-16:22 (2011)
2000 – 2009
- 2008
- [j23]Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert Endre Tarjan, Jeffery R. Westbrook:
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems. SIAM J. Comput. 38(4): 1533-1573 (2008) - [j22]Adam L. Buchsbaum, Emden R. Gansner, Cecilia Magdalena Procopiuc, Suresh Venkatasubramanian:
Rectangular layouts and contact graphs. ACM Trans. Algorithms 4(1): 8:1-8:28 (2008) - [j21]Adam L. Buchsbaum:
Guest editorial. ACM Trans. Algorithms 4(2): 16:1 (2008) - [j20]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) - [r1]Adam L. Buchsbaum, Raffaele Giancarlo:
Table Compression. Encyclopedia of Algorithms 2008 - 2007
- [c25]Adam L. Buchsbaum, Emden R. Gansner, Suresh Venkatasubramanian:
Directed graphs and rectangular layouts. APVIS 2007: 61-64 - [c24]Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi:
Restricted strip covering and the sensor cover problem. SODA 2007: 1056-1063 - 2006
- [i4]Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi:
Restricted Strip Covering and the Sensor Cover Problem. CoRR abs/cs/0605102 (2006) - [i3]Adam L. Buchsbaum, Emden R. Gansner, Cecilia Magdalena Procopiuc, Suresh Venkatasubramanian:
Rectangular Layouts and Contact Graphs. CoRR abs/cs/0611107 (2006) - 2005
- [j19]Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich:
Biased Skip Lists. Algorithmica 42(1): 31-48 (2005) - [j18]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Corrigendum: a new, simpler linear-time dominators algorithm. ACM Trans. Program. Lang. Syst. 27(3): 383-387 (2005) - [c23]James S. Plank, Adam L. Buchsbaum, Rebecca L. Collins, Michael G. Thomason:
Small Parity-Check Erasure Codes - Exploration and Observations. DSN 2005: 326-335 - 2004
- [j17]Adam L. Buchsbaum, Michael T. Goodrich:
Three-Dimensional Layers of Maxima. Algorithmica 39(4): 275-286 (2004) - [j16]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
- [j15]Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo:
Improving table compression with combinatorial optimization. J. ACM 50(6): 825-851 (2003) - [j14]Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang:
Fast prefix matching of bounded strings. ACM J. Exp. Algorithmics 8 (2003) - [j13]Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
On finding common neighborhoods in massive graphs. Theor. Comput. Sci. 299(1-3): 707-718 (2003) - [c22]Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang:
Fast Prefix Matching of Bounded Strings. ALENEX 2003: 128-140 - [c21]Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup:
OPT versus LOAD in dynamic storage allocation. STOC 2003: 556-564 - 2002
- [j12]James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook:
A Functional Approach to External Graph Algorithms. Algorithmica 32(3): 437-458 (2002) - [c20]Adam L. Buchsbaum, Michael T. Goodrich:
Three-Dimensional Layers of Maxima. ESA 2002: 257-269 - [c19]Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich:
Biased Skip Lists. ISAAC 2002: 1-13 - [c18]Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo:
Improving table compression with combinatorial optimization. SODA 2002: 213-222 - [i2]Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo:
Improving Table Compression with Combinatorial Optimization. CoRR cs.DS/0203018 (2002) - [i1]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. CoRR cs.DS/0207061 (2002) - 2001
- [j11]Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
An Approximate Determinization Algorithm for Weighted Finite-State Automata. Algorithmica 30(4): 503-526 (2001) - [j10]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 Softw. 18(5): 62-70 (2001) - [e1]Adam L. Buchsbaum, Jack Snoeyink:
Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers. Lecture Notes in Computer Science 2153, Springer 2001, ISBN 3-540-42560-8 [contents] - 2000
- [j9]Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
On the Determinization of Weighted Finite Automata. SIAM J. Comput. 30(5): 1502-1531 (2000) - [c17]Adam L. Buchsbaum, Raffaele Giancarlo:
Algorithmic Aspects of Speech Recognition: A Synopsis. CPM 2000: 27-32 - [c16]Adam L. Buchsbaum, Michael T. Goodrich, Jeffery R. Westbrook:
Range Searching Over Tree Cross Products. ESA 2000: 120-131 - [c15]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 - [c14]Adam L. Buchsbaum, Jeffery R. Westbrook:
Maintaining hierarchical graph views. SODA 2000: 566-575 - [c13]Adam L. Buchsbaum, Michael H. Goldwasser, Suresh Venkatasubramanian, Jeffery R. Westbrook:
On external memory graph traversal. SODA 2000: 859-860
1990 – 1999
- 1998
- [j8]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
A New, Simpler Linear-Time Dominators Algorithm. ACM Trans. Program. Lang. Syst. 20(6): 1265-1296 (1998) - [c12]James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook:
A Functional Approach to External Graph Algorithms. ESA 1998: 332-343 - [c11]Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
On the Determinization of Weighted Finite Automata. ICALP 1998: 482-493 - [c10]Adam L. Buchsbaum, Raffaele Giancarlo, Jeffery R. Westbrook:
Shrinking language models by robust approximation. ICASSP 1998: 685-688 - [c9]Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, Jeffery R. Westbrook:
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. STOC 1998: 279-288 - 1997
- [j7]Adam L. Buchsbaum, Raffaele Giancarlo:
Algorithmic Aspects in Speech Recognition: An Introduction. ACM J. Exp. Algorithmics 2: 1 (1997) - [c8]Hiyan Alshawi, Adam L. Buchsbaum, Fei Xia:
A Comparison of Head Transducers and Transfer for a Limited Domain Translation Application. ACL 1997: 360-365 - [c7]Hiyan Alshawi, Adam L. Buchsbaum:
State-transition cost functions and an application to language translation. ICASSP 1997: 103-106 - [c6]Jan P. H. van Santen, Adam L. Buchsbaum:
Methods for optimal text selection. EUROSPEECH 1997: 553-556 - 1996
- [c5]Adam L. Buchsbaum, Jan P. H. van Santen:
Selecting Training Inputs via Greedy Rank Covering. SODA 1996: 288-295 - 1995
- [j6]Adam L. Buchsbaum, Rajamani Sundar, Robert Endre Tarjan:
Lazy Structure Sharing for Query Optimization. Acta Informatica 32(3): 255-270 (1995) - [j5]Adam L. Buchsbaum, Robert Endre Tarjan:
Confluently Persistent Deques via Data-Structural Bootstrapping. J. Algorithms 18(3): 513-547 (1995) - [j4]Adam L. Buchsbaum, Milena Mihail:
Monte Carlo and Markov Chain techniques for network reliability and sampling. Networks 25(3): 117-130 (1995) - [j3]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
- [j2]Adam L. Buchsbaum, Martin C. Carlisle:
Determining Uni-Connectivity in Directed Graphs. Inf. Process. Lett. 48(1): 9-12 (1993) - [c4]Adam L. Buchsbaum, Robert Endre Tarjan:
Confluently Persistent Deques via Data Structural Bootstrapping. SODA 1993: 155-164 - 1992
- [c3]Adam L. Buchsbaum, Milena Mihail:
Monte Carlo and Markov Chain Techniques for Network Reliability and Sampling. Computational Support for Discrete Mathematics 1992: 199-222 - [c2]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
- [j1]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
- [c1]Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter:
A Data Structure for Arc Insertion and Regular Path Finding. SODA 1990: 22-31
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
