Pages that link to "Item:Q2947799"
From MaRDI portal
The following pages link to The Frequent Items Problem in Online Streaming Under Various Performance Measures (Q2947799):
Displaying 13 items.
- Competitive analysis of maintaining frequent items of a stream (Q476837) (← links)
- Quantum online algorithms with respect to space and advice complexity (Q669542) (← links)
- The frequent items problem, under polynomial decay, in the streaming model (Q986537) (← links)
- The fast algorithm for online \(k\)-server problem on trees (Q2097225) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- Quantum online streaming algorithms with logarithmic memory (Q2241048) (← links)
- Competitive Analysis of Maintaining Frequent Items of a Stream (Q2904569) (← links)
- Relaxing the irrevocability requirement for online graph algorithms (Q5918715) (← links)
- Quantum versus classical online streaming algorithms with logarithmic size of memory (Q6043926) (← links)
- Classical and Quantum Computations with Restricted Memory (Q6163622) (← links)
- Relative Worst-Order Analysis: A Survey (Q6163627) (← links)
- Quantum algorithms for the most frequently string search, intersection of two string sequences and sorting of strings problems (Q6536370) (← links)
- Time efficient implementation for online \(k\)-server problem on trees (Q6636094) (← links)
