Joel I. Seiferas

According to our database1, Joel I. Seiferas
  • authored at least 66 papers between 1973 and 2011.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2011
AKS Network.
Proceedings of the Encyclopedia of Parallel Computing, 2011

2009
Sorting Networks of Logarithmic Depth, Further Simplified.
Algorithmica, 2009

2008
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks.
IEEE Trans. Computers, 2008

Optimizing data popularity conscious bloom filters.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Correlation-Aware Object Placement for Multi-Object Operations.
Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008

Replication degree customization for high availability.
Proceedings of the 2008 EuroSys Conference, Glasgow, Scotland, UK, April 1-4, 2008, 2008

2007
Object replication degree customization for high availability.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2005
Networks for sorting multitonic sequences.
J. Parallel Distrib. Comput., 2005

Non-uniform random membership management in peer-to-peer networks.
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.
SIAM J. Discrete Math., 2004

2002
Reprints from computing reviews.
SIGACT News, 2002

Reprints from Computing Reviews.
SIGACT News, 2002

Reprints from computing reviews.
SIGACT News, 2002

2001
Reprints from Computing Reviews.
SIGACT News, 2001

Reprints from computing reviews.
SIGACT News, 2001

Two heads are better than two tapes
CoRR, 2001

Counting is Easy
CoRR, 2001

2000
Reprints from Computing Reviews.
SIGACT News, 2000

Reprints from Computing Reviews.
SIGACT News, 2000

Reprints from Computing Reviews.
SIGACT News, 2000

1999
Reprints from Computing Reviews.
SIGACT News, 1999

Reprints from Computing Reviews.
SIGACT News, 1999

Amplification of slight probabilistic advantage at absolutely no cost in space.
Inf. Process. Lett., 1999

1998
Reprints from Computing Reviews.
SIGACT News, 1998

Reprints from Computing Reviews.
SIGACT News, 1998

Reprints from Computing Reviews.
SIGACT News, 1998

Reprints from computing reviews.
SIGACT News, 1998

1997
Reprints from Computing Reviews.
SIGACT News, 1997

Reprints from Computing Reviews.
SIGACT News, 1997

Reprints from Computing Reviews.
SIGACT News, 1997

Erratum: "Two heads are better that two tapes".
J. ACM, 1997

Two heads are better than two tapes.
J. ACM, 1997

1995
Characterizations of Realizable Space Complexities.
Ann. Pure Appl. Logic, 1995

1994
Bits and Relative Order From Residues, Space Efficiently.
Inf. Process. Lett., 1994

A Tight Lower Bound for On-line Monotonic List Labeling.
Proceedings of the Algorithm Theory, 1994

Two heads are better than two tapes.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1991
A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes
Inf. Comput., May, 1991

1990
Milking the Aanderaa Argument
Inf. Comput., September, 1990

Machine-Independent Complexity Theory.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990

1988
Counting is easy.
J. ACM, 1988

A Variant of Ben-Or's Lower Bound for Algebraic Decision Trees.
Inf. Process. Lett., 1988

1986
A Simplified Lower Bound for Context-Free-Language Recognition
Information and Control, 1986

1985
The Smallest Automaton Recognizing the Subwords of a Text.
Theor. Comput. Sci., 1985

1983
Time-Space-Optimal String Matching.
J. Comput. Syst. Sci., 1983

1981
Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations.
Theor. Comput. Sci., 1981

Limitations on Separating Nondeterministic Complexity Classes.
SIAM J. Comput., 1981

An Information-Theoretic Approach to Time Bounds for On-Line Computation.
J. Comput. Syst. Sci., 1981

New Real-Time Simulations of Multihead Tape Units.
J. ACM, 1981

Time-Space-Optimal String Matching
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980
Saving Space in Fast String-Matching.
SIAM J. Comput., 1980

An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version)
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1978
Correcting Counter-Automaton-Recognizable Languages.
SIAM J. Comput., 1978

Separating Nondeterministic Time Complexity Classes.
J. ACM, 1978

A Linear-Time On-Line Recognition Algorithm for "Palstar".
J. ACM, 1978

1977
Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays.
SIAM J. Comput., 1977

Real-Time Recognition of Substring Repetition and Reversal.
Mathematical Systems Theory, 1977

Relating Refined Space Complexity Classes.
J. Comput. Syst. Sci., 1977

Techniques for Separating Space Complexity Classes.
J. Comput. Syst. Sci., 1977

Iterative Arrays with Direct Central Control.
Acta Inf., 1977

New Real-Time Simulations of Multihead Tape Units
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

Saving Space in Fast String-Matching
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976
Regularity-Preserving Relations.
Theor. Comput. Sci., 1976

Recognizing Certain Repetitions and Reversals Within Strings
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1974
Observations on Nondeterministic Multidimensional Iterative Arrays
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

1973
Infinite Exponent Partition Relations and Well-Ordered Choice.
J. Symb. Log., 1973

Refinements of the Nondeterministic Time and Space Hierarchies
Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973


  Loading...