Shaull Almagor

Orcid: 0000-0001-9021-1175

Affiliations:
  • Technion Israel Institute of Technology, Israel


According to our database1, Shaull Almagor authored at least 49 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Jumping Automata Must Pay.
CoRR, 2024

Temporal segmentation in multi agent path finding with applications to explainability.
Artif. Intell., 2024

Introducing Delays in Multi Agent Path Finding.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Determinization of Integral Discounted-Sum Automata is Decidable.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

Dimension-Minimality and Primality of Counter Nets.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023
Simulation by Rounds of Letter-to-Letter Transducers.
Log. Methods Comput. Sci., 2023

Introducing Delays in Multi-Agent Path Finding.
CoRR, 2023

The Geometry of Reachability in Continuous Vector Addition Systems with States.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Synchronized CTL over One-Counter Automata.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Jumping Automata over Infinite Words.
Proceedings of the Developments in Language Theory - 27th International Conference, 2023

2022
O-Minimal Invariants for Discrete-Time Dynamical Systems.
ACM Trans. Comput. Log., 2022

What's decidable about weighted automata?
Inf. Comput., 2022

Conflict-Based Search for Multi-Robot Motion Planning with Kinodynamic Constraints.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2022

Determinization of One-Counter Nets.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

Concurrent Games with Multiple Topologies.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

Conflict-Based Search for Explainable Multi-Agent Path Finding.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021
Deciding ω-regular properties on linear recurrence sequences.
Proc. ACM Program. Lang., 2021

First-Order Orbit Queries.
Theory Comput. Syst., 2021

MAPS-X: Explainable Multi-Robot Motion Planning via Segmentation.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021

2020
Weak Cost Register Automata are Still Powerful.
Int. J. Found. Comput. Sci., 2020

Invariants for Continuous Linear Dynamical Systems.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Process Symmetry in Probabilistic Transducers.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Coverability in 1-VASS with Disequality Tests.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

Parametrized Universality Problems for One-Counter Nets.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

Good-Enough Synthesis.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

Explainable Multi Agent Path Finding.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Sensing as a Complexity Measure.
Int. J. Found. Comput. Sci., 2019

The Semialgebraic Orbit Problem.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018
Equilibria in Quantitative Concurrent Games.
CoRR, 2018

Synthesis of Controllable Nash Equilibria in Quantitative Objective Game.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

O-Minimal Invariants for Linear Loops.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Effective Divergence Analysis for Linear Recurrence Sequences.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
Latticed-LTL synthesis in the presence of noisy inputs.
Discret. Event Dyn. Syst., 2017

The Polytope-Collision Problem.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Quantitative Assume Guarantee Synthesis.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

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

Formally Reasoning About Quality.
J. ACM, 2016

High-Quality Synthesis Against Stochastic Environments.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
The Sensing Cost of Monitoring and Synthesis.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

Repairing Multi-Player Games.
Proceedings of the 26th International Conference on Concurrency Theory, 2015

This Time the Robot Settles for a Cost: A Quantitative Approach to Temporal Logic Planning with Partial Satisfaction.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Discounting in LTL.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014

Regular Sensing.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013
Formalizing and Reasoning about Quality.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Automatic Generation of Quality Specifications.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2011
Max and Sum Semantics for Alternating Weighted Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2011

Tight bounds for strategyproof classification.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010
Promptness in <i>omega</i>-Regular Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2010


  Loading...