Остановите войну!
for scientists:
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 295 matches
- 2014
- Patrick Baillot, Erika De Benedetti, Simona Ronchi Della Rocca:
Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus. IFIP TCS 2014: 151-163 - Anna Bernasconi, Valentina Ciriani:
Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults. IFIP TCS 2014: 1-12 - Jon Haël Brenas, Rachid Echahed, Martin Strecker:
A Hoare-Like Calculus Using the SROIQ σ Logic on Transformations of Graphs. IFIP TCS 2014: 164-178 - H. J. Sander Bruggink, Barbara König, Hans Zantema:
Termination Analysis for Graph Transformation Systems. IFIP TCS 2014: 179-194 - Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca:
The Inhabitation Problem for Non-idempotent Intersection Types. IFIP TCS 2014: 341-354 - Vincent Carnino, Sylvain Lombardy:
Tropical Two-Way Automata. IFIP TCS 2014: 195-206 - Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani:
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs. IFIP TCS 2014: 13-26 - Souymodip Chakraborty, Joost-Pieter Katoen:
Parametric LTL on Markov Chains. IFIP TCS 2014: 207-221 - Fei Chen, Xiaowei Wu:
Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks. IFIP TCS 2014: 27-38 - Vincenzo Ciancia, Diego Latella, Michele Loreti, Mieke Massink:
Specifying and Verifying Properties of Space. IFIP TCS 2014: 222-235 - Carlos Cotrini, Yuri Gurevich, Ori Lahav, Artem Melentyev:
Primal Infon Logic with Conjunctions as Sets. IFIP TCS 2014: 236-249 - Andreas Darmann, Ulrich Pferschy, Joachim Schauer:
The Shortest Path Game: Complexity and Algorithms. IFIP TCS 2014: 39-53 - Jeremy E. Dawson, Ranald Clouston, Rajeev Goré, Alwen Tiu:
From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic. IFIP TCS 2014: 250-264 - Stanley P. Y. Fung:
Online Scheduling of Unit Length Jobs with Commitment and Penalties. IFIP TCS 2014: 54-65 - Sergey Goncharov, Stefan Milius, Alexandra Silva:
Towards a Coalgebraic Chomsky Hierarchy - (Extended Abstract). IFIP TCS 2014: 265-280 - Laurent Gourvès, Jérôme Monnot, Aris Pagourtzis:
The Lazy Matroid Problem. IFIP TCS 2014: 66-77 - Helle Hvid Hansen, Clemens Kupke, Raul Andres Leal:
Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics. IFIP TCS 2014: 281-295 - Riko Jacob, Tobias Lieber, Matthias Mnich:
Treewidth Computation and Kernelization in the Parallel External Memory Model. IFIP TCS 2014: 78-89 - Delia Kesner, Daniel Ventura:
Quantitative Types for the Linear Substitution Calculus. IFIP TCS 2014: 296-310 - Barbara König, Sebastian Küpper:
Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata. IFIP TCS 2014: 311-325 - Martin Lange, Étienne Lozes:
Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic. IFIP TCS 2014: 90-103 - Dominique Larchey-Wendling, Didier Galmiche:
Looking at Separation Algebras with Boolean BI-eyes. IFIP TCS 2014: 326-340 - Hiroki Morizumi:
Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions. IFIP TCS 2014: 104-110 - Ilkka Törmä:
Subshifts, MSO Logic, and Collapsing Hierarchies. IFIP TCS 2014: 111-122 - Jirí Wiedermann:
Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds' Algorithm. IFIP TCS 2014: 123-135 - Tomoyuki Yamakami:
Not All Multi-Valued Partial CFL Functions Are Refined by Single-Valued Functions (Extended Abstract). IFIP TCS 2014: 136-150 - Josep Díaz, Ivan Lanese, Davide Sangiorgi:
Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings. Lecture Notes in Computer Science 8705, Springer 2014, ISBN 978-3-662-44601-0 [contents] - 2012
- Davide Ancona, Giovanni Lagorio:
Static Single Information Form for Abstract Compilation. IFIP TCS 2012: 10-27 - Steffen van Bakel, Maria Grazia Vigliotti:
An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus - Extended Abstract. IFIP TCS 2012: 372-387 - Emmanuel Beffara, Virgile Mogbil:
Proofs as Executions. IFIP TCS 2012: 280-294
skipping 265 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-07-31 09:08 CEST 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