Joel I. Seiferas - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 64 from 64

2009

Sorting Networks of Logarithmic Depth, Further SimplifiedJoel I. Seiferas. algorithmica, 53(3):374-384, 2009. [doi]

2008

2007

Object replication degree customization for high availabilityMing Zhong, Kai Shen, Joel I. Seiferas. podc 2007: 344-345 [doi]

2005

Networks for sorting multitonic sequencesJoel I. Seiferas. jpdc, 65(12):1601-1606, 2005. [doi]

Non-uniform random membership management in peer-to-peer networksMing Zhong, Kai Shen, Joel I. Seiferas. infocom 2005: 1151-1161 [doi]

2004

A Tight Lower Bound for Online Monotonic List LabelingPaul F. Dietz, Joel I. Seiferas, Ju Zhang. siamdm, 18(3):626-637, 2004. [doi]

2002

Reprints from computing reviewsJoel I. Seiferas. sigact, 33(1):21-22, 2002. [doi]

Reprints from computing reviewsJoel I. Seiferas. sigact, 33(3):23-24, 2002. [doi]

Reprints from Computing ReviewsJoel I. Seiferas. sigact, 33(2):21-23, 2002. [doi]

2001

Reprints from computing reviewsJoel I. Seiferas. sigact, 32(1):17-18, 2001. [doi]

Reprints from Computing ReviewsJoel I. Seiferas. sigact, 32(2):20-21, 2001. [doi]

2000

Reprints from Computing ReviewsJoel I. Seiferas. sigact, 31(3):27-28, 2000. [doi]

Reprints from ::::Computing Reviews::::Joel I. Seiferas. sigact, 31(4):27, 2000. [doi]

Reprints from Computing ReviewsJoel I. Seiferas. sigact, 31(2):12-13, 2000. [doi]

1999

Amplification of slight probabilistic advantage at absolutely no cost in spaceIoan I. Macarie, Joel I. Seiferas. ipl, 72(3-4):113-118, 1999. [doi]

Reprints from Computing ReviewsJoel I. Seiferas. sigact, 30(1):12-13, 1999. [doi]

Reprints from ::::Computing Reviews::::Joel I. Seiferas. sigact, 30(2):17-18, 1999. [doi]

1998

Reprints from Computing ReviewsJoel I. Seiferas. sigact, 29(4):15-16, 1998. [doi]

Reprints from computing reviewsJoel I. Seiferas. sigact, 29(1):13-14, 1998. [doi]

Reprints from Computing ReviewsJoel I. Seiferas. sigact, 29(2):27-28, 1998. [doi]

Reprints from Computing ReviewsJoel I. Seiferas. sigact, 29(3):53-54, 1998. [doi]

1997

Erratum: Two heads are better that two tapes Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi. JACM, 44(4):632, 1997. [doi]

Two heads are better than two tapesTao Jiang, Joel I. Seiferas, Paul M. B. Vitányi. JACM, 44(2):237-256, 1997. [doi]

Reprints from Computing ReviewsJoel I. Seiferas. sigact, 28(2):32-33, 1997. [doi]

Reprints from Computing ReviewsJoel I. Seiferas. sigact, 28(3):30, 1997. [doi]

Reprints from Computing ReviewsJoel I. Seiferas. sigact, 28(4):28-30, 1997. [doi]

1995

Characterizations of Realizable Space ComplexitiesJoel I. Seiferas, Albert R. Meyer. APAL, 73(2):171-190, 1995.

1994

Bits and Relative Order From Residues, Space EfficientlyPaul F. Dietz, Ioan I. Macarie, Joel I. Seiferas. ipl, 50(3):123-127, 1994.

A Tight Lower Bound for On-line Monotonic List LabelingPaul F. Dietz, Joel I. Seiferas, Ju Zhang. swat 1994: 131-142

Two heads are better than two tapesTao Jiang, Joel I. Seiferas, Paul M. B. Vitányi. stoc 1994: 668-675 [doi]

1991

A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity ClassesJohn G. Geske, Dung T. Huynh, Joel I. Seiferas. iandc, 92(1):97-104, May 1991.

1990

Milking the Aanderaa ArgumentRamamohan Paturi, Joel I. Seiferas, Janos Simon, Richard E. Newman-Wolfe. iandc, 88(1):88-104, September 1990.

Machine-Independent Complexity TheoryJoel I. Seiferas. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B). pages 163-186, 1990.

1988

Counting is easyJoel I. Seiferas, Paul M. B. Vitányi. JACM, 35(4):985-1000, 1988. [doi]

A Variant of Ben-Or s Lower Bound for Algebraic Decision TreesJoel I. Seiferas. ipl, 26(5):273-276, 1988.

1986

A Simplified Lower Bound for Context-Free-Language RecognitionJoel I. Seiferas. iandc, 69(1-3):255-260, April/May/June 1986.

1985

The Smallest Automaton Recognizing the Subwords of a TextAnselm Blumer, J. Blumer, David Haussler, Andrzej Ehrenfeucht, M. T. Chen, Joel I. Seiferas. TCS, 40:31-55, 1985.

1983

Time-Space-Optimal String MatchingZvi Galil, Joel I. Seiferas. jcss, 26(3):280-294, 1983.

1981

Linear-Time String-Matching Using only a Fixed Number of Local Storage LocationsZvi Galil, Joel I. Seiferas. TCS, 13:331-336, 1981.

Time-Space-Optimal String MatchingZvi Galil, Joel I. Seiferas. stoc 1981: 106-113

New Real-Time Simulations of Multihead Tape UnitsBenton L. Leong, Joel I. Seiferas. JACM, 28(1):166-180, 1981. [doi]

An Information-Theoretic Approach to Time Bounds for On-Line ComputationWolfgang J. Paul, Joel I. Seiferas, Janos Simon. jcss, 23(2):108-126, 1981.

Limitations on Separating Nondeterministic Complexity ClassesCharles Rackoff, Joel I. Seiferas. SICOMP, 10(4):742-745, 1981.

1980

Saving Space in Fast String-MatchingZvi Galil, Joel I. Seiferas. SICOMP, 9(2):417-438, 1980.

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

1978

A Linear-Time On-Line Recognition Algorithm for Palstar Zvi Galil, Joel I. Seiferas. JACM, 25(1):102-111, 1978. [doi]

Separating Nondeterministic Time Complexity ClassesJoel I. Seiferas, Michael J. Fischer, Albert R. Meyer. JACM, 25(1):146-167, 1978. [doi]

Correcting Counter-Automaton-Recognizable LanguagesRobert A. Wagner, Joel I. Seiferas. SICOMP, 7(3):357-375, 1978.

1977

Saving Space in Fast String-MatchingZvi Galil, Joel I. Seiferas. focs 1977: 179-188

New Real-Time Simulations of Multihead Tape UnitsBenton L. Leong, Joel I. Seiferas. stoc 1977: 239-248

Relating Refined Space Complexity ClassesJoel I. Seiferas. jcss, 14(1):100-129, 1977.

Techniques for Separating Space Complexity ClassesJoel I. Seiferas. jcss, 14(1):73-99, 1977.

Real-Time Recognition of Substring Repetition and ReversalJoel I. Seiferas, Zvi Galil. mst, 11:111-146, 1977.

Linear-Time Computation by Nondeterministic Multidimensional Iterative ArraysJoel I. Seiferas. SICOMP, 6(3):487-504, 1977.

Iterative Arrays with Direct Central ControlJoel I. Seiferas. ACTA, 8:177-192, 1977.

1976

Recognizing Certain Repetitions and Reversals Within StringsZvi Galil, Joel I. Seiferas. focs 1976: 236-252

Regularity-Preserving RelationsJoel I. Seiferas, Robert McNaughton. TCS, 2(2):147-154, 1976.

1974

Observations on Nondeterministic Multidimensional Iterative ArraysJoel I. Seiferas. stoc 1974: 276-289

A note on prefixes of regular languagesJoel I. Seiferas. sigact, 6(1):25-29, 1974. [doi]

1973

Infinite Exponent Partition Relations and Well-Ordered ChoiceE. M. Kleinberg, Joel I. Seiferas. JSYML, 38(2):299-308, 1973.

Refinements of the Nondeterministic Time and Space HierarchiesJoel I. Seiferas, Michael J. Fischer, Albert R. Meyer. focs 1973: 130-137

Sign in or sign up to see more results.

runs on WebDSL