Остановите войну!
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 52 matches
- 2016
- Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension. FSTTCS 2016: 37:1-37:14 - Ashutosh Rai, M. S. Ramanujan:
Strong Parameterized Deletion: Bipartite Graphs. FSTTCS 2016: 21:1-21:14 - Anindya Banerjee, David A. Naumann, Mohammad Nikouei:
Relational Logic with Framing and Hypotheses. FSTTCS 2016: 11:1-11:16 - Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Fréchet Distance Between a Line and Avatar Point Set. FSTTCS 2016: 32:1-32:14 - Sanjoy K. Baruah, Arvind Easwaran, Zhishan Guo:
Mixed-Criticality Scheduling to Minimize Makespan. FSTTCS 2016: 7:1-7:13 - Jaroslav Bendík, Nikola Benes, Ivana Cerná, Jiri Barnat:
Tunable Online MUS/MSS Enumeration. FSTTCS 2016: 50:1-50:13 - Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee:
Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. FSTTCS 2016: 34:1-34:15 - Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
The Power and Limitations of Uniform Samples in Testing Properties of Figures. FSTTCS 2016: 45:1-45:14 - Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Understanding Cutting Planes for QBFs. FSTTCS 2016: 40:1-40:15 - Umang Bhaskar, Ajil Jalal, Rahul Vaze:
The Adwords Problem with Strict Capacity Constraints. FSTTCS 2016: 30:1-30:14 - Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz:
Finger Search in Grammar-Compressed Strings. FSTTCS 2016: 36:1-36:16 - Benedikt Bollig:
One-Counter Automata with Counter Observability. FSTTCS 2016: 20:1-20:14 - Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison. FSTTCS 2016: 26:1-26:14 - Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur:
Admissibility in Quantitative Graph Games. FSTTCS 2016: 42:1-42:14 - Tevfik Bultan:
Side Channel Analysis Using a Model Counting Constraint Solver and Symbolic Execution (Invited Talk). FSTTCS 2016: 6:1-6:2 - Ramya C., B. V. Raghavendra Rao:
Sum of Products of Read-Once Formulas. FSTTCS 2016: 39:1-39:15 - Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing for Membership in Lattices. FSTTCS 2016: 46:1-46:14 - Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger:
Greed is Good for Deterministic Scale-Free Networks. FSTTCS 2016: 33:1-33:15 - Vrunda Dave, Shankara Narayanan Krishna, Ashutosh Trivedi:
FO-Definable Transformations of Infinite Strings. FSTTCS 2016: 12:1-12:14 - Amit Deshpande, Prahladh Harsha, Rakesh Venkat:
Embedding Approximately Low-Dimensional l_22 Metrics into l_1. FSTTCS 2016: 10:1-10:13 - Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
Model Checking Population Protocols. FSTTCS 2016: 27:1-27:14 - Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
Aperiodicity of Rational Functions Is PSPACE-Complete. FSTTCS 2016: 13:1-13:15 - Fedor V. Fomin:
Graph Decompositions and Algorithms (Invited Talk). FSTTCS 2016: 5:1-5:1 - Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan:
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. FSTTCS 2016: 9:1-9:14 - Moses Ganardi, Danny Hucke, Markus Lohrey:
Querying Regular Languages over Sliding Windows. FSTTCS 2016: 18:1-18:14 - Pawel Gawrychowski, Artur Jez:
LZ77 Factorisation of Trees. FSTTCS 2016: 35:1-35:15 - Shibashis Guha, Marcin Jurdzinski, Shankara Narayanan Krishna, Ashutosh Trivedi:
Mean-Payoff Games on Timed Automata. FSTTCS 2016: 44:1-44:14 - Sushmita Gupta, Sanjukta Roy:
Stable Matching Games: Manipulation via Subgraph Isomorphism. FSTTCS 2016: 29:1-29:14 - Prahladh Harsha, Srikanth Srinivasan:
Robust Multiplication-Based Tests for Reed-Muller Codes. FSTTCS 2016: 17:1-17:14 - Maximilian P. L. Haslbeck, Tobias Nipkow:
Verified Analysis of List Update Algorithms. FSTTCS 2016: 49:1-49:15
skipping 22 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-28 11: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