default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 45 matches
- 2023
- Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks:
Acyclic Petri and Workflow Nets with Resets. FSTTCS 2023: 16:1-16:18 - R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. FSTTCS 2023: 8:1-8:18 - Anupam Das, Abhishek De, Alexis Saurin:
Comparing Infinitary Systems for Linear Logic with Fixed Points. FSTTCS 2023: 40:1-40:17 - Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh:
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. FSTTCS 2023: 28:1-28:16 - Amir Abboud, Seri Khoury, Oree Leibowitz, Ron Safier:
Listing 4-Cycles. FSTTCS 2023: 25:1-25:16 - Akanksha Agrawal, M. S. Ramanujan:
Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels. FSTTCS 2023: 36:1-36:17 - Shaull Almagor, Daniel Assa, Udi Boker:
Synchronized CTL over One-Counter Automata. FSTTCS 2023: 19:1-19:22 - Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán:
Bandwidth of Timed Automata: 3 Classes. FSTTCS 2023: 10:1-10:17 - Debajyoti Bera, SAPV Tharrmashastha:
A Generalized Quantum Branching Program. FSTTCS 2023: 31:1-31:21 - Ashwin Bhaskar, M. Praveen:
Constraint LTL with Remote Access. FSTTCS 2023: 41:1-41:21 - Pranav Bisht, Nikhil Gupta, Ilya Volkovich:
Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae. FSTTCS 2023: 9:1-9:23 - Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar:
Bounded Simultaneous Messages. FSTTCS 2023: 23:1-23:17 - Thomas Brihaye, Aline Goeminne, James C. A. Main, Mickael Randour:
Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk). FSTTCS 2023: 1:1-1:26 - Arghya Chakraborty, Rahul Vaze:
Online Facility Location with Weights and Congestion. FSTTCS 2023: 6:1-6:22 - Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse:
Monotone Classes Beyond VNP. FSTTCS 2023: 11:1-11:23 - Abhimanyu Choudhury, Meena Mahajan:
Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic Study. FSTTCS 2023: 38:1-38:18 - Rahul Chugh, Supartha Podder, Swagato Sanyal:
Decision Tree Complexity Versus Block Sensitivity and Degree. FSTTCS 2023: 27:1-27:23 - Wojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michal Skrzypczak, Frank Stephan, Christopher Tan:
Languages Given by Finite Automata over the Unary Alphabet. FSTTCS 2023: 22:1-22:20 - Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski:
New Lower Bounds for Reachability in Vector Addition Systems. FSTTCS 2023: 35:1-35:22 - Jacques Dark, Adithya Diddapur, Christian Konrad:
Interval Selection in Data Streams: Weighted Intervals and the Insertion-Deletion Setting. FSTTCS 2023: 24:1-24:17 - Yoav Feinstein, Orna Kupferman:
Monotonicity Characterizations of Regular Languages. FSTTCS 2023: 26:1-26:19 - Alain Finkel, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Georg Zetzsche:
Counter Machines with Infrequent Reversals. FSTTCS 2023: 42:1-42:17 - Harmender Gahlawat, Meirav Zehavi:
Parameterized Complexity of Incomplete Connected Fair Division. FSTTCS 2023: 14:1-14:18 - Venkatesan Guruswami, Rishi Saket:
Hardness of Learning Boolean Functions from Label Proportions. FSTTCS 2023: 37:1-37:15 - Léo Henry, Blaise Genest, Alexandre Drewery:
Reinforcement Planning for Effective ε-Optimal Policies in Dense Time with Discontinuities. FSTTCS 2023: 13:1-13:18 - Telikepalli Kavitha, Kazuhisa Makino:
Perfect Matchings and Popularity in the Many-To-Many Setting. FSTTCS 2023: 43:1-43:16 - Chris Köcher
, Georg Zetzsche:
Regular Separators for VASS Coverability Languages. FSTTCS 2023: 15:1-15:19 - Dietrich Kuske:
A Class of Rational Trace Relations Closed Under Composition. FSTTCS 2023: 20:1-20:20 - Olivier Lalonde, Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. FSTTCS 2023: 32:1-32:18 - Ulysse Léchine:
Revisiting Mulmuley: Simple Proof That Maxflow Is Not in the Algebraic Version of NC. FSTTCS 2023: 33:1-33:12
skipping 15 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-12-23 02:07 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
