Joel I. Seiferas

Proceedings of the Encyclopedia of Parallel Computing, 2011

2009

Sorting Networks of Logarithmic Depth, Further Simplified.

[BibT_eX]

[DOI]

Algorithmica, 2009

2008

The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2008

Optimizing data popularity conscious bloom filters.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Correlation-Aware Object Placement for Multi-Object Operations.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008

Replication degree customization for high availability.

[BibT_eX]

[DOI]

Proceedings of the 2008 EuroSys Conference, Glasgow, Scotland, UK, April 1-4, 2008, 2008

2007

Object replication degree customization for high availability.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2005

Networks for sorting multitonic sequences.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2005

Non-uniform random membership management in peer-to-peer networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004

A Tight Lower Bound for Online Monotonic List Labeling.

[BibT_eX]

[DOI]

Paul F. Dietz

Ju Zhang

SIAM J. Discret. Math., 2004

2002

Reprints from computing reviews.

[BibT_eX]

[DOI]

SIGACT News, 2002

1999

Reprints from <i>Computing Reviews</i>.

[BibT_eX]

[DOI]

SIGACT News, 1999

Amplification of slight probabilistic advantage at absolutely no cost in space.

[BibT_eX]

[DOI]

Ioan I. Macarie

Inf. Process. Lett., 1999

1997

Erratum: "Two heads are better that two tapes".

[BibT_eX]

[DOI]

Tao Jiang

Paul M. B. Vitányi

J. ACM, 1997

Two heads are better than two tapes.

[BibT_eX]

[DOI]

Tao Jiang

Paul M. B. Vitányi

J. ACM, 1997

1995

Characterizations of Realizable Space Complexities.

[BibT_eX]

[DOI]

Albert R. Meyer

Ann. Pure Appl. Log., 1995

1994

Bits and Relative Order From Residues, Space Efficiently.

[BibT_eX]

[DOI]

Paul F. Dietz

Ioan I. Macarie

Inf. Process. Lett., 1994

A Tight Lower Bound for On-line Monotonic List Labeling.

[BibT_eX]

[DOI]

Paul F. Dietz

Ju Zhang

Proceedings of the Algorithm Theory, 1994

1991

A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes

[BibT_eX]

[DOI]

John G. Geske

Dung T. Huynh

Inf. Comput., May, 1991

1990

Milking the Aanderaa Argument

[BibT_eX]

[DOI]

Ramamohan Paturi

Janos Simon

Richard E. Newman-Wolfe

Inf. Comput., September, 1990

Machine-Independent Complexity Theory.

[BibT_eX]

Proceedings of the Handbook of Theoretical Computer Science, 1990

1988

Counting is easy.

[BibT_eX]

[DOI]

Paul M. B. Vitányi

J. ACM, 1988

A Variant of Ben-Or's Lower Bound for Algebraic Decision Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

1986

A Simplified Lower Bound for Context-Free-Language Recognition

[BibT_eX]

[DOI]

Inf. Control., 1986

1985

The Smallest Automaton Recognizing the Subwords of a Text.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

1983

Time-Space-Optimal String Matching.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1983

1981

Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1981

Limitations on Separating Nondeterministic Complexity Classes.

[BibT_eX]

[DOI]

Charles Rackoff

SIAM J. Comput., 1981

An Information-Theoretic Approach to Time Bounds for On-Line Computation.

[BibT_eX]

[DOI]

Wolfgang J. Paul

Janos Simon

J. Comput. Syst. Sci., 1981

New Real-Time Simulations of Multihead Tape Units.

[BibT_eX]

[DOI]

Benton L. Leong

J. ACM, 1981

1980

Saving Space in Fast String-Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1980

An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version)

[BibT_eX]

[DOI]

Wolfgang J. Paul

Janos Simon

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1978

Correcting Counter-Automaton-Recognizable Languages.

[BibT_eX]

[DOI]

Robert A. Wagner

SIAM J. Comput., 1978

Separating Nondeterministic Time Complexity Classes.

[BibT_eX]

[DOI]

Michael J. Fischer

Albert R. Meyer

J. ACM, 1978

A Linear-Time On-Line Recognition Algorithm for "Palstar".

[BibT_eX]

[DOI]

J. ACM, 1978

1977

Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays.

[BibT_eX]

[DOI]

SIAM J. Comput., 1977

Real-Time Recognition of Substring Repetition and Reversal.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1977

Relating Refined Space Complexity Classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1977

Techniques for Separating Space Complexity Classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1977

Iterative Arrays with Direct Central Control.

[BibT_eX]

[DOI]

Acta Informatica, 1977

1976

Regularity-Preserving Relations.

[BibT_eX]

[DOI]

Robert McNaughton

Theor. Comput. Sci., 1976

Recognizing Certain Repetitions and Reversals Within Strings

[BibT_eX]

[DOI]

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1974

A note on prefixes of regular languages.

[BibT_eX]

[DOI]

SIGACT News, 1974

Observations on Nondeterministic Multidimensional Iterative Arrays

[BibT_eX]

[DOI]

Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

1973

Infinite Exponent Partition Relations and Well-Ordered Choice.

[BibT_eX]

[DOI]

E. M. Kleinberg

J. Symb. Log., 1973

Refinements of the Nondeterministic Time and Space Hierarchies

[BibT_eX]

[DOI]