Daniel S. Hirschberg

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

2003

Adaptive low-power address encoding techniques using self-organizing lists.

[BibT_eX]

[DOI]

Mahesh Mamidipaka

Nikil D. Dutt

IEEE Trans. Very Large Scale Integr. Syst., 2003

2002

Efficient Power Reduction Techniques for Time Multiplexed Address Buses.

[BibT_eX]

[DOI]

Nikil D. Dutt

Mahesh Mamidipaka

Proceedings of the 15th International Symposium on System Synthesis (ISSS 2002), 2002

2001

Low power address encoding using self-organizing lists.

[BibT_eX]

[DOI]

Mahesh Mamidipaka

Nikil D. Dutt

Proceedings of the 2001 International Symposium on Low Power Electronics and Design, 2001

2000

Geometric Thickness of Complete Graphs.

[BibT_eX]

[DOI]

Michael B. Dillencourt

David Eppstein

J. Graph Algorithms Appl., 2000

1999

Bounds on the Number of String Subsequences.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999

1997

Dictionary Compression on the PRAM.

[BibT_eX]

[DOI]

Parallel Process. Lett., 1997

Choosing Subsets with Maximum Weighted Average.

[BibT_eX]

[DOI]

David Eppstein

J. Algorithms, 1997

Serial computations of Levenshtein distances.

[BibT_eX]

Proceedings of the Pattern Matching Algorithms, 1997

1995

Systolic Self-Organizing Lists Under Transpose.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1995

1994

Finding Succinct Ordered Minimal Perfect Hash Functions.

[BibT_eX]

[DOI]

Steven S. Seiden

Inf. Process. Lett., 1994

PRAM Algorithms for Static Dictionary Compression.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Parallel Processing, 1994

Parsing Algorithms for Dictionary Compression on the PRAM.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1994

1993

A Bounded-Space Tree Traversal Algorithm.

[BibT_eX]

[DOI]

Steven S. Seiden

Inf. Process. Lett., 1993

1992

The Traveler's Problem.

[BibT_eX]

[DOI]

J. Algorithms, 1992

Average Case Analysis of Learning kappa-CNF Concepts.

[BibT_eX]

[DOI]

Michael J. Pazzani

Proceedings of the Ninth International Workshop on Machine Learning (ML 1992), 1992

Transpose Coding on the Systolic Array.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1992

1991

Three-Dimensional Stable Matching Problems.

[BibT_eX]

[DOI]

Cheng Ng

SIAM J. Discret. Math., 1991

Streamlining Context Models for Data Compression.

[BibT_eX]

[DOI]

Debra A. Lelewer

Proceedings of the IEEE Data Compression Conference, 1991

1990

A Fast Algorithm for Optimal Length-Limited Huffman Codes

[BibT_eX]

[DOI]

J. ACM, July, 1990

Lower Bounds for the Stable Marriage Problem and its Variants.

[BibT_eX]

[DOI]

Cheng Ng

SIAM J. Comput., 1990

Efficient Decoding of Prefix Codes.

[BibT_eX]

[DOI]

Debra A. Lelewer

Commun. ACM, 1990

Length-Limited Coding.

[BibT_eX]

[DOI]

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989

The Set-Set LCS Problem.

[BibT_eX]

[DOI]

Algorithmica, 1989

1988

Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities.

[BibT_eX]

[DOI]

James H. Hester

J. Algorithms, 1988

1987

The Least Weight Subsequence Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

New applications of failure functions.

[BibT_eX]

[DOI]

J. ACM, 1987

Improved Update/Query Algorithms for the Interval Valuation Problem.

[BibT_eX]

[DOI]

Dennis J. Volper

Inf. Process. Lett., 1987

Data Compression.

[BibT_eX]

[DOI]

Debra A. Lelewer

ACM Comput. Surv., 1987

Self-Organizing Search Lists Using Probabilistic Back-Pointers.

[BibT_eX]

[DOI]

James H. Hester

Commun. ACM, 1987

The Set LCS Problem.

[BibT_eX]

[DOI]

Algorithmica, 1987

1986

Average Case Analysis of Marking Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

Faster Construction of Optimal Binary Split Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1986

1985

Self-Organizing Linear Search.

[BibT_eX]

[DOI]

James H. Hester

ACM Comput. Surv., 1985

Efficient Optimal Pagination of Scrolls.

[BibT_eX]

[DOI]

Commun. ACM, 1985

The Least Weight Subsequence Problem (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1983

An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes.

[BibT_eX]

[DOI]

Manoj Kumar

IEEE Trans. Computers, 1983

1980

On the Complexity of Searching a Set of Vectors.

[BibT_eX]

[DOI]

SIAM J. Comput., 1980

Decentralized Extrema-Finding in Circular Configurations of Processors.

[BibT_eX]

[DOI]

James B. Sinclair

Commun. ACM, 1980

1979

Upper and lower bounds for graph-diameter problems with application to record allocation.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1979

Computing Connected Components on Parallel Computers.

[BibT_eX]

[DOI]

Ashok K. Chandra

Dilip V. Sarwate

Commun. ACM, 1979

1978

An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1978

Bin Packing with Geometric Constraints in Computer Network Design.

[BibT_eX]

[DOI]

A. K. Chandra

Oper. Res., 1978

Fast Parallel Sorting Algorithms.

[BibT_eX]

[DOI]

Commun. ACM, 1978

1977

Algorithms for the Longest Common Subsequence Problem.

[BibT_eX]

[DOI]

J. ACM, 1977

Complexity of Common Subsequence Problems.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1977

1976

Approximate Algorithms for Some Generalized Knapsack Problems.

[BibT_eX]

[DOI]

Ashok K. Chandra

Theor. Comput. Sci., 1976

A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables.

[BibT_eX]

[DOI]

J. ACM, 1976

Bounds on the Complexity of the Longest Common Subsequence Problem.

[BibT_eX]

[DOI]

Alfred V. Aho

Jeffrey D. Ullman

J. ACM, 1976

An Insertion Technique for One-Sided Height-Balanced Trees.

[BibT_eX]

[DOI]

Commun. ACM, 1976

Parallel Algorithms for the Transitive Closure and the Connected Component Problems

[BibT_eX]

[DOI]

Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

1975

A Linear Space Algorithm for Computing Maximal Common Subsequences.

[BibT_eX]

[DOI]

Commun. ACM, 1975

1974

Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract)

[BibT_eX]

[DOI]

Alfred V. Aho

Jeffrey D. Ullman

Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1973

A Class of Dynamic Memory Allocation Algorithms.

[BibT_eX]

[DOI]