Joel I. Seiferas

68 papers A* 11A 2Journal 51Unranked 2

Year	Rank	Type	Title / Venue / Authors
2011	—	`ch.`	AKS Network. Encyclopedia of Parallel Computing Joel I. Seiferas
2009	J	`jnl`	Sorting Networks of Logarithmic Depth, Further Simplified. Algorithmica Joel I. Seiferas
2008	A	`conf`	Correlation-Aware Object Placement for Multi-Object Operations. ICDCS Ming Zhong, Kai Shen, Joel I. Seiferas
2008	A*	`conf`	Optimizing data popularity conscious bloom filters. PODC Ming Zhong, Pin Lu, Kai Shen, Joel I. Seiferas
2008	A	`conf`	Replication degree customization for high availability. EuroSys Ming Zhong, Kai Shen, Joel I. Seiferas
2008	J	`jnl`	The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks. IEEE Trans. Computers Ming Zhong, Kai Shen, Joel I. Seiferas
2007	A*	`conf`	Object replication degree customization for high availability. PODC Ming Zhong, Kai Shen, Joel I. Seiferas
2005	J	`jnl`	Networks for sorting multitonic sequences. J. Parallel Distributed Comput. Joel I. Seiferas
2005	A*	`conf`	Non-uniform random membership management in peer-to-peer networks. INFOCOM Ming Zhong, Kai Shen, Joel I. Seiferas
2004	J	`jnl`	A Tight Lower Bound for Online Monotonic List Labeling. SIAM J. Discret. Math. Paul F. Dietz, Joel I. Seiferas, Ju Zhang
2002	J	`jnl`	Reprints from Computing Reviews. SIGACT News Joel I. Seiferas
2002	J	`jnl`	Reprints from computing reviews. SIGACT News Joel I. Seiferas
2002	J	`jnl`	Reprints from computing reviews. SIGACT News Joel I. Seiferas
2001	J	`jnl`	Counting is Easy CoRR Joel I. Seiferas, Paul M. B. Vitányi
2001	J	`jnl`	Reprints from Computing Reviews. SIGACT News Joel I. Seiferas
2001	J	`jnl`	Reprints from computing reviews. SIGACT News Joel I. Seiferas
2001	J	`jnl`	Two heads are better than two tapes CoRR Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
2000	J	`jnl`	Reprints from SIGACT News Joel I. Seiferas
2000	J	`jnl`	Reprints from Computing Reviews. SIGACT News Joel I. Seiferas
2000	J	`jnl`	Reprints from Computing Reviews. SIGACT News Joel I. Seiferas
1999	J	`jnl`	Amplification of slight probabilistic advantage at absolutely no cost in space. Inf. Process. Lett. Ioan I. Macarie, Joel I. Seiferas
1999	J	`jnl`	Reprints from SIGACT News Joel I. Seiferas
1999	J	`jnl`	Reprints from Computing Reviews. SIGACT News Joel I. Seiferas
1998	J	`jnl`	Reprints from Computing Reviews. SIGACT News Joel I. Seiferas
1998	J	`jnl`	Reprints from Computing Reviews. SIGACT News Joel I. Seiferas
1998	J	`jnl`	Reprints from Computing Reviews. SIGACT News Joel I. Seiferas
1998	J	`jnl`	Reprints from computing reviews. SIGACT News Joel I. Seiferas
1997	J	`jnl`	Erratum: "Two heads are better that two tapes". J. ACM Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
1997	J	`jnl`	Reprints from Computing Reviews. SIGACT News Joel I. Seiferas
1997	J	`jnl`	Reprints from Computing Reviews. SIGACT News Joel I. Seiferas
1997	J	`jnl`	Reprints from Computing Reviews. SIGACT News Joel I. Seiferas
1997	J	`jnl`	Two heads are better than two tapes. J. ACM Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
1995	J	`jnl`	Characterizations of Realizable Space Complexities. Ann. Pure Appl. Log. Joel I. Seiferas, Albert R. Meyer
1994	—	`conf`	A Tight Lower Bound for On-line Monotonic List Labeling. SWAT Paul F. Dietz, Joel I. Seiferas, Ju Zhang
1994	J	`jnl`	Bits and Relative Order From Residues, Space Efficiently. Inf. Process. Lett. Paul F. Dietz, Ioan I. Macarie, Joel I. Seiferas
1994	A*	`conf`	Two heads are better than two tapes. STOC Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi
1991	J	`jnl`	A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes Inf. Comput. John G. Geske, Dung T. Huynh, Joel I. Seiferas
1990	—	`ch.`	Machine-Independent Complexity Theory. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) Joel I. Seiferas
1990	J	`jnl`	Milking the Aanderaa Argument Inf. Comput. Ramamohan Paturi, Joel I. Seiferas, Janos Simon, Richard E. Newman-Wolfe
1988	J	`jnl`	A Variant of Ben-Or's Lower Bound for Algebraic Decision Trees. Inf. Process. Lett. Joel I. Seiferas
1988	J	`jnl`	Counting is easy. J. ACM Joel I. Seiferas, Paul M. B. Vitányi
1986	J	`jnl`	A Simplified Lower Bound for Context-Free-Language Recognition Inf. Control. Joel I. Seiferas
1985	J	`jnl`	The Smallest Automaton Recognizing the Subwords of a Text. Theor. Comput. Sci. Anselm Blumer, J. Blumer, David Haussler, Andrzej Ehrenfeucht, M. T. Chen, Joel I. Seiferas
1983	A*	`ed.`	Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA STOC David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, Joel I. Seiferas
1983	J	`jnl`	Time-Space-Optimal String Matching. J. Comput. Syst. Sci. Zvi Galil, Joel I. Seiferas
1981	J	`jnl`	An Information-Theoretic Approach to Time Bounds for On-Line Computation. J. Comput. Syst. Sci. Wolfgang J. Paul, Joel I. Seiferas, Janos Simon
1981	J	`jnl`	Limitations on Separating Nondeterministic Complexity Classes. SIAM J. Comput. Charles Rackoff, Joel I. Seiferas
1981	J	`jnl`	Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations. Theor. Comput. Sci. Zvi Galil, Joel I. Seiferas
1981	J	`jnl`	New Real-Time Simulations of Multihead Tape Units. J. ACM Benton L. Leong, Joel I. Seiferas
1981	A*	`conf`	Time-Space-Optimal String Matching STOC Zvi Galil, Joel I. Seiferas
1980	A*	`conf`	An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version) STOC Wolfgang J. Paul, Joel I. Seiferas, Janos Simon
1980	J	`jnl`	Saving Space in Fast String-Matching. SIAM J. Comput. Zvi Galil, Joel I. Seiferas
1978	J	`jnl`	A Linear-Time On-Line Recognition Algorithm for "Palstar". J. ACM Zvi Galil, Joel I. Seiferas
1978	J	`jnl`	Correcting Counter-Automaton-Recognizable Languages. SIAM J. Comput. Robert A. Wagner, Joel I. Seiferas
1978	J	`jnl`	Separating Nondeterministic Time Complexity Classes. J. ACM Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer
1977	J	`jnl`	Iterative Arrays with Direct Central Control. Acta Informatica Joel I. Seiferas
1977	J	`jnl`	Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays. SIAM J. Comput. Joel I. Seiferas
1977	A*	`conf`	New Real-Time Simulations of Multihead Tape Units STOC Benton L. Leong, Joel I. Seiferas
1977	J	`jnl`	Real-Time Recognition of Substring Repetition and Reversal. Math. Syst. Theory Joel I. Seiferas, Zvi Galil
1977	J	`jnl`	Relating Refined Space Complexity Classes. J. Comput. Syst. Sci. Joel I. Seiferas
1977	A*	`conf`	Saving Space in Fast String-Matching FOCS Zvi Galil, Joel I. Seiferas
1977	J	`jnl`	Techniques for Separating Space Complexity Classes. J. Comput. Syst. Sci. Joel I. Seiferas
1976	A*	`conf`	Recognizing Certain Repetitions and Reversals Within Strings FOCS Zvi Galil, Joel I. Seiferas
1976	J	`jnl`	Regularity-Preserving Relations. Theor. Comput. Sci. Joel I. Seiferas, Robert McNaughton
1974	J	`jnl`	A note on prefixes of regular languages. SIGACT News Joel I. Seiferas
1974	A*	`conf`	Observations on Nondeterministic Multidimensional Iterative Arrays STOC Joel I. Seiferas
1973	J	`jnl`	Infinite Exponent Partition Relations and Well-Ordered Choice. J. Symb. Log. E. M. Kleinberg, Joel I. Seiferas
1973	—	`conf`	Refinements of the Nondeterministic Time and Space Hierarchies SWAT Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer