default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoel I. Seiferas
Person information
- affiliation: University of Rochester, New York, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[r1]Joel I. Seiferas:
AKS Network. Encyclopedia of Parallel Computing 2011: 16-23
2000 – 2009
- 2009
- [j49]Joel I. Seiferas:
Sorting Networks of Logarithmic Depth, Further Simplified. Algorithmica 53(3): 374-384 (2009) - 2008
- [j48]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) - [c14]Ming Zhong, Kai Shen, Joel I. Seiferas:
Replication degree customization for high availability. EuroSys 2008: 55-68 - [c13]Ming Zhong, Kai Shen, Joel I. Seiferas:
Correlation-Aware Object Placement for Multi-Object Operations. ICDCS 2008: 512-521 - [c12]Ming Zhong, Pin Lu, Kai Shen, Joel I. Seiferas:
Optimizing data popularity conscious bloom filters. PODC 2008: 355-364 - 2007
- [c11]Ming Zhong, Kai Shen, Joel I. Seiferas:
Object replication degree customization for high availability. PODC 2007: 344-345 - 2005
- [j47]Joel I. Seiferas:
Networks for sorting multitonic sequences. J. Parallel Distributed Comput. 65(12): 1601-1606 (2005) - [c10]Ming Zhong, Kai Shen, Joel I. Seiferas:
Non-uniform random membership management in peer-to-peer networks. INFOCOM 2005: 1151-1161 - 2004
- [j46]Paul F. Dietz, Joel I. Seiferas, Ju Zhang:
A Tight Lower Bound for Online Monotonic List Labeling. SIAM J. Discret. Math. 18(3): 626-637 (2004) - 2002
- [j45]Joel I. Seiferas:
Reprints from computing reviews. SIGACT News 33(1): 21-22 (2002) - [j44]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 33(2): 21-23 (2002) - [j43]Joel I. Seiferas:
Reprints from computing reviews. SIGACT News 33(3): 23-24 (2002) - 2001
- [j42]Joel I. Seiferas:
Reprints from computing reviews. SIGACT News 32(1): 17-18 (2001) - [j41]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 32(2): 20-21 (2001) - [i2]Joel I. Seiferas, Paul M. B. Vitányi:
Counting is Easy. CoRR cs.CC/0110038 (2001) - [i1]Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi:
Two heads are better than two tapes. CoRR cs.CC/0110039 (2001) - 2000
- [j40]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 31(2): 12-13 (2000) - [j39]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 31(3): 27-28 (2000) - [j38]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 31(4): 27 (2000)
1990 – 1999
- 1999
- [j37]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) - [j36]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 30(1): 12-13 (1999) - [j35]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 30(2): 17-18 (1999) - 1998
- [j34]Joel I. Seiferas:
Reprints from computing reviews. SIGACT News 29(1): 13-14 (1998) - [j33]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 29(2): 27-28 (1998) - [j32]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 29(3): 53-54 (1998) - [j31]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 29(4): 15-16 (1998) - 1997
- [j30]Tao Jiang
, Joel I. Seiferas, Paul M. B. Vitányi:
Two heads are better than two tapes. J. ACM 44(2): 237-256 (1997) - [j29]Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi:
Erratum: "Two heads are better that two tapes". J. ACM 44(4): 632 (1997) - [j28]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 28(2): 32-33 (1997) - [j27]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 28(3): 30 (1997) - [j26]Joel I. Seiferas:
Reprints from Computing Reviews. SIGACT News 28(4): 28-30 (1997) - 1995
- [j25]Joel I. Seiferas, Albert R. Meyer:
Characterizations of Realizable Space Complexities. Ann. Pure Appl. Log. 73(2): 171-190 (1995) - 1994
- [j24]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) - [c9]Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi:
Two heads are better than two tapes. STOC 1994: 668-675 - [c8]Paul F. Dietz, Joel I. Seiferas, Ju Zhang:
A Tight Lower Bound for On-line Monotonic List Labeling. SWAT 1994: 131-142 - 1991
- [j23]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
- [j22]Ramamohan Paturi, Joel I. Seiferas, Janos Simon, Richard E. Newman-Wolfe:
Milking the Aanderaa Argument. Inf. Comput. 88(1): 88-104 (1990) - [p1]Joel I. Seiferas:
Machine-Independent Complexity Theory. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 163-186
1980 – 1989
- 1988
- [j21]Joel I. Seiferas:
A Variant of Ben-Or's Lower Bound for Algebraic Decision Trees. Inf. Process. Lett. 26(5): 273-276 (1988) - [j20]Joel I. Seiferas, Paul M. B. Vitányi:
Counting is easy. J. ACM 35(4): 985-1000 (1988) - 1986
- [j19]Joel I. Seiferas:
A Simplified Lower Bound for Context-Free-Language Recognition. Inf. Control. 69(1-3): 255-260 (1986) - 1985
- [j18]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
- [j17]Zvi Galil, Joel I. Seiferas:
Time-Space-Optimal String Matching. J. Comput. Syst. Sci. 26(3): 280-294 (1983) - [e1]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:
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA. ACM 1983 [contents] - 1981
- [j16]Benton L. Leong, Joel I. Seiferas:
New Real-Time Simulations of Multihead Tape Units. J. ACM 28(1): 166-180 (1981) - [j15]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) - [j14]Charles Rackoff, Joel I. Seiferas:
Limitations on Separating Nondeterministic Complexity Classes. SIAM J. Comput. 10(4): 742-745 (1981) - [j13]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) - [c7]Zvi Galil, Joel I. Seiferas:
Time-Space-Optimal String Matching. STOC 1981: 106-113 - 1980
- [j12]Zvi Galil, Joel I. Seiferas:
Saving Space in Fast String-Matching. SIAM J. Comput. 9(2): 417-438 (1980) - [c6]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
1970 – 1979
- 1978
- [j11]Zvi Galil, Joel I. Seiferas:
A Linear-Time On-Line Recognition Algorithm for "Palstar". J. ACM 25(1): 102-111 (1978) - [j10]Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer:
Separating Nondeterministic Time Complexity Classes. J. ACM 25(1): 146-167 (1978) - [j9]Robert A. Wagner, Joel I. Seiferas:
Correcting Counter-Automaton-Recognizable Languages. SIAM J. Comput. 7(3): 357-375 (1978) - 1977
- [j8]Joel I. Seiferas:
Iterative Arrays with Direct Central Control. Acta Informatica 8: 177-192 (1977) - [j7]Joel I. Seiferas:
Techniques for Separating Space Complexity Classes. J. Comput. Syst. Sci. 14(1): 73-99 (1977) - [j6]Joel I. Seiferas:
Relating Refined Space Complexity Classes. J. Comput. Syst. Sci. 14(1): 100-129 (1977) - [j5]Joel I. Seiferas, Zvi Galil:
Real-Time Recognition of Substring Repetition and Reversal. Math. Syst. Theory 11: 111-146 (1977) - [j4]Joel I. Seiferas:
Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays. SIAM J. Comput. 6(3): 487-504 (1977) - [c5]Zvi Galil, Joel I. Seiferas:
Saving Space in Fast String-Matching. FOCS 1977: 179-188 - [c4]Benton L. Leong, Joel I. Seiferas:
New Real-Time Simulations of Multihead Tape Units. STOC 1977: 239-248 - 1976
- [j3]Joel I. Seiferas, Robert McNaughton:
Regularity-Preserving Relations. Theor. Comput. Sci. 2(2): 147-154 (1976) - [c3]Zvi Galil, Joel I. Seiferas:
Recognizing Certain Repetitions and Reversals Within Strings. FOCS 1976: 236-252 - 1974
- [j2]Joel I. Seiferas:
A note on prefixes of regular languages. SIGACT News 6(1): 25-29 (1974) - [c2]Joel I. Seiferas:
Observations on Nondeterministic Multidimensional Iterative Arrays. STOC 1974: 276-289 - 1973
- [j1]E. M. Kleinberg, Joel I. Seiferas:
Infinite Exponent Partition Relations and Well-Ordered Choice. J. Symb. Log. 38(2): 299-308 (1973) - [c1]Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer:
Refinements of the Nondeterministic Time and Space Hierarchies. SWAT 1973: 130-137
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
