default search action
Shaull Almagor
Person information
- affiliation: Technion Israel Institute of Technology, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j12]Shaull Almagor, Arka Ghosh, Tim Leys, Guillermo A. Pérez:
The geometry of reachability in continuous vector addition systems with states. Inf. Comput. 304: 105298 (2025) - [c42]Shaull Almagor, Michaël Cadilhac, Asaf Yeshurun:
Two-Way One-Counter Nets Revisited. CSL 2025: 19:1-19:20 - [i30]Shaull Almagor, Guy Arbel, Sarai Sheinvald:
Determinization of Min-Plus Weighted Automata is Decidable. CoRR abs/2503.23826 (2025) - 2024
- [j11]Shaull Almagor, Justin Kottinger
, Morteza Lahijanian:
Temporal segmentation in multi agent path finding with applications to explainability. Artif. Intell. 330: 104087 (2024) - [j10]Shaull Almagor, Omer Yizhaq:
Jumping Automata over Infinite Words. Theory Comput. Syst. 68(6): 1572-1600 (2024) - [c41]Shaull Almagor
Determinization of Integral Discounted-Sum Automata is Decidable. FoSSaCS (1) 2024: 191-211 - [c40]Shaull Almagor
Dimension-Minimality and Primality of Counter Nets. FoSSaCS (2) 2024: 229-249 - [c39]Justin Kottinger, Tzvika Geft, Shaull Almagor, Oren Salzman, Morteza Lahijanian:
Introducing Delays in Multi Agent Path Finding. SOCS 2024: 37-45 - [c38]Shaull Almagor, Ishai Salgado:
Jumping Automata Must Pay. GandALF 2024: 19-34 - [i29]Shaull Almagor, Michaël Cadilhac, Asaf Yeshurun:
Two-Way One-Counter Nets Revisited. CoRR abs/2410.22845 (2024) - [i28]Shaull Almagor, Guy Avni, Neta Dafni:
Robin Hood Reachability Bidding Games. CoRR abs/2412.17718 (2024) - 2023
- [j9]Antonio Abu Nassar, Shaull Almagor:
Simulation by Rounds of Letter-to-Letter Transducers. Log. Methods Comput. Sci. 19(4) (2023) - [c37]Shaull Almagor
Jumping Automata over Infinite Words. DLT 2023: 9-22 - [c36]Shaull Almagor, Daniel Assa, Udi Boker:
Synchronized CTL over One-Counter Automata. FSTTCS 2023: 19:1-19:22 - [c35]Shaull Almagor, Arka Ghosh
The Geometry of Reachability in Continuous Vector Addition Systems with States. MFCS 2023: 11:1-11:13 - [i27]Shaull Almagor, Omer Yizhaq:
Jumping Automata over Infinite Words. CoRR abs/2304.01278 (2023) - [i26]Justin Kottinger, Shaull Almagor, Oren Salzman, Morteza Lahijanian:
Introducing Delays in Multi-Agent Path Finding. CoRR abs/2307.11252 (2023) - [i25]Shaull Almagor, Guy Avni, Henry Sinclair-Banks, Asaf Yeshurun:
Dimension-Minimality and Primality of Counter Nets. CoRR abs/2307.14492 (2023) - [i24]Shaull Almagor, Daniel Assa, Udi Boker:
Synchronized CTL over One-Counter Automata. CoRR abs/2308.03308 (2023) - [i23]Shaull Almagor, Neta Dafni:
Determinization of Integral Discounted-Sum Automata is Decidable. CoRR abs/2310.09115 (2023) - 2022
- [j8]Shaull Almagor, Udi Boker, Orna Kupferman:
What's decidable about weighted automata? Inf. Comput. 282: 104651 (2022) - [j7]Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell:
O-Minimal Invariants for Discrete-Time Dynamical Systems. ACM Trans. Comput. Log. 23(2): 9:1-9:20 (2022) - [c34]Justin Kottinger, Shaull Almagor, Morteza Lahijanian:
Conflict-Based Search for Explainable Multi-Agent Path Finding. ICAPS 2022: 692-700 - [c33]Shaull Almagor, Asaf Yeshurun:
Determinization of One-Counter Nets. CONCUR 2022: 18:1-18:23 - [c32]Shaull Almagor, Shai Guendelman:
Concurrent Games with Multiple Topologies. CONCUR 2022: 34:1-34:18 - [c31]Antonio Abu Nassar, Shaull Almagor:
Simulation by Rounds of Letter-To-Letter Transducers. CSL 2022: 3:1-3:17 - [c30]Justin Kottinger, Shaull Almagor, Morteza Lahijanian:
Conflict-Based Search for Multi-Robot Motion Planning with Kinodynamic Constraints. IROS 2022: 13494-13499 - [i22]Justin Kottinger, Shaull Almagor, Morteza Lahijanian:
Conflict-Based Search for Explainable Multi-Agent Path Finding. CoRR abs/2202.09930 (2022) - [i21]Justin Kottinger, Shaull Almagor, Morteza Lahijanian:
Conflict-based Search for Multi-Robot Motion Planning with Kinodynamic Constraints. CoRR abs/2207.00576 (2022) - [i20]Shaull Almagor, Shai Guendelman:
Concurrent Games with Multiple Topologies. CoRR abs/2207.02596 (2022) - [i19]Shaull Almagor, Arka Ghosh
The Geometry of Reachability in Continuous Vector Addition Systems with States. CoRR abs/2210.00785 (2022) - 2021
- [j6]Shaull Almagor, Joël Ouaknine, James Worrell:
First-Order Orbit Queries. Theory Comput. Syst. 65(4): 638-661 (2021) - [j5]Shaull Almagor
Deciding ω-regular properties on linear recurrence sequences. Proc. ACM Program. Lang. 5(POPL): 1-24 (2021) - [c29]Justin Kottinger, Shaull Almagor, Morteza Lahijanian:
MAPS-X: Explainable Multi-Robot Motion Planning via Segmentation. ICRA 2021: 7994-8000 - [i18]Antonio Abu Nassar, Shaull Almagor:
Simulation by Rounds of Letter-to-Letter Transducers. CoRR abs/2105.01512 (2021) - [i17]Shaull Almagor, Orna Kupferman:
Good-Enough Synthesis. CoRR abs/2109.03594 (2021) - [i16]Shaull Almagor, Asaf Yeshurun:
Determinization of One-Counter Nets. CoRR abs/2112.13716 (2021) - 2020
- [j4]Shaull Almagor, Michaël Cadilhac
Weak Cost Register Automata are Still Powerful. Int. J. Found. Comput. Sci. 31(6): 689-709 (2020) - [c28]Shaull Almagor, Morteza Lahijanian:
Explainable Multi Agent Path Finding. AAMAS 2020: 34-42 - [c27]Shaull Almagor
Good-Enough Synthesis. CAV (2) 2020: 541-563 - [c26]Shaull Almagor
Coverability in 1-VASS with Disequality Tests. CONCUR 2020: 38:1-38:20 - [c25]Shaull Almagor
Parametrized Universality Problems for One-Counter Nets. CONCUR 2020: 47:1-47:16 - [c24]Shaull Almagor
Process Symmetry in Probabilistic Transducers. FSTTCS 2020: 35:1-35:14 - [c23]Shaull Almagor
Invariants for Continuous Linear Dynamical Systems. ICALP 2020: 107:1-107:15 - [i15]Shaull Almagor, Edon Kelmendi, Joël Ouaknine, James Worrell:
Invariants for Continuous Linear Dynamical Systems. CoRR abs/2004.11661 (2020) - [i14]Shaull Almagor, Udi Boker, Piotr Hofman, Patrick Totzke:
Parametrized Universality Problems for One-Counter Nets. CoRR abs/2005.03435 (2020) - [i13]Shaull Almagor:
Process Symmetry in Probabilistic Transducers. CoRR abs/2007.11922 (2020) - [i12]Shaull Almagor, Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
Deciding ω-Regular Properties on Linear Recurrence Sequences. CoRR abs/2010.14432 (2020) - [i11]Justin Kottinger, Shaull Almagor, Morteza Lahijanian:
MAPS-X: Explainable Multi-Robot Motion Planning via Segmentation. CoRR abs/2010.16106 (2020)
2010 – 2019
- 2019
- [j3]Shaull Almagor, Denis Kuperberg, Orna Kupferman:
Sensing as a Complexity Measure. Int. J. Found. Comput. Sci. 30(6-7): 831-873 (2019) - [c22]Shaull Almagor, Joël Ouaknine, James Worrell
The Semialgebraic Orbit Problem. STACS 2019: 6:1-6:15 - [i10]Shaull Almagor, Joël Ouaknine, James Worrell:
The Semialgebraic Orbit Problem. CoRR abs/1901.11023 (2019) - [i9]Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell:
Coverability in 1-VASS with Disequality Tests. CoRR abs/1902.06576 (2019) - 2018
- [c21]Shaull Almagor, Brynmor Chapman, Mehran Hosseini
Effective Divergence Analysis for Linear Recurrence Sequences. CONCUR 2018: 42:1-42:15 - [c20]Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez
Weak Cost Register Automata Are Still Powerful. DLT 2018: 83-95 - [c19]Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell
O-Minimal Invariants for Linear Loops. ICALP 2018: 114:1-114:14 - [c18]Shaull Almagor, Orna Kupferman, Giuseppe Perelli:
Synthesis of Controllable Nash Equilibria in Quantitative Objective Game. IJCAI 2018: 35-41 - [i8]Shaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell:
O-Minimal Invariants for Linear Loops. CoRR abs/1802.09263 (2018) - [i7]Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez:
Weak Cost Register Automata are Still Powerful. CoRR abs/1804.06336 (2018) - [i6]Shaull Almagor, Brynmor Chapman, Mehran Hosseini, Joël Ouaknine, James Worrell:
Effective Divergence Analysis for Linear Recurrence Sequences. CoRR abs/1806.07740 (2018) - [i5]Shaull Almagor, Rajeev Alur, Suguman Bansal:
Equilibria in Quantitative Concurrent Games. CoRR abs/1809.10503 (2018) - 2017
- [j2]Shaull Almagor
Latticed-LTL synthesis in the presence of noisy inputs. Discret. Event Dyn. Syst. 27(3): 547-572 (2017) - [c17]Shaull Almagor
Quantitative Assume Guarantee Synthesis. CAV (2) 2017: 353-374 - [c16]Shaull Almagor
Sensing as a Complexity Measure. DCFS 2017: 3-15 - [c15]Shaull Almagor
The Polytope-Collision Problem. ICALP 2017: 24:1-24:14 - 2016
- [b1]Shaull Almagor:
Formalizing and Reasoning about Quality (שער נוסף בעברית: על הצרנה, הסקה, ואיכות.). Hebrew University of Jerusalem, Israel, 2016 - [j1]Shaull Almagor
Formally Reasoning About Quality. J. ACM 63(3): 24:1-24:56 (2016) - [c14]Shaull Almagor
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. CONCUR 2016: 9:1-9:15 - [c13]Shaull Almagor
High-Quality Synthesis Against Stochastic Environments. CSL 2016: 28:1-28:17 - [i4]Shaull Almagor, Orna Kupferman, Yaron Velner:
Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. CoRR abs/1604.07064 (2016) - [i3]Shaull Almagor, Orna Kupferman:
High-Quality Synthesis Against Stochastic Environments. CoRR abs/1608.06567 (2016) - [i2]Shaull Almagor, Joël Ouaknine, James Worrell:
The Polytope-Collision Problem. CoRR abs/1611.01344 (2016) - 2015
- [c12]Morteza Lahijanian, Shaull Almagor, Dror Fried, Lydia E. Kavraki, Moshe Y. Vardi:
This Time the Robot Settles for a Cost: A Quantitative Approach to Temporal Logic Planning with Partial Satisfaction. AAAI 2015: 3664-3671 - [c11]Shaull Almagor
Repairing Multi-Player Games. CONCUR 2015: 325-339 - [c10]Shaull Almagor
The Sensing Cost of Monitoring and Synthesis. FSTTCS 2015: 380-393 - 2014
- [c9]Shaull Almagor
Latticed-LTL Synthesis in the Presence of Noisy Inputs. FoSSaCS 2014: 226-241 - [c8]Shaull Almagor
Regular Sensing. FSTTCS 2014: 161-173 - [c7]Shaull Almagor
Discounting in LTL. TACAS 2014: 424-439 - [i1]Shaull Almagor, Udi Boker, Orna Kupferman:
Discounting in LTL. CoRR abs/1406.4249 (2014) - 2013
- [c6]Shaull Almagor
Automatic Generation of Quality Specifications. CAV 2013: 479-494 - [c5]Shaull Almagor
Formalizing and Reasoning about Quality. ICALP (2) 2013: 15-27 - 2011
- [c4]Reshef Meir, Shaull Almagor, Assaf Michaely, Jeffrey S. Rosenschein:
Tight bounds for strategyproof classification. AAMAS 2011: 319-326 - [c3]Shaull Almagor
Max and Sum Semantics for Alternating Weighted Automata. ATVA 2011: 13-27 - [c2]Shaull Almagor
What's Decidable about Weighted Automata? ATVA 2011: 482-491 - 2010
- [c1]Shaull Almagor
Promptness in omega-Regular Automata. ATVA 2010: 22-36
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-28 21:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: