default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 42 matches
- 2022
- Bernardo Almeida, Andreia Mordido, Peter Thiemann, Vasco T. Vasconcelos:
Polymorphic lambda calculus with context-free session types. Inf. Comput. 289(Part): 104948 (2022) - Yagel Ashkenazi, Ran Gelles, Amir Leshem:
Noisy beeping networks. Inf. Comput. 289(Part): 104925 (2022) - Paolo Baldan, Francesco Ranzato, Linpeng Zhang:
Intensional Kleene and Rice theorems for abstract program semantics. Inf. Comput. 289(Part): 104953 (2022) - Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki:
A robust class of linear recurrence sequences. Inf. Comput. 289(Part): 104964 (2022) - Ezio Bartocci, Cristinel Mateis, Eleonora Nesterini, Dejan Nickovic:
Survey on mining signal temporal logic specifications. Inf. Comput. 289(Part): 104957 (2022) - Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder:
Synthesis in presence of dynamic links. Inf. Comput. 289(Part): 104856 (2022) - Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Learning residual alternating automata. Inf. Comput. 289(Part): 104981 (2022) - Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger:
Exploring sparse graphs with advice. Inf. Comput. 289(Part): 104950 (2022) - Sergiy Bogomolov, Marcelo Forets, Goran Frehse, Andreas Podelski, Christian Schilling:
Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version). Inf. Comput. 289(Part): 104937 (2022) - Kaustav Bose, Manash Kumar Kundu, Ranendu Adhikary, Buddhadeb Sau:
Distributed localization of wireless sensor network using communication wheel. Inf. Comput. 289(Part): 104962 (2022) - Patricia Bouyer, Thomas Brihaye, Mickael Randour, Cédric Rivière, Pierre Vandenhove:
Decisiveness of stochastic systems and its application to hybrid models. Inf. Comput. 289(Part): 104861 (2022) - Alex Brandts, Stanislav Zivný:
Beyond PCSP(1-in-3, NAE). Inf. Comput. 289(Part): 104954 (2022) - Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. Inf. Comput. 289(Part): 104943 (2022) - Florian Bruse, Jörg Kreiker, Martin Lange, Marco Sälzer:
Local higher-order fixpoint iteration. Inf. Comput. 289(Part): 104963 (2022) - Pascal Caron, Edwin Hamel-De le Court, Jean-Gabriel Luque:
Combination of roots and boolean operations: An application to state complexity. Inf. Comput. 289(Part): 104961 (2022) - Alberto Casagrande, Thao Dang, Luca Dorigo, Tommaso Dreossi, Carla Piazza, Eleonora Pippia:
Parameter synthesis of polynomial dynamical systems. Inf. Comput. 289(Part): 104941 (2022) - Jianer Chen, Ying Guo, Qin Huang:
Linear-time parameterized algorithms with limited local resources. Inf. Comput. 289(Part): 104951 (2022) - Haimin Chen, Chaodong Zheng:
Efficient and competitive broadcast in multi-channel radio networks. Inf. Comput. 289(Part): 104960 (2022) - Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance labeling schemes for K4-free bridged graphs. Inf. Comput. 289(Part): 104959 (2022) - Alessandro Cimatti, Alberto Griggio, Enrico Magnago:
LTL falsification in infinite-state systems. Inf. Comput. 289(Part): 104977 (2022) - Federico Corò, Emilio Cruciani, Gianlorenzo D'Angelo, Stefano Ponziani:
Exploiting social influence to control elections based on positional scoring rules. Inf. Comput. 289(Part): 104940 (2022) - Joel D. Day, Daniel Reidenbach:
Unambiguous injective morphisms in free groups. Inf. Comput. 289(Part): 104946 (2022) - Stéphane Devismes, Neeraj Mittal:
Special issue of SSS 2020. Inf. Comput. 289(Part): 104955 (2022) - Oyendrila Dobe, Erika Ábrahám, Ezio Bartocci, Borzoo Bonakdarpour:
Model checking hyperproperties for Markov decision processes. Inf. Comput. 289(Part): 104978 (2022) - Luca Geretti, Alessandro Abate, Pierluigi Nuzzo, Tiziano Villa:
Special issue: Formal verification of cyber-physical systems. Inf. Comput. 289(Part): 104979 (2022) - Rob van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke-Uffmann:
Abstract processes in the absence of conflicts in general place/transition systems. Inf. Comput. 289(Part): 104939 (2022) - Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa:
Converting nondeterministic two-way automata into small deterministic linear-time machines. Inf. Comput. 289(Part): 104938 (2022) - Lauri Hella, Antti Kuusisto, Raine Rönnholm:
Bounded game-theoretic semantics for modal mu-calculus. Inf. Comput. 289(Part): 104882 (2022) - Toshihiro Koga:
A pumping lemma for regular closure of prefix-free languages. Inf. Comput. 289(Part): 104976 (2022) - Jan Kretínský, Emanuel Ramneantu, Alexander Slivinskiy, Maximilian Weininger:
Comparison of algorithms for simple stochastic games. Inf. Comput. 289(Part): 104885 (2022)
skipping 12 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-13 19:43 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint