Остановите войну!
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 84 matches
- 2020
- Lukasz Czajka:
An operational interpretation of coinductive types. Log. Methods Comput. Sci. 16(1) (2020) - Lukasz Czajka:
A new coinductive confluence proof for infinitary lambda calculus. Log. Methods Comput. Sci. 16(1) (2020) - Bart Jacobs, Abraham Westerbaan:
Distances between States and between Predicates. Log. Methods Comput. Sci. 16(1) (2020) - Andreas Abel, Thierry Coquand:
Failure of Normalization in Impredicative Type Theory with Proof-Irrelevant Propositional Equality. Log. Methods Comput. Sci. 16(2) (2020) - Étienne André, Didier Lime, Nicolas Markey:
Language Preservation Problems in Parametric Timed Automata. Log. Methods Comput. Sci. 16(1) (2020) - Marcelo Arenas, Martin Muñoz, Cristian Riveros:
Descriptive Complexity for Counting Complexity Classes. Log. Methods Comput. Sci. 16(1) (2020) - Giorgio Audrito, Jacob Beal, Ferruccio Damiani, Danilo Pianini, Mirko Viroli:
Field-based Coordination with the Share Operator. Log. Methods Comput. Sci. 16(4) (2020) - Mauricio Ayala-Rincón, Maribel Fernández, Daniele Nantes-Sobrinho:
On Nominal Syntax and Permutation Fixed Points. Log. Methods Comput. Sci. 16(1) (2020) - Miriam Backens, Simon Perdrix, Quanlong Wang:
Towards a Minimal Stabilizer ZX-calculus. Log. Methods Comput. Sci. 16(4) (2020) - Hendrik Pieter Barendregt:
Gems of Corrado Böhm. Log. Methods Comput. Sci. 16(3) (2020) - Davide Basile, Maurice H. ter Beek, Rosario Pugliese:
Synthesis of Orchestrations and Choreographies: Bridging the Gap between Supervisory Control and Coordination of Services. Log. Methods Comput. Sci. 16(2) (2020) - Nicolas Behr, Vincent Danos, Ilias Garnier:
Combinatorial Conversion and Moment Bisimulation for Stochastic Rewriting Systems. Log. Methods Comput. Sci. 16(3) (2020) - Nicolas Behr, Pawel Sobocinski:
Rule Algebras for Adhesive Categories. Log. Methods Comput. Sci. 16(3) (2020) - Amir M. Ben-Amram, Geoff W. Hamilton:
Tight Polynomial Worst-Case Bounds for Loop Programs. Log. Methods Comput. Sci. 16(2) (2020) - Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. Log. Methods Comput. Sci. 16(2) (2020) - Achim Blumensath:
Regular Tree Algebras. Log. Methods Comput. Sci. 16(1) (2020) - Laura Bocchi, Hernán C. Melgratti, Emilio Tuosto:
On Resolving Non-determinism in Choreographies. Log. Methods Comput. Sci. 16(3) (2020) - Manuel Bodirsky, Johannes Greiner:
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems. Log. Methods Comput. Sci. 16(1) (2020) - Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith:
Undecidability of a weak version of MSO+U. Log. Methods Comput. Sci. 16(1) (2020) - Olivier Bournez, Amaury Pouly:
A Universal Ordinary Differential Equation. Log. Methods Comput. Sci. 16(1) (2020) - Thomas Brihaye, Véronique Bruyère, Aline Goeminne, Jean-François Raskin, Marie van den Bogaard:
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games. Log. Methods Comput. Sci. 16(4) (2020) - Thomas Brihaye, Florent Delgrange, Youssouf Oualhadj, Mickael Randour:
Life is Random, Time is Not: Markov Decision Processes with Window Objectives. Log. Methods Comput. Sci. 16(4) (2020) - Ulrik Buchholtz, Kuen-Bang Hou (Favonia):
Cellular Cohomology in Homotopy Type Theory. Log. Methods Comput. Sci. 16(2) (2020) - Jan Bydzovsky, Jan Krajícek, Igor C. Oliveira:
Consistency of circuit lower bounds with bounded theories. Log. Methods Comput. Sci. 16(2) (2020) - Michaël Cadilhac, Olivier Carton, Charles Paperman:
Continuity of Functional Transducers: A Profinite Study of Rational Functions. Log. Methods Comput. Sci. 16(1) (2020) - Merlin Carl, Benjamin G. Rin, Philipp Schlicht:
Reachability for infinite time Turing machines with long tapes. Log. Methods Comput. Sci. 16(2) (2020) - Olivier Carton, Luc Boasson:
Transfinite Lyndon words. Log. Methods Comput. Sci. 16(4) (2020) - Giuseppe Castagna:
Covariance and Controvariance: a fresh look at an old issue (a primer in advanced type systems for learning functional programmers). Log. Methods Comput. Sci. 16(1) (2020) - Francesco Ciraulo, Michele Contente:
Overlap Algebras: a Constructive Look at Complete Boolean Algebras. Log. Methods Comput. Sci. 16(1) (2020) - Thomas Colcombet, Daniela Petrisan:
Automata Minimization: a Functorial Approach. Log. Methods Comput. Sci. 16(1) (2020)
skipping 54 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-04-25 11:12 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