bibliographer - Rasmus Ibsen-Jensen

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

The Complexity of Games with Randomised Control Sarvin Bahmani Rasmus Ibsen-Jensen Soumyajit Paul Sven Schewe Friedrich Slivovsky Qiyi Tang Dominik Wojtczak Shufang Zhu [github]

The Power of Counting Steps in Quantitative Games Sougata Bose Rasmus Ibsen-Jensen David Purser Patrick Totzke Pierre Vandenhove [github]

Bounded-Memory Strategies in Partial-Information Games Sougata Bose Rasmus Ibsen-Jensen Patrick Totzke [github]

One-Clock Priced Timed Games Are PSPACE-Hard John Fearnley Rasmus Ibsen-Jensen Rahul Savani [github]

One-Clock Priced Timed Games are PSPACE-hard John Fearnley Rasmus Ibsen-Jensen Rahul Savani [github]

A Faster Algorithm for Solving One-Clock Priced Timed Games Thomas Dueholm Hansen Rasmus Ibsen-Jensen Peter Bro Miltersen [github]

A short proof of correctness of the quasi-polynomial time algorithm for parity games Hugo Gimbert Rasmus Ibsen-Jensen [github]

The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games Krishnendu Chatterjee Rasmus Ibsen-Jensen [github]

The Complexity of Ergodic Games Krishnendu Chatterjee Rasmus Ibsen-Jensen [github]

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth Krishnendu Chatterjee Rasmus Ibsen-Jensen Andreas Pavlogiannis Prateesh Goyal [github]

Library Size: 13G (10 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A

[show logs] [hide logs]