default search action
Loredana Sorrentino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j9]Antonio Di Stasio
, Aniello Murano
Improving parity games in practice. Ann. Math. Artif. Intell. 89(5-6): 551-574 (2021) - [j8]Luisa D'Amore
Toward a multilevel scalable parallel Zielonka's algorithm for solving parity games. Concurr. Comput. Pract. Exp. 33(4) (2021) - 2020
- [j7]Aniello Murano
Model-checking graded computation-tree logic with finite path semantics. Theor. Comput. Sci. 806: 577-586 (2020) - [j6]Laura Bozzelli, Aniello Murano
Alternating-time temporal logics with linear past. Theor. Comput. Sci. 813: 199-217 (2020) - [j5]Laura Bozzelli, Aniello Murano
Hierarchical cost-parity games. Theor. Comput. Sci. 847: 147-174 (2020) - [c17]Marco Balzano
Smart Destination-Based Parking for the Optimization of Waiting Time. AINA Workshops 2020: 1019-1027 - [c16]Walter Balzano, Aniello Murano
Behavioral Clustering: A New Approach for Traffic Congestion Evaluation. AINA Workshops 2020: 1418-1427
2010 – 2019
- 2019
- [c15]Walter Balzano, Aniello Murano
A Smart Compact Traffic Network Vision Based on Wave Representation. AINA Workshops 2019: 870-879 - [c14]Walter Balzano, Aniello Murano
Network Signal Comparison Through Waves Parameters: a Local-Alignment-Based Approach. M&N 2019: 1-6 - 2018
- [j4]Vadim Malvone
Additional Winning Strategies in Reachability Games. Fundam. Informaticae 159(1-2): 175-195 (2018) - [j3]Vadim Malvone
Reasoning about graded strategy quantifiers. Inf. Comput. 259(3): 390-411 (2018) - [j2]Gaëlle Fontaine, Fabio Mogavero
Cycle detection in computation tree logic. Inf. Comput. 262: 265-279 (2018) - [c13]Loredana Sorrentino, Sasha Rubin, Aniello Murano
Graded CTL* over Finite Paths. ICTCS 2018: 152-161 - [c12]Laura Bozzelli, Aniello Murano
Results on Alternating-Time Temporal Logics with Linear Past. TIME 2018: 6:1-6:22 - 2017
- [c11]Vadim Malvone, Aniello Murano, Loredana Sorrentino:
Hiding Actions in Multi-Player Games. AAMAS 2017: 1205-1213 - [c10]Rossella Arcucci
Parallel Parity Games: a Multicore Attractor for the Zielonka Recursive Algorithm. ICCS 2017: 525-534 - [c9]Laura Bozzelli, Aniello Murano
Hierarchical Cost-Parity Games. TIME 2017: 6:1-6:17 - 2016
- [c8]Vadim Malvone, Aniello Murano, Loredana Sorrentino:
Concurrent Multi-Player Parity Games. AAMAS 2016: 689-697 - [c7]Vadim Malvone
Hiding Actions in Concurrent Games. ECAI 2016: 1686-1687 - [c6]Gaëlle Fontaine, Fabio Mogavero
Cycle Detection in Computation Tree Logic. GandALF 2016: 164-177 - 2015
- [j1]Fabio Mogavero
On Promptness in Parity Games. Fundam. Informaticae 139(3): 277-305 (2015) - [c5]Vadim Malvone, Aniello Murano, Loredana Sorrentino:
Games with additional winning strategies. CILC 2015: 175-180 - [c4]Vadim Malvone
On the Counting of Strategies. TIME 2015: 170-179 - [c3]Aniello Murano, Loredana Sorrentino:
A Game-based Model for Human-robots Interaction. WOA 2015: 146-150 - 2014
- [c2]Antonio Di Stasio
Solving Parity Games in Scala. FACS 2014: 145-161 - 2013
- [c1]Fabio Mogavero
On Promptness in Parity Games. LPAR 2013: 601-618
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 2024-08-05 21:21 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: