Остановите войну!
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 51 matches
- 2015
- Fidaa Abed, Ioannis Caragiannis, Alexandros A. Voudouris:
Near-Optimal Asymmetric Binary Matrix Partitions. MFCS (2) 2015: 1-13 - Eric Allender, Anna Gál, Ian Mertz:
Dual VP Classes. MFCS (2) 2015: 14-25 - Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
On Tinhofer's Linear Programming Approach to Isomorphism Testing. MFCS (2) 2015: 26-37 - Vikraman Arvind, Gaurav Rattan, Pushkar S. Joglekar:
On the Complexity of Noncommutative Polynomial Factorization. MFCS (2) 2015: 38-49 - Martijn Baartse, Klaus Meer:
An Algebraic Proof of the Real Number PCP Theorem. MFCS (2) 2015: 50-61 - Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller:
On the Complexity of Hub Labeling (Extended Abstract). MFCS (2) 2015: 62-74 - Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
On the Complexity of Speed Scaling. MFCS (2) 2015: 75-89 - Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Almost All Functions Require Exponential Energy. MFCS (2) 2015: 90-101 - Surender Baswana, Keerti Choudhary:
On Dynamic DFS Tree in Directed Graphs. MFCS (2) 2015: 102-114 - Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan:
Metric Dimension of Bounded Width Graphs. MFCS (2) 2015: 115-126 - Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck:
Equality, Revisited. MFCS (2) 2015: 127-138 - Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Chordal Graphs. MFCS (2) 2015: 139-150 - Vladimir Braverman, Zaoxing Liu, Tejasvam Singh, N. V. Vinodchandran, Lin F. Yang:
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory. MFCS (2) 2015: 151-162 - Andrei A. Bulatov, Evgeny S. Skvortsov:
Phase Transition for Local Search on Planted SAT. MFCS (2) 2015: 175-186 - Cafer Caferov, Baris Kaya, Ryan O'Donnell, A. C. Cem Say:
Optimal Bounds for Estimating Entropy with PMF Queries. MFCS (2) 2015: 187-198 - Adam Case, Jack H. Lutz:
Mutual Dimension and Random Sequences. MFCS (2) 2015: 199-210 - Ruiwen Chen:
Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases. MFCS (2) 2015: 223-234 - Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae:
Optimal Algorithms and a PTAS for Cost-Aware Scheduling. MFCS (2) 2015: 211-222 - Daniyar Chumbalov, Andrei E. Romashchenko:
Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem. MFCS (2) 2015: 235-247 - Andreas Cord-Landwehr, Pascal Lenzner:
Network Creation Games: Think Global - Act Local. MFCS (2) 2015: 248-260 - Claude Crépeau, Raza Ali Kazmi:
Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem. MFCS (2) 2015: 261-273 - Giovanni Di Crescenzo, Brian A. Coan, Jonathan Kirsch:
Efficient Computations over Encrypted Data Blocks. MFCS (2) 2015: 274-286 - Martijn van Ee, René Sitters:
On the Complexity of Master Problems. MFCS (2) 2015: 567-576 - Michael Etscheid, Stefan Kratsch, Matthias Mnich, Heiko Röglin:
Polynomial Kernels for Weighted Problems. MFCS (2) 2015: 287-298 - Stefan Fafianie, Stefan Kratsch:
A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time. MFCS (2) 2015: 299-310 - Diodato Ferraioli, Carmine Ventre:
Metastability of Asymptotically Well-Behaved Potential Games - (Extended Abstract). MFCS (2) 2015: 311-323 - Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. MFCS (2) 2015: 324-335 - Jakub Gajarský, Michael Lampis, Kazuhisa Makino, Valia Mitsou, Sebastian Ordyniak:
Parameterized Algorithms for Parity Games. MFCS (2) 2015: 336-347 - Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. MFCS (2) 2015: 348-360 - Ignacio García-Marco, Pascal Koiran, Sébastien Tavenas:
Log-Concavity and Lower Bounds for Arithmetic Circuits. MFCS (2) 2015: 361-371
skipping 21 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-27 16:29 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