The following pages link to Joel I. Seiferas (Q756422):
Displaying 36 items.
- A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes (Q756423) (← links)
- (Q852885) (redirect page) (← links)
- Networks for sorting multitonic sequences (Q852886) (← links)
- Milking the Aanderaa argument (Q918198) (← links)
- Sorting networks of logarithmic depth, further simplified (Q1024784) (← links)
- A variant of Ben-Or's lower bound for algebraic decision trees (Q1096401) (← links)
- Linear-time string-matching using only a fixed number of local storage locations (Q1149761) (← links)
- An information-theoretic approach to time bounds for on-line computation (Q1156484) (← links)
- Iterative arrays with direct central control (Q1230610) (← links)
- Techniques for separating space complexity classes (Q1235979) (← links)
- Relating refined space complexity classes (Q1235980) (← links)
- Regularity-preserving relations (Q1236516) (← links)
- Bits and relative order from residues, space efficiently (Q1327295) (← links)
- Amplification of slight probabilistic advantage at absolutely no cost in space (Q1607005) (← links)
- Time-space-optimal string matching (Q1838329) (← links)
- Characterization of realizable space complexities (Q1892934) (← links)
- Two heads are better than two tapes (Q2817660) (← links)
- Optimizing data popularity conscious bloom filters (Q2934358) (← links)
- A simplified lower bound for context-free-language recognition (Q3742752) (← links)
- Counting is easy (Q3813296) (← links)
- Saving Space in Fast String-Matching (Q3891771) (← links)
- New Real-Time Simulations of Multihead Tape Units (Q3902483) (← links)
- Limitations on Separating Nondeterministic Complexity Classes (Q3922171) (← links)
- Real-time recognition of substring repetition and reversal (Q4120141) (← links)
- (Q4131025) (← links)
- A Linear-Time On-Line Recognition Algorithm for ``Palstar'' (Q4140392) (← links)
- Separating Nondeterministic Time Complexity Classes (Q4142696) (← links)
- Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays (Q4144798) (← links)
- Correcting Counter-Automaton-Recognizable Languages (Q4158494) (← links)
- Two heads are better than two tapes (Q4377274) (← links)
- (Q4385526) (← links)
- The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks (Q4589574) (← links)
- A tight lower bound for on-line monotonic list labeling (Q5056172) (← links)
- Infinite exponent partition relations and well-ordered choice (Q5181372) (← links)
- A Tight Lower Bound for Online Monotonic List Labeling (Q5317575) (← links)
- Object replication degree customization for high availability (Q5401452) (← links)
