Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Olivier Lalonde, Nikhil S. Mande, Ronald de Wolf |
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 32:1-32:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Prince Mathew 0001, Vincent Penelle, Prakash Saivasan, A. V. Sreejith |
Weighted One-Deterministic-Counter Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 39:1-39:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shaull Almagor, Daniel Assa, Udi Boker |
Synchronized CTL over One-Counter Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 19:1-19:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 0:1-0:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mihir Vahanwala |
Robust Positivity Problems for Linear Recurrence Sequences: The Frontiers of Decidability for Explicitly Given Neighbourhoods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 17:1-17:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jishnu Roychoudhury, Jatin Yadav |
An Optimal Algorithm for Sorting in Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 7:1-7:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Léo Henry, Blaise Genest, Alexandre Drewery |
Reinforcement Planning for Effective ε-Optimal Policies in Dense Time with Discontinuities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 13:1-13:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Telikepalli Kavitha, Kazuhisa Makino |
Perfect Matchings and Popularity in the Many-To-Many Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 43:1-43:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alain Finkel, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Georg Zetzsche |
Counter Machines with Infrequent Reversals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 42:1-42:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Chris Köcher, Georg Zetzsche |
Regular Separators for VASS Coverability Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 15:1-15:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Harmender Gahlawat, Meirav Zehavi |
Parameterized Complexity of Incomplete Connected Fair Division. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 14:1-14:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Amir Abboud, Seri Khoury, Oree Leibowitz, Ron Safier |
Listing 4-Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 25:1-25:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Arghya Chakraborty, Rahul Vaze |
Online Facility Location with Weights and Congestion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 6:1-6:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Dietrich Kuske |
A Class of Rational Trace Relations Closed Under Composition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 20:1-20:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Leonard J. Schulman |
Computational and Information-Theoretic Questions from Causal Inference (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 3:1-3:1, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse |
Monotone Classes Beyond VNP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 11:1-11:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Wojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain 0001, Michal Skrzypczak, Frank Stephan 0001, Christopher Tan |
Languages Given by Finite Automata over the Unary Alphabet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 22:1-22:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yoav Feinstein, Orna Kupferman |
Monotonicity Characterizations of Regular Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 26:1-26:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jacques Dark, Adithya Diddapur, Christian Konrad 0001 |
Interval Selection in Data Streams: Weighted Intervals and the Insertion-Deletion Setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 24:1-24:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Abhimanyu Choudhury, Meena Mahajan |
Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 38:1-38:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Dieter van Melkebeek, Nicollas M. Sdroievski |
Leakage Resilience, Targeted Pseudorandom Generators, and Mild Derandomization of Arthur-Merlin Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 29:1-29:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Aniket Murhekar, Eklavya Sharma |
Nash Equilibria of Two-Player Matrix Games Repeated Until Collision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 18:1-18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil S. Mande, Manaswi Paraashar, Nitin Saurabh |
Randomized and Quantum Query Complexities of Finding a King in a Tournament. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 30:1-30:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Rahul Chugh, Supartha Podder, Swagato Sanyal |
Decision Tree Complexity Versus Block Sensitivity and Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 27:1-27:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Prasad Raghavendra |
On Measuring Average Case Complexity via Sum-Of-Squares Degree (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 2:1-2:1, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Rishi Saket |
Hardness of Learning Boolean Functions from Label Proportions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 37:1-37:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Andrej Bogdanov, Krishnamoorthy Dinesh 0001, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar |
Bounded Simultaneous Messages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 23:1-23:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Irmak Saglam, Anne-Kathrin Schmuck |
Solving Odd-Fair Parity Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 34:1-34:24, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alvin Yan Hong Yao, Diptarka Chakraborty |
Approximate Maximum Rank Aggregation: Beyond the Worst-Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 12:1-12:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota 0001, Jérôme Leroux, Lukasz Orlikowski |
New Lower Bounds for Reachability in Vector Addition Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 35:1-35:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Anupam Das 0002, Abhishek De 0001, Alexis Saurin |
Comparing Infinitary Systems for Linear Logic with Fixed Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 40:1-40:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry Chistikov 0001, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks |
Acyclic Petri and Workflow Nets with Resets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 16:1-16:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Patricia Bouyer, Srikanth Srinivasan 0001 (eds.) |
43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1 The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
1 | Nisheeth K. Vishnoi |
Algorithms in the Presence of Biased Inputs (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 5:1-5:2, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Pranav Bisht, Nikhil Gupta 0012, Ilya Volkovich |
Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 9:1-9:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán |
Bandwidth of Timed Automata: 3 Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 10:1-10:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | 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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 1:1-1:26, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Debajyoti Bera, SAPV Tharrmashastha |
A Generalized Quantum Branching Program. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 31:1-31:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Vijay V. Vazirani |
Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 21:1-21:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ulysse Léchine |
Revisiting Mulmuley: Simple Proof That Maxflow Is Not in the Algebraic Version of NC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 33:1-33:12, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sharon Shoham |
From Concept Learning to SAT-Based Invariant Inference (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 4:1-4:1, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tanmay Inamdar 0002, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan 0001, Saket Saurabh 0001 |
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 28:1-28:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | R. Krithika 0001, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale |
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 8:1-8:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Akanksha Agrawal 0001, M. S. Ramanujan 0001 |
Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 36:1-36:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ashwin Bhaskar, M. Praveen |
Constraint LTL with Remote Access. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 41:1-41:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Bernd Finkbeiner, Noemi Passing |
Synthesizing Dominant Strategies for Liveness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 37:1-37:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Irit Dinur |
Expanders in Higher Dimensions (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 4:1-4:1, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Rüdiger Ehlers, Sven Schewe |
Natural Colors of Infinite Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 36:1-36:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Florent Koechlin |
New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 41:1-41:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Arkadev Chattopadhyay, Utsab Ghosal, Partha Mukhopadhyay |
Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 12:1-12:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Ðorde Zikelic |
Algorithms and Hardness Results for Computing Cores of Markov Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 29:1-29:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Guy Avni, Suman Sadhukhan |
Computing Threshold Budgets in Discrete-Bidding Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 30:1-30:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Gianfranco Bilardi, Lorenzo De Stefani |
The DAG Visit Approach for Pebbling and I/O Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 7:1-7:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Pranav Bisht, Ilya Volkovich |
On Solving Sparse Polynomial Factorization Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 10:1-10:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 18:1-18:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu 0002 |
Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 6:1-6:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Ramita Maharjan, Thomas Watson 0001 |
Complexity of Fault Tolerant Query Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 26:1-26:11, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | 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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 3:1-3:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Minati De, Saksham Jain, Sarat Varma Kallepalli, Satyam Singh |
Online Piercing of Geometric Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 17:1-17:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Abhishek De 0001, Farzad Jafarrahmani, Alexis Saurin |
Phase Semantics for Linear Logic with Least and Greatest Fixed Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 35:1-35:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | K. S. Thejaswini, Pierre Ohlmann, Marcin Jurdzinski |
A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 44:1-44:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jasine Babu, R. Krithika 0001, Deepak Rajendraprasad |
Packing Arc-Disjoint 4-Cycles in Oriented Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 5:1-5:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Rahul Santhanam |
Why MCSP Is a More Important Problem Than SAT (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 2:1-2:1, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Telikepalli Kavitha |
Stable Matchings with One-Sided Ties and Approximate Popularity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 22:1-22:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Pranav Bisht, Nitin Saxena 0001 |
Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 9:1-9:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Orna Kupferman, Ofer Leshkowitz |
Synthesis of Privacy-Preserving Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 42:1-42:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, Hee-Kap Ahn |
Inscribing or Circumscribing a Histogon to a Convex Polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 13:1-13:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Oded Lachish, Felix Reidl, Chhaya Trehan |
When You Come at the King You Best Not Miss. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 25:1-25:12, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann 0002 |
Parikh Automata over Infinite Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 40:1-40:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Thomas Place, Marc Zeitoun |
A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 43:1-43:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar |
Counting and Sampling from Substructures Using Linear Algebraic Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 8:1-8:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Radu Curticapean, Nutan Limaye, Srikanth Srinivasan 0001 |
On the VNP-Hardness of Some Monomial Symmetric Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 16:1-16:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Nathalie Bertrand 0001, Nicolas Markey, Suman Sadhukhan, Ocan Sankur |
Semilinear Representations for Series-Parallel Atomic Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 32:1-32:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Olivier Carton |
Ambiguity Through the Lens of Measure Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 34:1-34:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Vijay V. Vazirani |
New Characterizations of Core Imputations of Matching and b-Matching Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 28:1-28:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro |
Improved Quantum Query Upper Bounds Based on Classical Decision Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 15:1-15:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Pascal Koiran, Subhayan Saha |
Black Box Absolute Reconstruction for Sums of Powers of Linear Forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 24:1-24:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Rohith Reddy Gangam, Tung Mai, Nitya Raju, Vijay V. Vazirani |
A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 19:1-19:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Dylan Bellier, Sophie Pinchinat, François Schwarzentruber |
Dependency Matrices for Multiplayer Strategic Dependencies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 31:1-31:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Anupam Gupta 0001 |
Algorithms for Uncertain Environments: Going Beyond the Worst-Case (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 1:1-1:1, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Moses Ganardi, Louis Jachiet, Markus Lohrey, Thomas Schwentick |
Low-Latency Sliding Window Algorithms for Formal Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 38:1-38:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux 0001 |
Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 33:1-33:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, Gaurav Viramgami |
Romeo and Juliet Meeting in Forest like Regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 27:1-27:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Mohit Garg 0003, Suneel Sarswat |
The Design and Regulation of Exchanges: A Formal Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 39:1-39:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Anuj Dawar, Venkatesan Guruswami (eds.) |
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7 The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 0:1-0:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Utkarsh Joshi, Saladi Rahul, Josson Joe Thoppil |
A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 21:1-21:12, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Joshua Cook |
More Verifier Efficient Interactive Protocols for Bounded Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 14:1-14:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda |
Complexity of Spatial Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 11:1-11:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Arindam Khan 0001, Eklavya Sharma, K. V. N. Sreenivas |
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 23:1-23:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Fulvio Gesmundo, Purnata Ghosal, Christian Ikenmeyer, Vladimir Lysikov |
Degree-Restricted Strength Decompositions and Algebraic Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India., pp. 20:1-20:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-261-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
1 | Suryajith Chillara |
Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 14:1-14:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Benedikt Bollig, Arnaud Sangnier, Olivier Stietel |
Local First-Order Logic with Two Data Values. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 39:1-39:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Yang Du, Ilya Volkovich |
Approximating the Number of Prime Factors Given an Oracle to Euler's Totient Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 17:1-17:10, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Diptarka Chakraborty, Kshitij Gajjar, Agastya Vibhuti Jha |
Approximating the Center Ranking Under Ulam. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 12:1-12:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Christopher Hugenroth |
Separating Regular Languages over Infinite Words with Respect to the Wagner Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 46:1-46:13, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Liam Jordon, Philippe Moser |
Normal Sequences with Non-Maximal Automatic Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 47:1-47:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Eric Allender, Mahdi Cheraghchi, Dimitrios Myrisiotis, Harsha Tirumala, Ilya Volkovich |
One-Way Functions and a Conditional Variant of MKTP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 7:1-7:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Raveendra Holla, Nabarun Deka, Deepak D'Souza |
On the Expressive Equivalence of TPTL in the Pointwise and Continuous Semantics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 45:1-45:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
1 | Andre Esser 0001, Robert Kübler, Floyd Zweydinger |
A Faster Algorithm for Finding Closest Pairs in Hamming Metric. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 20:1-20:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|