Остановите войну!
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 49 matches
- 2018
- Satya V. Lokam, R. Ramanujam:
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India. LIPIcs 93, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-055-2 [contents] - 2017
- Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir:
Monitoring for Silent Actions. FSTTCS 2017: 7:1-7:14 - Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath:
Maintaining Reeb Graphs of Triangulated 2-Manifolds. FSTTCS 2017: 8:1-8:14 - Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan:
On the Parameterized Complexity of Simultaneous Deletion Problems. FSTTCS 2017: 9:1-9:14 - Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. FSTTCS 2017: 10:1-10:13 - Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Verification of Asynchronous Programs with Nested Locks. FSTTCS 2017: 11:1-11:14 - Bartosz Bednarczyk, Witold Charatonik:
Modulo Counting on Words and Trees. FSTTCS 2017: 12:1-12:16 - Béatrice Bérard, Serge Haddad, Engel Lefaucheux:
Probabilistic Disclosure: Maximisation vs. Minimisation. FSTTCS 2017: 13:1-13:14 - Olaf Beyersdorff, Luke Hinde, Ján Pich:
Reasons for Hardness in QBF Proof Systems. FSTTCS 2017: 14:1-14:15 - Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari:
An Improved Dictatorship Test with Perfect Completeness. FSTTCS 2017: 15:1-15:23 - Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. FSTTCS 2017: 16:1-16:15 - Udi Boker:
Rabin vs. Streett Automata. FSTTCS 2017: 17:1-17:15 - Udi Boker, Orna Kupferman, Michal Skrzypczak:
How Deterministic are Good-For-Games Automata?. FSTTCS 2017: 18:1-18:14 - Joseph Boninger, Joshua Brody, Owen Kephart:
Non-Adaptive Data Structure Bounds for Dynamic Predecessor. FSTTCS 2017: 20:1-20:12 - Florian Brandl, Telikepalli Kavitha:
Popular Matchings with Multiple Partners. FSTTCS 2017: 19:1-19:15 - Onur Cagirici, Petr Hlinený, Bodhayan Roy:
On Colourability of Polygon Visibility Graphs. FSTTCS 2017: 21:1-21:14 - Yixin Cao, Yuping Ke, Yota Otachi, Jie You:
Vertex Deletion Problems on Chordal Graphs. FSTTCS 2017: 22:1-22:14 - Arkadev Chattopadhyay, Nikhil S. Mande:
A Lifting Theorem with Applications to Symmetric Functions. FSTTCS 2017: 23:1-23:14 - Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
Local Patterns. FSTTCS 2017: 24:1-24:14 - Stéphane Demri, Étienne Lozes, Denis Lugiez:
On Symbolic Heaps Modulo Permission Theories. FSTTCS 2017: 25:1-25:14 - Rüdiger Ehlers, Bernd Finkbeiner:
Symmetric Synthesis. FSTTCS 2017: 26:1-26:13 - Edith Elkind:
Justified Representation in Multiwinner Voting: Axioms and Algorithms. FSTTCS 2017: 1:1-1:10 - Alina Ene, Viswanath Nagarajan, Rishi Saket:
Approximation Algorithms for Stochastic k-TSP. FSTTCS 2017: 27:27-27:14 - Bernd Finkbeiner, Paul Gölz:
Synthesis in Distributed Environments. FSTTCS 2017: 28:1-28:14 - Apoorv Garg, Abhiram G. Ranade:
Train Scheduling on a Unidirectional Path. FSTTCS 2017: 29:1-29:14 - Hugo Gimbert:
On the Control of Asynchronous Automata. FSTTCS 2017: 30:1-30:15 - Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Streaming for Aibohphobes: Longest Palindrome with Mismatches. FSTTCS 2017: 31:1-31:13 - Guru Guruganesh, Euiwoong Lee:
Understanding the Correlation Gap For Matchings. FSTTCS 2017: 32:1-32:15 - Venkatesan Guruswami, Rishi Saket:
Hardness of Rainbow Coloring Hypergraphs. FSTTCS 2017: 33:33-33:15 - Yi Huang, Mano Vikash Janardhanan, Lev Reyzin:
Network Construction with Ordered Constraints. FSTTCS 2017: 34:34-34:13
skipping 19 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-06-02 17:58 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