Promptness in omega-Regular Automata. - Shaull Almagor; Yoram Hirshfeld; Orna Kupferman (ATVA, 2010)

Tight bounds for strategyproof classification. - Reshef Meir; Shaull Almagor; Assaf Michaely; Jeffrey S. Rosenschein (AAMAS, 2011)

Max and Sum Semantics for Alternating Weighted Automata. - Shaull Almagor; Orna Kupferman (ATVA, 2011)

Automatic Generation of Quality Specifications. - Shaull Almagor; Guy Avni; Orna Kupferman (CAV, 2013)

Formalizing and Reasoning about Quality. - Shaull Almagor; Udi Boker; Orna Kupferman (ICALP (2), 2013)

Regular Sensing. - Shaull Almagor; Denis Kuperberg; Orna Kupferman (FSTTCS, 2014)

Discounting in LTL. - Shaull Almagor; Udi Boker; Orna Kupferman (TACAS, 2014)

This Time the Robot Settles for a Cost: A Quantitative Approach to Temporal Logic Planning with Partial Satisfaction. - Morteza Lahijanian; Shaull Almagor; Dror Fried; Lydia E. Kavraki; Moshe Y. Vardi (AAAI, 2015)

Repairing Multi-Player Games. - Shaull Almagor; Guy Avni; Orna Kupferman (CONCUR, 2015)

The Sensing Cost of Monitoring and Synthesis. - Shaull Almagor; Denis Kuperberg; Orna Kupferman (FSTTCS, 2015)

Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. - Shaull Almagor; Orna Kupferman; Yaron Velner (CONCUR, 2016)

High-Quality Synthesis Against Stochastic Environments. - Shaull Almagor; Orna Kupferman (CSL, 2016)

Formally Reasoning About Quality. - Shaull Almagor; Udi Boker; Orna Kupferman (J. ACM, 2016)

Formalizing and Reasoning about Quality (שער נוסף בעברית: על הצרנה, הסקה, ואיכות.). - Shaull Almagor (2016)

Quantitative Assume Guarantee Synthesis. - Shaull Almagor; Orna Kupferman; Jan Oliver Ringert; Yaron Velner (CAV (2), 2017)

The Polytope-Collision Problem. - Shaull Almagor; Joël Ouaknine; James Worrell 001 (ICALP, 2017)

Latticed-LTL synthesis in the presence of noisy inputs. - Shaull Almagor; Orna Kupferman (Discret. Event Dyn. Syst., 2017)

Effective Divergence Analysis for Linear Recurrence Sequences. - Shaull Almagor; Brynmor Chapman; Mehran Hosseini; Joël Ouaknine; James Worrell 001 (CONCUR, 2018)

O-Minimal Invariants for Linear Loops. - Shaull Almagor; Dmitry Chistikov 001; Joël Ouaknine; James Worrell 001 (ICALP, 2018)

Synthesis of Controllable Nash Equilibria in Quantitative Objective Game. - Shaull Almagor; Orna Kupferman; Giuseppe Perelli (IJCAI, 2018)

Equilibria in Quantitative Concurrent Games. - Shaull Almagor; Rajeev Alur; Suguman Bansal (CoRR, 2018)

The Semialgebraic Orbit Problem. - Shaull Almagor; Joël Ouaknine; James Worrell 001 (STACS, 2019)

Sensing as a Complexity Measure. - Shaull Almagor; Denis Kuperberg; Orna Kupferman (Int. J. Found. Comput. Sci., 2019)

Explainable Multi Agent Path Finding. - Shaull Almagor; Morteza Lahijanian (AAMAS, 2020)

Good-Enough Synthesis. - Shaull Almagor; Orna Kupferman (CAV (2), 2020)

Parametrized Universality Problems for One-Counter Nets. - Shaull Almagor; Udi Boker; Piotr Hofman; Patrick Totzke (CONCUR, 2020)

Coverability in 1-VASS with Disequality Tests. - Shaull Almagor; Nathann Cohen; Guillermo A. Pérez 001; Mahsa Shirmohammadi; James Worrell 001 (CONCUR, 2020)

Process Symmetry in Probabilistic Transducers. - Shaull Almagor (FSTTCS, 2020)

Invariants for Continuous Linear Dynamical Systems. - Shaull Almagor; Edon Kelmendi; Joël Ouaknine; James Worrell 001 (ICALP, 2020)

Weak Cost Register Automata are Still Powerful. - Shaull Almagor; Michaël Cadilhac; Filip Mazowiecki; Guillermo A. Pérez 001 (Int. J. Found. Comput. Sci., 2020)

MAPS-X: Explainable Multi-Robot Motion Planning via Segmentation. - Justin Kottinger; Shaull Almagor; Morteza Lahijanian (ICRA, 2021)

First-Order Orbit Queries. - Shaull Almagor; Joël Ouaknine; James Worrell 001 (Theory Comput. Syst., 2021)

Deciding ω-regular properties on linear recurrence sequences. - Shaull Almagor; Toghrul Karimov; Edon Kelmendi; Joël Ouaknine; James Worrell 001 (Proc. ACM Program. Lang., 2021)

Conflict-Based Search for Explainable Multi-Agent Path Finding. - Justin Kottinger; Shaull Almagor; Morteza Lahijanian (ICAPS, 2022)

Concurrent Games with Multiple Topologies. - Shaull Almagor; Shai Guendelman (CONCUR, 2022)

Determinization of One-Counter Nets. - Shaull Almagor; Asaf Yeshurun (CONCUR, 2022)

Conflict-Based Search for Multi-Robot Motion Planning with Kinodynamic Constraints. - Justin Kottinger; Shaull Almagor; Morteza Lahijanian (IROS, 2022)

What's decidable about weighted automata? - Shaull Almagor; Udi Boker; Orna Kupferman (Inf. Comput., 2022)

O-Minimal Invariants for Discrete-Time Dynamical Systems. - Shaull Almagor; Dmitry Chistikov 001; Joël Ouaknine; James Worrell 001 (ACM Trans. Comput. Log., 2022)

Synchronized CTL over One-Counter Automata. - Shaull Almagor; Daniel Assa; Udi Boker (FSTTCS, 2023)

Introducing Delays in Multi-Agent Path Finding. - Justin Kottinger; Shaull Almagor; Oren Salzman; Morteza Lahijanian (CoRR, 2023)

Simulation by Rounds of Letter-to-Letter Transducers. - Antonio Abu Nassar; Shaull Almagor (Log. Methods Comput. Sci., 2023)

Dimension-Minimality and Primality of Counter Nets. - Shaull Almagor; Guy Avni; Henry Sinclair-Banks; Asaf Yeshurun (FoSSaCS (2), 2024)

Determinization of Integral Discounted-Sum Automata is Decidable. - Shaull Almagor; Neta Dafni (FoSSaCS (1), 2024)

Introducing Delays in Multi Agent Path Finding. - Justin Kottinger; Tzvika Geft; Shaull Almagor; Oren Salzman; Morteza Lahijanian (SOCS, 2024)

Temporal segmentation in multi agent path finding with applications to explainability. - Shaull Almagor; Justin Kottinger; Morteza Lahijanian (Artif. Intell., 2024)

Jumping Automata Must Pay. - Shaull Almagor; Ishai Salgado (GandALF, 2024)

Jumping Automata over Infinite Words. - Shaull Almagor; Omer Yizhaq (Theory Comput. Syst., 2024)

Two-Way One-Counter Nets Revisited. - Shaull Almagor; Michaël Cadilhac; Asaf Yeshurun (CSL, 2025)

Robin Hood Reachability Bidding Games. - Shaull Almagor; Guy Avni; Neta Dafni (AAMAS, 2025)

The geometry of reachability in continuous vector addition systems with states. - Shaull Almagor; Arka Ghosh 002; Tim Leys; Guillermo A. Pérez 001 (Inf. Comput., 2025)

Determinization of Min-Plus Weighted Automata is Decidable. - Shaull Almagor; Guy Arbel; Sarai Sheinvald (CoRR, 2025)

Box-Reachability in Vector Addition Systems. - Shaull Almagor; Itay Hasson; Michal Pilipczuk; Michael Zaslavski (CoRR, 2025)