| 2009 |
|---|
| 48 | EE | Joel I. Seiferas:
Sorting Networks of Logarithmic Depth, Further Simplified.
Algorithmica 53(3): 374-384 (2009) |
| 2008 |
|---|
| 47 | EE | Ming Zhong,
Kai Shen,
Joel I. Seiferas:
Replication degree customization for high availability.
EuroSys 2008: 55-68 |
| 46 | EE | Ming Zhong,
Kai Shen,
Joel I. Seiferas:
Correlation-Aware Object Placement for Multi-Object Operations.
ICDCS 2008: 512-521 |
| 45 | EE | Ming Zhong,
Pin Lu,
Kai Shen,
Joel I. Seiferas:
Optimizing data popularity conscious bloom filters.
PODC 2008: 355-364 |
| 44 | EE | Ming Zhong,
Kai Shen,
Joel I. Seiferas:
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks.
IEEE Trans. Computers 57(5): 619-633 (2008) |
| 2007 |
|---|
| 43 | EE | Ming Zhong,
Kai Shen,
Joel I. Seiferas:
Object replication degree customization for high availability.
PODC 2007: 344-345 |
| 2005 |
|---|
| 42 | EE | Ming Zhong,
Kai Shen,
Joel I. Seiferas:
Non-uniform random membership management in peer-to-peer networks.
INFOCOM 2005: 1151-1161 |
| 41 | EE | Joel I. Seiferas:
Networks for sorting multitonic sequences.
J. Parallel Distrib. Comput. 65(12): 1601-1606 (2005) |
| 2004 |
|---|
| 40 | EE | Paul F. Dietz,
Joel I. Seiferas,
Ju Zhang:
A Tight Lower Bound for Online Monotonic List Labeling.
SIAM J. Discrete Math. 18(3): 626-637 (2004) |
| 2001 |
|---|
| 39 | EE | Joel I. Seiferas,
Paul M. B. Vitányi:
Counting is Easy
CoRR cs.CC/0110038: (2001) |
| 38 | EE | Tao Jiang,
Joel I. Seiferas,
Paul M. B. Vitányi:
Two heads are better than two tapes
CoRR cs.CC/0110039: (2001) |
| 1999 |
|---|
| 37 | EE | Ioan I. Macarie,
Joel I. Seiferas:
Amplification of slight probabilistic advantage at absolutely no cost in space.
Inf. Process. Lett. 72(3-4): 113-118 (1999) |
| 1997 |
|---|
| 36 | EE | Tao Jiang,
Joel I. Seiferas,
Paul M. B. Vitányi:
Two heads are better than two tapes.
J. ACM 44(2): 237-256 (1997) |
| 35 | EE | Tao Jiang,
Joel I. Seiferas,
Paul M. B. Vitányi:
Erratum: ``Two heads are better that two tapes''.
J. ACM 44(4): 632 (1997) |
| 1995 |
|---|
| 34 | | Joel I. Seiferas,
Albert R. Meyer:
Characterizations of Realizable Space Complexities.
Ann. Pure Appl. Logic 73(2): 171-190 (1995) |
| 1994 |
|---|
| 33 | EE | Tao Jiang,
Joel I. Seiferas,
Paul M. B. Vitányi:
Two heads are better than two tapes.
STOC 1994: 668-675 |
| 32 | | Paul F. Dietz,
Joel I. Seiferas,
Ju Zhang:
A Tight Lower Bound for On-line Monotonic List Labeling.
SWAT 1994: 131-142 |
| 31 | | Paul F. Dietz,
Ioan I. Macarie,
Joel I. Seiferas:
Bits and Relative Order From Residues, Space Efficiently.
Inf. Process. Lett. 50(3): 123-127 (1994) |
| 1991 |
|---|
| 30 | | John G. Geske,
Dung T. Huynh,
Joel I. Seiferas:
A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes
Inf. Comput. 92(1): 97-104 (1991) |
| 1990 |
|---|
| 29 | | Joel I. Seiferas:
Machine-Independent Complexity Theory.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 163-186 |
| 28 | | Ramamohan Paturi,
Joel I. Seiferas,
Janos Simon,
Richard E. Newman-Wolfe:
Milking the Aanderaa Argument
Inf. Comput. 88(1): 88-104 (1990) |
| 1988 |
|---|
| 27 | | Joel I. Seiferas:
A Variant of Ben-Or's Lower Bound for Algebraic Decision Trees.
Inf. Process. Lett. 26(5): 273-276 (1988) |
| 26 | EE | Joel I. Seiferas,
Paul M. B. Vitányi:
Counting is easy.
J. ACM 35(4): 985-1000 (1988) |
| 1986 |
|---|
| 25 | | Joel I. Seiferas:
A Simplified Lower Bound for Context-Free-Language Recognition
Information and Control 69(1-3): 255-260 (1986) |
| 1985 |
|---|
| 24 | | Anselm Blumer,
J. Blumer,
David Haussler,
Andrzej Ehrenfeucht,
M. T. Chen,
Joel I. Seiferas:
The Smallest Automaton Recognizing the Subwords of a Text.
Theor. Comput. Sci. 40: 31-55 (1985) |
| 1983 |
|---|
| 23 | | Zvi Galil,
Joel I. Seiferas:
Time-Space-Optimal String Matching.
J. Comput. Syst. Sci. 26(3): 280-294 (1983) |
| 1981 |
|---|
| 22 | | Zvi Galil,
Joel I. Seiferas:
Time-Space-Optimal String Matching
STOC 1981: 106-113 |
| 21 | EE | Benton L. Leong,
Joel I. Seiferas:
New Real-Time Simulations of Multihead Tape Units.
J. ACM 28(1): 166-180 (1981) |
| 20 | | Wolfgang J. Paul,
Joel I. Seiferas,
Janos Simon:
An Information-Theoretic Approach to Time Bounds for On-Line Computation.
J. Comput. Syst. Sci. 23(2): 108-126 (1981) |
| 19 | | Charles Rackoff,
Joel I. Seiferas:
Limitations on Separating Nondeterministic Complexity Classes.
SIAM J. Comput. 10(4): 742-745 (1981) |
| 18 | | Zvi Galil,
Joel I. Seiferas:
Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations.
Theor. Comput. Sci. 13: 331-336 (1981) |
| 1980 |
|---|
| 17 | | Wolfgang J. Paul,
Joel I. Seiferas,
Janos Simon:
An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version)
STOC 1980: 357-367 |
| 16 | | Zvi Galil,
Joel I. Seiferas:
Saving Space in Fast String-Matching.
SIAM J. Comput. 9(2): 417-438 (1980) |
| 1978 |
|---|
| 15 | EE | Zvi Galil,
Joel I. Seiferas:
A Linear-Time On-Line Recognition Algorithm for ``Palstar''.
J. ACM 25(1): 102-111 (1978) |
| 14 | EE | Joel I. Seiferas,
Michael J. Fischer,
Albert R. Meyer:
Separating Nondeterministic Time Complexity Classes.
J. ACM 25(1): 146-167 (1978) |
| 13 | | Robert A. Wagner,
Joel I. Seiferas:
Correcting Counter-Automaton-Recognizable Languages.
SIAM J. Comput. 7(3): 357-375 (1978) |
| 1977 |
|---|
| 12 | | Zvi Galil,
Joel I. Seiferas:
Saving Space in Fast String-Matching
FOCS 1977: 179-188 |
| 11 | | Benton L. Leong,
Joel I. Seiferas:
New Real-Time Simulations of Multihead Tape Units
STOC 1977: 239-248 |
| 10 | | Joel I. Seiferas:
Iterative Arrays with Direct Central Control
Acta Inf. 8: 177-192 (1977) |
| 9 | | Joel I. Seiferas:
Relating Refined Space Complexity Classes.
J. Comput. Syst. Sci. 14(1): 100-129 (1977) |
| 8 | | Joel I. Seiferas:
Techniques for Separating Space Complexity Classes.
J. Comput. Syst. Sci. 14(1): 73-99 (1977) |
| 7 | | Joel I. Seiferas,
Zvi Galil:
Real-Time Recognition of Substring Repetition and Reversal.
Mathematical Systems Theory 11: 111-146 (1977) |
| 6 | | Joel I. Seiferas:
Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays.
SIAM J. Comput. 6(3): 487-504 (1977) |
| 1976 |
|---|
| 5 | | Zvi Galil,
Joel I. Seiferas:
Recognizing Certain Repetitions and Reversals Within Strings
FOCS 1976: 236-252 |
| 4 | | Joel I. Seiferas,
Robert McNaughton:
Regularity-Preserving Relations.
Theor. Comput. Sci. 2(2): 147-154 (1976) |
| 1974 |
|---|
| 3 | | Joel I. Seiferas:
Observations on Nondeterministic Multidimensional Iterative Arrays
STOC 1974: 276-289 |
| 1973 |
|---|
| 2 | | Joel I. Seiferas,
Michael J. Fischer,
Albert R. Meyer:
Refinements of the Nondeterministic Time and Space Hierarchies
FOCS 1973: 130-137 |
| 1 | | E. M. Kleinberg,
Joel I. Seiferas:
Infinite Exponent Partition Relations and Well-Ordered Choice.
J. Symb. Log. 38(2): 299-308 (1973) |
