Остановите войну!
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 38 matches
- 2008
- Omid Amini, Fedor V. Fomin, Saket Saurabh:
Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). FSTTCS 2008: 1-12 - Takahito Aoto:
Sound Lemma Generation for Proving Inductive Validity of Equations. FSTTCS 2008: 13-24 - Vikraman Arvind, Pushkar S. Joglekar:
Some Sieving Algorithms for Lattice Problems. FSTTCS 2008: 25-36 - Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili:
Analyzing Asynchronous Programs with Preemption. FSTTCS 2008: 37-48 - David A. Basin, Felix Klaedtke, Samuel Müller, Birgit Pfitzmann:
Runtime Monitoring of Metric First-order Temporal Properties. FSTTCS 2008: 49-60 - Noam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani:
Solvency Games. FSTTCS 2008: 61-72 - Dietmar Berwanger, Laurent Doyen:
On the Power of Imperfect Information. FSTTCS 2008: 73-82 - Didier Caucal:
Boolean algebras of unambiguous context-free languages. FSTTCS 2008: 83-94 - André Chailloux, Iordanis Kerenidis:
Increasing the power of the verifier in Quantum Zero Knowledge. FSTTCS 2008: 95-106 - Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar, Vishwanath Raman:
Algorithms for Game Metrics. FSTTCS 2008: 107-118 - Chandra Chekuri, Nitish Korula:
Pruning 2-Connected Graphs. FSTTCS 2008: 119-130 - Chandra Chekuri, Nitish Korula:
Single-Sink Network Design with Vertex Connectivity Requirements. FSTTCS 2008: 131-142 - Hubert Comon-Lundh:
About models of security protocols. FSTTCS 2008: 352-356 - Julien Cristau, Florian Horn:
Graph Games on Ordinals. FSTTCS 2008: 143-154 - Samir Datta, Nutan Limaye, Prajakta Nimbhorkar:
3-connected Planar Graph Isomorphism is in Log-space. FSTTCS 2008: 155-162 - Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez:
A new upper bound for 3-SAT. FSTTCS 2008: 163-174 - Rayna Dimitrova, Bernd Finkbeiner:
Abstraction Refinement for Games with Incomplete Information. FSTTCS 2008: 175-186 - Uriel Feige:
On Estimation Algorithms vs Approximation Algorithms. FSTTCS 2008: 357-363 - Alan M. Frieze, Ravi Kannan:
A new approach to the planted clique problem. FSTTCS 2008: 187-198 - Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan:
All-Norms and All-L_p-Norms Approximation Algorithms. FSTTCS 2008: 199-210 - Erich Grädel:
Banach-Mazur Games on Graphs. FSTTCS 2008: 364-382 - Stefan Gulan, Henning Fernau:
An Optimal Construction of Finite Automata from Regular Expressions. FSTTCS 2008: 211-222 - Ramesh Hariharan, Madhavan Mukund, V. Vinay:
2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2008: i - Ramesh Hariharan, Madhavan Mukund, V. Vinay:
2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2008: 10 - Jonathan Hayman, Glynn Winskel:
The unfolding of general Petri nets. FSTTCS 2008: 223-234 - Florian Horn:
Explicit Muller Games are PTIME. FSTTCS 2008: 235-243 - Kazuhiro Inaba, Sebastian Maneth:
The Complexity of Tree Transducer Output Languages. FSTTCS 2008: 244-255 - Simon L. Peyton Jones, Roman Leshchinskiy, Gabriele Keller, Manuel M. T. Chakravarty:
Harnessing the Multicores: Nested Data Parallelism in Haskell. FSTTCS 2008: 383-414 - Marcin Jurdzinski, Ashutosh Trivedi:
Average-Time Games. FSTTCS 2008: 340-351 - Sampath Kannan, Sanjeev Khanna, Sudeepa Roy:
STCON in Directed Unique-Path Graphs. FSTTCS 2008: 256-267
skipping 8 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 13:36 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