Остановите войну!
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 55 matches
- 2011
- Alexandr Andoni:
Nearest Neighbor Search in High-Dimensional Spaces. MFCS 2011: 1 - Yoram Bachrach:
The Least-Core of Threshold Network Flow Games. MFCS 2011: 36-47 - Paolo Baldan, Fabio Gadducci, Pawel Sobocinski:
Adhesivity Is Not Enough: Local Church-Rosser Revisited. MFCS 2011: 48-59 - Sebastian S. Bauer, Uli Fahrenberg, Line Juhl, Kim G. Larsen, Axel Legay, Claus R. Thrane:
Quantitative Refinement for Weighted Modal Transition Systems. MFCS 2011: 60-71 - Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, Thomas Sauerwald:
Faster Coupon Collecting via Replication with Applications in Gossiping. MFCS 2011: 72-83 - Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying Proofs in Constant Depth. MFCS 2011: 84-95 - Markus Bläser, Radu Curticapean:
The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree. MFCS 2011: 96-107 - Michel Blockelet, Sylvain Schmitz:
Model Checking Coverability Graphs of Vector Addition Systems. MFCS 2011: 108-119 - Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka:
Hard Functions for Low-Degree Polynomials over Prime Fields. MFCS 2011: 120-131 - Stanislav Böhm, Stefan Göller:
Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. MFCS 2011: 194-205 - Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun:
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. MFCS 2011: 132-144 - Rémi Bonnet:
The Reachability Problem for Vector Addition System with One Zero-Test. MFCS 2011: 145-157 - Michael Vanden Boom:
Weak Cost Monadic Logic over Infinite Trees. MFCS 2011: 580-591 - Christina Boucher:
The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity. MFCS 2011: 158-169 - Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. MFCS 2011: 170-181 - Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip:
Pattern-Guided Data Anonymization and Clustering. MFCS 2011: 182-193 - Balder ten Cate, Alessandro Facchini:
Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs. MFCS 2011: 290-302 - Krishnendu Chatterjee, Laurent Doyen:
Energy and Mean-Payoff Parity Markov Decision Processes. MFCS 2011: 206-218 - Jacek Chrzaszcz, Aleksy Schubert:
The Role of Polymorphism in the Characterisation of Complexity by Soft Types. MFCS 2011: 219-230 - David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Zivný:
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. MFCS 2011: 231-242 - Thomas Colcombet, Clemens Ley, Gabriele Puppis:
On the Use of Guards for Logics with Data. MFCS 2011: 243-255 - Evgeny Demenkov, Alexander S. Kulikov:
An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. MFCS 2011: 256-265 - Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
On the Complexity of the l-diversity Problem. MFCS 2011: 266-277 - Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi:
Infinite Synchronizing Words for Probabilistic Automata. MFCS 2011: 278-289 - John Fearnley, Oded Lachish:
Parity Games on Graphs with Medium Tree-Width. MFCS 2011: 303-314 - Jörg Flum:
Invariantization of Listings. MFCS 2011: 2 - Peter Franek, Stefan Ratschan, Piotr Zgliczynski:
Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable. MFCS 2011: 315-326 - Wladimir Fridman, Bernd Puchala:
Distributed Synthesis for Regular and Contextfree Specifications. MFCS 2011: 532-543 - Pawel Gawrychowski, Artur Jez, Andreas Maletti:
On Minimising Automata with Errors. MFCS 2011: 327-338 - Mai Gehrke:
Duality and Recognition. MFCS 2011: 3-18
skipping 25 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-05-25 21:21 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