Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Greedily computing associative aggregations on sliding windows

From MaRDI portal
Publication:477620
Jump to:navigation, search

DOI10.1016/j.ipl.2014.09.009zbMath1302.68335OpenAlexW2144580301MaRDI QIDQ477620

Felix Klaedtke, Eugen Zălinescu, David A. Basin

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.009

zbMATH Keywords

complexityoptimalityonline algorithmssliding windowassociative aggregation operator


Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)


Related Items

Adaptive Online First-Order Monitoring, A formally verified, optimized monitor for metric first-order dynamic logic


Uses Software

  • OCaml


Cites Work

  • Maintaining Stream Statistics over Sliding Windows
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:477620&oldid=12355170"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 05:48.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki