Joel I. Seiferas

Available identifiers

zbMath Open seiferas.joel-iMaRDI QIDQ756422

List of research outcomes

Publication	Date of Publication	Type
A tight lower bound for on-line monotonic list labeling	2022-12-09	Paper
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks	2017-11-10	Paper
Two heads are better than two tapes	2016-09-01	Paper
Optimizing data popularity conscious bloom filters	2014-12-12	Paper
Object replication degree customization for high availability	2014-03-13	Paper
Sorting networks of logarithmic depth, further simplified	2009-06-17	Paper
Networks for sorting multitonic sequences	2006-11-15	Paper
A Tight Lower Bound for Online Monotonic List Labeling	2005-09-16	Paper
Amplification of slight probabilistic advantage at absolutely no cost in space	2002-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q4385526	1998-05-04	Paper
Two heads are better than two tapes	1998-02-17	Paper
Characterization of realizable space complexities	1995-07-03	Paper
Bits and relative order from residues, space efficiently	1994-07-18	Paper
A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes	1991-01-01	Paper
Milking the Aanderaa argument	1990-01-01	Paper
A variant of Ben-Or's lower bound for algebraic decision trees	1988-01-01	Paper
Counting is easy	1988-01-01	Paper
A simplified lower bound for context-free-language recognition	1986-01-01	Paper
Time-space-optimal string matching	1983-01-01	Paper
Linear-time string-matching using only a fixed number of local storage locations	1981-01-01	Paper
An information-theoretic approach to time bounds for on-line computation	1981-01-01	Paper
New Real-Time Simulations of Multihead Tape Units	1981-01-01	Paper
Limitations on Separating Nondeterministic Complexity Classes	1981-01-01	Paper
Saving Space in Fast String-Matching	1980-01-01	Paper
A Linear-Time On-Line Recognition Algorithm for ``Palstar	1978-01-01	Paper
Separating Nondeterministic Time Complexity Classes	1978-01-01	Paper
Correcting Counter-Automaton-Recognizable Languages	1978-01-01	Paper
Iterative arrays with direct central control	1977-01-01	Paper
Techniques for separating space complexity classes	1977-01-01	Paper
Relating refined space complexity classes	1977-01-01	Paper
Real-time recognition of substring repetition and reversal	1977-01-01	Paper
Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays	1977-01-01	Paper
Regularity-preserving relations	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4131025	1974-01-01	Paper
Infinite exponent partition relations and well-ordered choice	1973-01-01	Paper

Research outcomes over time

This page was built for person: Joel I. Seiferas