Pages that link to "Item:Q3638032"

The following pages link to Competitive Analysis of Aggregate Max in Windowed Streaming (Q3638032):

Displaying 8 items.

• Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
• Competitive analysis of maintaining frequent items of a stream (Q476837) (← links)
• Quantum online algorithms with respect to space and advice complexity (Q669542) (← 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)
• Online \(L(2,1)\)-coloring problem on paths with restricted size of memory (Q6043925) (← links)
• Quantum versus classical online streaming algorithms with logarithmic size of memory (Q6043926) (← links)