DOI,IST REx ID,Research Group,Title of publication
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.STACS.2023.36,12760,MoHe,Dynamic maintenance of monotone dynamic programs and applications
10.4230/LIPIcs.ICALP.2023.99,14083,MaMo,Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery
10.4230/LIPIcs.ICALP.2023.72,14084,VlKo,Parameter estimation for Gibbs distributions
10.4230/LIPIcs.ICALP.2023.69,14085,MoHe,Efficient data structures for incremental exact and approximate maximum flow
10.4230/LIPIcs.DISC.2023.35,14485,GradSch,Brief announcement: BatchBoost: Universal batching for concurrent data structures
10.4230/LIPIcs.AFT.2023.7,14516,ElKo,STROBE: Streaming Threshold Random Beacons
10.4230/LIPIcs.CONCUR.2022.14,12508,ToHe,History-deterministic timed automata
10.4230/LIPIcs.MFCS.2022.3,12509,ToHe,An updated survey of bidding games on graphs
10.4230/LIPIcs.CONCUR.2022.11,12775,KrCh,Anytime guarantees for reachability in uncountable Markov decision processes
10.4230/LIPIcs.OPODIS.2021.15,11183,DaAl,"Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters"
10.4230/LIPIcs.OPODIS.2021.14,11184,DaAl,Fast graphical population protocols
10.4230/LIPIcs.SoCG.2022.66,11428,HeEd,A cautionary tale: Burning the medial axis is unstable
10.4230/LIPIcs.SAND.2022.18,11812,,Fully dynamic four-vertex subgraph counting
10.4230/LIPIcs.FSTTCS.2022.11,12101,KrCh,Complexity of spatial games
10.4230/LIPIcs.FSTTCS.2022.29,12102,"KrCh,GradSch",Algorithms and hardness results for computing cores of Markov chains
10.4230/LIPIcs.SoCG.2021.32,9345,HeEd,The density fingerprint of a periodic point set
10.4230/LIPIcs.CONCUR.2021.18,10052,KrCh,Decomposing permutation automata
10.4230/LIPIcs.ICALP.2021.124,10054,KrCh,Faster algorithms for bounded liveness in graphs and game graphs