DOI,IST REx ID,Research Group,Title of publication
10.4230/LIPIcs.LICS.2026.23,22617,ToHe,Dicey games: Shared sources of randomness in distributed systems
10.4230/LIPIcs.DISC.2025.23,21412,KrCh,Boosting payment channel network liquidity with topology optimization and transaction selection
10.4230/LIPIcs.ITCS.2025.82,19281,MaMo,Tight bounds on list-decodable and list-recoverable zero-rate codes
10.4230/LIPIcs.SAND.2025.4,19858,MoHe,On b-matching and fully-dynamic maximum k-edge coloring
10.4230/LIPIcs.CONCUR.2025.21,20253,ToHe,Quantitative language automata
10.4230/LIPIcs.MFCS.2025.30,20290,ToHe,"Finding equilibria: Simpler for pessimists, simplest for optimists"
10.4230/LIPIcs.MFCS.2025.57,20291,ToHe,Resolving nondeterminism with randomness
10.4230/LIPIcs.ESA.2025.2,20533,MoHe,Securing dynamic data: A primer on differentially private data structures
10.4230/LIPIcs.ESA.2025.36,20534,MoHe,Efficient contractions of dynamic graphs - with applications
10.4230/LIPIcs.ESA.2025.91,20535,MoHe,Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism
10.4230/LIPIcs.WADS.2025.47,20536,MoHe,B-Treaps revised: Write efficient randomized block search trees with high load
10.4230/LIPIcs.AFT.2025.16,20587,KrPi,Nakamoto consensus from multiple resources
10.4230/LIPIcs.OPODIS.2023.11,15006,KrCh,On the convergence time in graphical games: A locality-sensitive approach
10.4230/LIPIcs.OPODIS.2023.12,15007,KrPi,Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks
10.4230/LIPIcs.ITCS.2024.55,15008,MoHe,Electrical flows for polylogarithmic competitive oblivious routing
10.4230/LIPIcs.FSTTCS.2024.5,17099,KrCh,Concurrent stochastic games with stateful-discounted and parity objectives: Complexity and algorithms
10.4230/LIPIcs.SoCG.2024.69,17144,HeEd,The medial axis of any closed bounded set Is Lipschitz stable with respect to the Hausdorff distance Under ambient diffeomorphisms
10.4230/LIPIcs.SoCG.2024.76,17145,HeEd,Grid peeling of parabolas
10.4230/LIPIcs.GD.2024.3,18556,HeEd,The Euclidean MST-ratio for bi-colored lattices
10.4230/LIPIcs.IPEC.2024.2,18758,MaKw,Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound
