The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "FSTTCS"( http://dblp.L3S.de/Venues/FSTTCS )

URL (DBLP): http://dblp.uni-trier.de/db/conf/fsttcs

Publication years (Num. hits)
1984 (30) 1985 (29) 1986 (32) 1987 (37) 1988 (34) 1989 (28) 1990 (31) 1991 (29) 1992 (32) 1993 (39) 1994 (37) 1995 (36) 1996 (33) 1997 (24) 1998 (35) 1999 (37) 2000 (43) 2001 (29) 2002 (32) 2003 (39) 2004 (44) 2005 (46) 2006 (39) 2007 (46) 2008 (38) 2009 (41) 2010 (45) 2011 (46) 2012 (50) 2013 (47) 2014 (55) 2015 (50) 2016 (52) 2017 (48) 2018 (51) 2019 (53) 2020 (60) 2021 (54) 2022 (46) 2023 (45)
Publication types (Num. hits)
inproceedings(1582) proceedings(40)
Venues (Conferences, Journals, ...)
FSTTCS(1622)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 162 occurrences of 145 keywords

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