Adam L. Buchsbaum

According to our database1, Adam L. Buchsbaum
  • authored at least 55 papers between 1990 and 2016.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Table Compression.
Encyclopedia of Algorithms, 2016

2011
Minimum density RAID-6 codes.
TOS, 2011

2008
Table Compression.
Proceedings of the Encyclopedia of Algorithms, 2008

New results for finding common neighborhoods in massive graphs in the data stream model.
Theor. Comput. Sci., 2008

Rectangular layouts and contact graphs.
ACM Trans. Algorithms, 2008

Guest editorial.
ACM Trans. Algorithms, 2008

Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems.
SIAM J. Comput., 2008

2007
Restricted strip covering and the sensor cover problem.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Directed graphs and rectangular layouts.
Proceedings of the APVIS 2007, 2007

2006
Rectangular Layouts and Contact Graphs
CoRR, 2006

Restricted Strip Covering and the Sensor Cover Problem
CoRR, 2006

2005
Corrigendum: a new, simpler linear-time dominators algorithm.
ACM Trans. Program. Lang. Syst., 2005

Biased Skip Lists.
Algorithmica, 2005

Small Parity-Check Erasure Codes - Exploration and Observations.
Proceedings of the 2005 International Conference on Dependable Systems and Networks (DSN 2005), 28 June, 2005

2004
OPT Versus LOAD in Dynamic Storage Allocation.
SIAM J. Comput., 2004

Three-Dimensional Layers of Maxima.
Algorithmica, 2004

2003
On finding common neighborhoods in massive graphs.
Theor. Comput. Sci., 2003

Fast prefix matching of bounded strings.
ACM Journal of Experimental Algorithmics, 2003

Improving table compression with combinatorial optimization.
J. ACM, 2003

OPT versus LOAD in dynamic storage allocation.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Fast Prefix Matching of Bounded Strings.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

2002
Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators
CoRR, 2002

Improving Table Compression with Combinatorial Optimization
CoRR, 2002

A Functional Approach to External Graph Algorithms.
Algorithmica, 2002

Improving table compression with combinatorial optimization.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Biased Skip Lists.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Three-Dimensional Layers of Maxima.
Proceedings of the Algorithms, 2002

2001
Visualizing and Analyzing Software Infrastructures.
IEEE Software, 2001

An Approximate Determinization Algorithm for Weighted Finite-State Automata.
Algorithmica, 2001

2000
On the Determinization of Weighted Finite Automata.
SIAM J. Comput., 2000

Maintaining hierarchical graph views.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

On external memory graph traversal.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Engineering the compression of massive tables: an experimental approach.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Range Searching Over Tree Cross Products.
Proceedings of the Algorithms, 2000

Algorithmic Aspects of Speech Recognition: A Synopsis.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1998
A New, Simpler Linear-Time Dominators Algorithm.
ACM Trans. Program. Lang. Syst., 1998

Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Shrinking language models by robust approximation.
Proceedings of the 1998 IEEE International Conference on Acoustics, 1998

On the Determinization of Weighted Finite Automata.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

A Functional Approach to External Graph Algorithms.
Proceedings of the Algorithms, 1998

1997
Algorithmic Aspects in Speech Recognition: An Introduction.
ACM Journal of Experimental Algorithmics, 1997

Methods for optimal text selection.
Proceedings of the Fifth European Conference on Speech Communication and Technology, 1997

State-transition cost functions and an application to language translation.
Proceedings of the 1997 IEEE International Conference on Acoustics, 1997

A Comparison of Head Transducers and Transfer for a Limited Domain Translation Application.
Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics, 1997

1996
Selecting Training Inputs via Greedy Rank Covering.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995
Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues.
SIAM J. Comput., 1995

Monte Carlo and Markov Chain techniques for network reliability and sampling.
Networks, 1995

Confluently Persistent Deques via Data-Structural Bootstrapping.
J. Algorithms, 1995

Lazy Structure Sharing for Query Optimization.
Acta Inf., 1995

1993
Determining Uni-Connectivity in Directed Graphs.
Inf. Process. Lett., 1993

Confluently Persistent Deques via Data Structural Bootstrapping.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992
Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Monte Carlo and Markov Chain Techniques for Network Reliability and Sampling.
Proceedings of the Computational Support for Discrete Mathematics, 1992

1991
A Data Dtructure for Arc Insertion and Regular Path Finding.
Ann. Math. Artif. Intell., 1991

1990
A Data Structure for Arc Insertion and Regular Path Finding.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990


  Loading...