Остановите войну!
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 46 matches
- 2022
- Anupam Gupta:
Algorithms for Uncertain Environments: Going Beyond the Worst-Case (Invited Talk). FSTTCS 2022: 1:1-1:1 - Abhishek De, Farzad Jafarrahmani, Alexis Saurin:
Phase Semantics for Linear Logic with Least and Greatest Fixed Points. FSTTCS 2022: 35:1-35:23 - Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur:
Semilinear Representations for Series-Parallel Atomic Congestion Games. FSTTCS 2022: 32:1-32:20 - Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas:
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. FSTTCS 2022: 23:1-23:22 - Mohit Garg, Suneel Sarswat:
The Design and Regulation of Exchanges: A Formal Approach. FSTTCS 2022: 39:1-39:21 - Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Ðorde Zikelic:
Algorithms and Hardness Results for Computing Cores of Markov Chains. FSTTCS 2022: 29:1-29:20 - Guy Avni, Suman Sadhukhan:
Computing Threshold Budgets in Discrete-Bidding Games. FSTTCS 2022: 30:1-30:18 - Jasine Babu, R. Krithika, Deepak Rajendraprasad:
Packing Arc-Disjoint 4-Cycles in Oriented Graphs. FSTTCS 2022: 5:1-5:16 - Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu:
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. FSTTCS 2022: 6:1-6:18 - Dylan Bellier, Sophie Pinchinat, François Schwarzentruber:
Dependency Matrices for Multiplayer Strategic Dependencies. FSTTCS 2022: 31:1-31:21 - Gianfranco Bilardi, Lorenzo De Stefani:
The DAG Visit Approach for Pebbling and I/O Lower Bounds. FSTTCS 2022: 7:1-7:23 - Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Counting and Sampling from Substructures Using Linear Algebraic Queries. FSTTCS 2022: 8:1-8:20 - Pranav Bisht, Nitin Saxena:
Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse Polynomials. FSTTCS 2022: 9:1-9:19 - Pranav Bisht, Ilya Volkovich:
On Solving Sparse Polynomial Factorization Related Problems. FSTTCS 2022: 10:1-10:22 - Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games. FSTTCS 2022: 33:1-33:18 - Patricia Bouyer, Mickael Randour, Pierre Vandenhove:
The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk). FSTTCS 2022: 3:1-3:18 - Olivier Carton:
Ambiguity Through the Lens of Measure Theory. FSTTCS 2022: 34:1-34:14 - Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda:
Complexity of Spatial Games. FSTTCS 2022: 11:1-11:14 - Arkadev Chattopadhyay, Utsab Ghosal, Partha Mukhopadhyay:
Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product. FSTTCS 2022: 12:1-12:20 - Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn:
Inscribing or Circumscribing a Histogon to a Convex Polygon. FSTTCS 2022: 13:1-13:16 - Joshua Cook:
More Verifier Efficient Interactive Protocols for Bounded Space. FSTTCS 2022: 14:1-14:18 - Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro:
Improved Quantum Query Upper Bounds Based on Classical Decision Trees. FSTTCS 2022: 15:1-15:22 - Radu Curticapean, Nutan Limaye, Srikanth Srinivasan:
On the VNP-Hardness of Some Monomial Symmetric Polynomials. FSTTCS 2022: 16:1-16:14 - Minati De, Saksham Jain, Sarat Varma Kallepalli, Satyam Singh:
Online Piercing of Geometric Objects. FSTTCS 2022: 17:1-17:16 - Irit Dinur:
Expanders in Higher Dimensions (Invited Talk). FSTTCS 2022: 4:1-4:1 - Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, Alex Pahlow:
Half-Guarding Weakly-Visible Polygons and Terrains. FSTTCS 2022: 18:1-18:17 - Rüdiger Ehlers, Sven Schewe:
Natural Colors of Infinite Words. FSTTCS 2022: 36:1-36:17 - Bernd Finkbeiner, Noemi Passing:
Synthesizing Dominant Strategies for Liveness. FSTTCS 2022: 37:1-37:19 - Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick:
Low-Latency Sliding Window Algorithms for Formal Languages. FSTTCS 2022: 38:1-38:23 - Rohith Reddy Gangam, Tung Mai, Nitya Raju, Vijay V. Vazirani:
A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications. FSTTCS 2022: 19:1-19:20
skipping 16 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-08-24 10:55 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