Refinements of the Nondeterministic Time and Space Hierarchies - Joel I. Seiferas; Michael J. Fischer; Albert R. Meyer (SWAT, 1973)

Infinite Exponent Partition Relations and Well-Ordered Choice. - E. M. Kleinberg; Joel I. Seiferas (J. Symb. Log., 1973)

Observations on Nondeterministic Multidimensional Iterative Arrays - Joel I. Seiferas (STOC, 1974)

A note on prefixes of regular languages. - Joel I. Seiferas (SIGACT News, 1974)

Recognizing Certain Repetitions and Reversals Within Strings - Zvi Galil; Joel I. Seiferas (FOCS, 1976)

Regularity-Preserving Relations. - Joel I. Seiferas; Robert McNaughton (Theor. Comput. Sci., 1976)

Iterative Arrays with Direct Central Control. - Joel I. Seiferas (Acta Informatica, 1977)

Techniques for Separating Space Complexity Classes. - Joel I. Seiferas (J. Comput. Syst. Sci., 1977)

Relating Refined Space Complexity Classes. - Joel I. Seiferas (J. Comput. Syst. Sci., 1977)

Real-Time Recognition of Substring Repetition and Reversal. - Joel I. Seiferas; Zvi Galil (Math. Syst. Theory, 1977)

Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays. - Joel I. Seiferas (SIAM J. Comput., 1977)

A Linear-Time On-Line Recognition Algorithm for "Palstar". - Zvi Galil; Joel I. Seiferas (J. ACM, 1978)

Separating Nondeterministic Time Complexity Classes. - Joel I. Seiferas; Michael J. Fischer; Albert R. Meyer (J. ACM, 1978)

Correcting Counter-Automaton-Recognizable Languages. - Robert A. Wagner; Joel I. Seiferas (SIAM J. Comput., 1978)

An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version) - Wolfgang J. Paul; Joel I. Seiferas; Janos Simon (STOC, 1980)

Saving Space in Fast String-Matching. - Zvi Galil; Joel I. Seiferas (SIAM J. Comput., 1980)

New Real-Time Simulations of Multihead Tape Units. - Benton L. Leong; Joel I. Seiferas (J. ACM, 1981)

An Information-Theoretic Approach to Time Bounds for On-Line Computation. - Wolfgang J. Paul; Joel I. Seiferas; Janos Simon (J. Comput. Syst. Sci., 1981)

Limitations on Separating Nondeterministic Complexity Classes. - Charles Rackoff; Joel I. Seiferas (SIAM J. Comput., 1981)

Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations. - Zvi Galil; Joel I. Seiferas (Theor. Comput. Sci., 1981)

Time-Space-Optimal String Matching. - Zvi Galil; Joel I. Seiferas (J. Comput. Syst. Sci., 1983)

The Smallest Automaton Recognizing the Subwords of a Text. - Anselm Blumer; J. Blumer; David Haussler; Andrzej Ehrenfeucht; M. T. Chen; Joel I. Seiferas (Theor. Comput. Sci., 1985)

A Simplified Lower Bound for Context-Free-Language Recognition - Joel I. Seiferas (Inf. Control., 1986)

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

Counting is easy. - Joel I. Seiferas; Paul M. B. Vitányi (J. ACM, 1988)

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

Milking the Aanderaa Argument - Ramamohan Paturi; Joel I. Seiferas; Janos Simon; Richard E. Newman-Wolfe (Inf. Comput., 1990)

A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes - John G. Geske; Dung T. Huynh; Joel I. Seiferas (Inf. Comput., 1991)

A Tight Lower Bound for On-line Monotonic List Labeling. - Paul F. Dietz; Joel I. Seiferas; Ju Zhang (SWAT, 1994)

Bits and Relative Order From Residues, Space Efficiently. - Paul F. Dietz; Ioan I. Macarie; Joel I. Seiferas (Inf. Process. Lett., 1994)

Characterizations of Realizable Space Complexities. - Joel I. Seiferas; Albert R. Meyer (Ann. Pure Appl. Log., 1995)

Two heads are better than two tapes. - Tao Jiang 001; Joel I. Seiferas; Paul M. B. Vitányi (J. ACM, 1997)

Erratum: "Two heads are better that two tapes". - Tao Jiang 001; Joel I. Seiferas; Paul M. B. Vitányi (J. ACM, 1997)

Amplification of slight probabilistic advantage at absolutely no cost in space. - Ioan I. Macarie; Joel I. Seiferas (Inf. Process. Lett., 1999)

Reprints from Computing Reviews. - Joel I. Seiferas (SIGACT News, 1999)

Reprints from computing reviews. - Joel I. Seiferas (SIGACT News, 2002)

A Tight Lower Bound for Online Monotonic List Labeling. - Paul F. Dietz; Joel I. Seiferas; Ju Zhang (SIAM J. Discret. Math., 2004)

Non-uniform random membership management in peer-to-peer networks. - Ming Zhong 006; Kai Shen; Joel I. Seiferas (INFOCOM, 2005)

Networks for sorting multitonic sequences. - Joel I. Seiferas (J. Parallel Distributed Comput., 2005)

Object replication degree customization for high availability. - Ming Zhong 006; Kai Shen; Joel I. Seiferas (PODC, 2007)

Replication degree customization for high availability. - Ming Zhong 006; Kai Shen; Joel I. Seiferas (EuroSys, 2008)

Correlation-Aware Object Placement for Multi-Object Operations. - Ming Zhong 006; Kai Shen; Joel I. Seiferas (ICDCS, 2008)

Optimizing data popularity conscious bloom filters. - Ming Zhong 006; Pin Lu; Kai Shen; Joel I. Seiferas (PODC, 2008)

The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks. - Ming Zhong 006; Kai Shen; Joel I. Seiferas (IEEE Trans. Computers, 2008)

Sorting Networks of Logarithmic Depth, Further Simplified. - Joel I. Seiferas (Algorithmica, 2009)

AKS Network. - Joel I. Seiferas (Encyclopedia of Parallel Computing, 2011)