The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joel I. Seiferas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  43. Correlation-Aware Object Placement for Multi-Object Operations. [Citation Graph (, )][DBLP]


  44. Optimizing data popularity conscious bloom filters. [Citation Graph (, )][DBLP]


  45. Replication degree customization for high availability. [Citation Graph (, )][DBLP]


  46. Sorting Networks of Logarithmic Depth, Further Simplified. [Citation Graph (, )][DBLP]


Search in 0.012secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002