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 91 matches
- 2016
- Manindra Agrawal, Nitin Saxena, Shubham Sahai Srivastava:
Integer Factoring Using Small Algebraic Dependencies. MFCS 2016: 6:1-6:14 - S. Akshay, Patricia Bouyer, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Stochastic Timed Games Revisited. MFCS 2016: 8:1-8:14 - Georgios Amanatidis, Evangelos Markakis, Krzysztof Sornat:
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results. MFCS 2016: 9:1-9:13 - Saeed Akhoondian Amiri, Stephan Kreutzer, Dániel Marx, Roman Rabinovich:
Routing with Congestion in Acyclic Digraphs. MFCS 2016: 7:1-7:11 - Dana Angluin, Udi Boker, Dana Fisman:
Families of DFAs as Acceptors of omega-Regular Languages. MFCS 2016: 11:1-11:14 - Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. MFCS 2016: 12:1-12:14 - Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan:
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. MFCS 2016: 13:1-13:14 - Martijn Baartse, Klaus Meer:
Real Interactive Proofs for VPSPACE. MFCS 2016: 14:1-14:13 - Parvaneh Babari, Karin Quaas, Mahsa Shirmohammadi:
Synchronizing Data Words for Register Automata. MFCS 2016: 15:1-15:15 - Mitali Bafna, Satyanarayana V. Lokam, Sébastien Tavenas, Ameya Velingker:
On the Sensitivity Conjecture for Read-k Formulas. MFCS 2016: 16:1-16:14 - Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder:
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. MFCS 2016: 17:1-17:14 - Shai Ben-David:
How Far Are We From Having a Satisfactory Theory of Clustering? MFCS 2016: 1:1-1:1 - Volker Betz, Stéphane Le Roux:
Stable States of Perturbed Markov Chains. MFCS 2016: 18:1-18:14 - Markus Bläser, Vladimir Lysikov:
On Degeneration of Tensors and Algebras. MFCS 2016: 19:1-19:11 - Mikolaj Bojanczyk:
Decidable Extensions of MSO. MFCS 2016: 2:1-2:1 - Paul S. Bonsma, Daniël Paulusma:
Using Contracted Solution Graphs for Solving Reconfiguration Problems. MFCS 2016: 20:1-20:15 - Patricia Bouyer-Decitre:
Optimal Reachability in Weighted Timed Automata and Games. MFCS 2016: 3:1-3:3 - Paul Brunet, Damien Pous:
A Formal Exploration of Nominal Kleene Algebra. MFCS 2016: 22:1-22:13 - Maurice Chandoo:
On the Implicit Graph Conjecture. MFCS 2016: 23:1-23:13 - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Conditionally Optimal Algorithms for Generalized Büchi Games. MFCS 2016: 25:1-25:15 - Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Limit-Average Automata of Bounded Width. MFCS 2016: 24:1-24:14 - Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros:
FPT Algorithms for Plane Completion Problems. MFCS 2016: 26:1-26:13 - Yijia Chen, Jörg Flum:
Some Lower Bounds in Parameterized AC0. MFCS 2016: 27:1-27:14 - Samir Datta, Raghav Kulkarni, Anish Mukherjee:
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. MFCS 2016: 28:1-28:12 - Will Dison, Eduard Einstein, Timothy R. Riley:
Ackermannian Integer Compression and the Word Problem for Hydra Groups. MFCS 2016: 30:1-30:14 - Peter Dixon, Debasis Mandal, Aduri Pavan, N. V. Vinodchandran:
A Note on the Advice Complexity of Multipass Randomized Logspace. MFCS 2016: 31:1-31:7 - Titus Dose:
Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. MFCS 2016: 32:1-32:13 - Andre Droschinsky, Nils M. Kriege, Petra Mutzel:
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem. MFCS 2016: 33:1-33:14 - Eduard Eiben, Robert Ganian, O-joung Kwon:
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion. MFCS 2016: 34:1-34:14 - Stefan Fafianie, Eva-Maria C. Hols, Stefan Kratsch, Vuong Anh Quyen:
Preprocessing Under Uncertainty: Matroid Intersection. MFCS 2016: 35:1-35:14
skipping 61 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-09-24 15:55 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