Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)

DOI10.1007/3-540-57155-8_256zbMath1504.68044OpenAlexW1575350389MaRDI QIDQ5060121

Rajeev Raman, Paul F. Dietz

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_256

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Data structures (68P05) Combinatorial games (91A46)

Related Items

Time-Optimal Top-$k$ Document Retrieval

Cites Work

• Unnamed Item
• Unnamed Item
• The design of dynamic data structures
• Dynamic fractional cascading
• Maintaining order in a generalized linked list
• A balanced search tree O(1) worst-case update time
• Making data structures persistent
• Preserving order in a forest in less than logarithmic time and linear space
• Hash functions for priority queues
• On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
• Adding range restriction capability to dynamic data structures
• String Matching in Real Time
• New Real-Time Simulations of Multihead Tape Units
• Analysis of an algorithm for real time garbage collection
• List processing in real time on a serial computer
• Fractional cascading simplified
• Real-Time Simulation of Multihead Tape Units