yusuke1997/dblp-id-title huggingface dataset:
Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds
Rabin vs. Streett Automata
Foundations of Software Technology and Theoretical Computer Science, 13th Conference, Bombay, India, December 15-17, 1993, Proceedings
Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings
Symbolic Solving of Extended Regular Expression Inequalities
Design and Implementation for a Procedural VLSI Layout
The Quantitative Linear-Time--Branching-Time Spectrum
Improved Bounds on the Union Complexity of Fat Objects
On Parallel Complexity of Planar Triangulations
Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names
The Complexity of Rebalancing a Binary Search Tree
Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time
Higher-Order Nonemptiness Step by Step
Weak Bisimulation and Model Checking for Basic Parallel Processes
An Introduction to Decidability of DPDA Equivalence
Reachability in Concurrent Uninterpreted Programs
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs
Decidability Results on the Existence of Lookahead Delegators for NFA
Recursion Versus Iteration at Higher-Orders
Mediating for Reduction (on Minimizing Alternating Büchi Automata)
Parameterized Algorithms for List K-Cycle
PDQMA = DQMA = NEXP: QMA with Hidden Variables and Non-Collapsing Measurements
Uniformly Automatic Classes of Finite Structures
Tunable Online MUS/MSS Enumeration
Non-disclosure for Distributed Mobile Code
VLSI Systems For Design Rule Checks
On Infinite Words Determined by Stack Automata
Paraconsistent Logic Programming
Semidefinite Programming Based Approximation Algorithms
Pruning 2-Connected Graphs
Verification of Large Software Systems
Algebraic Properties of The Space of Multivalued and Paraconsistent Logic Programs
Reasoning about Infinite State Systems Using Boolean Methods
Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18-20, 1992, Proceedings
Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
On the Hardness of Approximating Minimum Monopoly Problems
Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width
Testing Probabilistic Equivalence Through Reinforcement Learning
Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common Subsequence
Fréchet Distance Between a Line and Avatar Point Set
Colored Hypergraph Isomorphism is Fixed Parameter Tractable
Synthesis of Finite-state and Definable Winning Strategies
Parikh Images of Register Automata
An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix
Matchings in Low-Arboricity Graphs in the Dynamic Graph Stream Model
Computing a Center-Transversal Line
Lipschitz Robustness of Finite-state Transducers
Streaming Algorithms for Geometric Problems
Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk)
Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1
Equivalence of Hidden Markov Models with Continuous Observations
Natural Colors of Infinite Words
The Parikh Property for Weighted Context-Free Grammars
Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem
Deadlock Sensitive Types for Lambda Calculus with Resources
Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints
Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size
Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition
Resilience of Timed Systems
Recognizable Infinite Tree Sets and their Complexity
Bundled Fragments of First-Order Modal Logic: (Un)Decidability
Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models: Extended Abstract
Maintaining Reeb Graphs of Triangulated 2-Manifolds
On the Semantics of Optimization Predicates in CLP Languages
New Characterizations of Core Imputations of Matching and b-Matching Games
Popular Matchings with Multiple Partners
Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks
A Cubic-Vertex Kernel for Flip Consensus Tree
Hennessy-Plotkin-Brookes Revisited
A Perfect-Information Construction for Coordination in Games
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound
Optimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition Errors
A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares)
Kolmogorov Complexity in Randomness Extraction
Local Testing for Membership in Lattices
Moderately Hard Functions: From Complexity to Spam Fighting
Parameterized Complexity of Fixed Variable Logics
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
Probabalistic Quantifiers vs. Distrustful Adversaries
The Expressive Power of Indeterminate Primitives in Asynchronous Computation
VLSI Systems For Matrix Multiplication
Generalising Automaticity to Modal Properties of Finite Structures
Most Likely Voronoi Diagrams in Higher Dimensions
FO-Definable Transformations of Infinite Strings
The Combinatorics of Non-determinism
Increasing the power of the verifier in Quantum Zero Knowledge
Capacitated k-Center Problem with Vertex Weights
Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks
Information Leakage of Non-Terminating Processes
Approximation Algorithms for Wavelength Assignment
Regular Languages, Unambiguous Concatenation and Computational Complexity
Leaf languages and string compression
A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications
Parallel Complexity of Geometric Bipartite Matching
Implementing Realistic Asynchronous Automata
An Epistemic Foundation for Logic Programming with Uncertainty
Learning Partitions Using Rank Queries
Models for Re-Use
Data-Independences of Parallel Random Access Machines
On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
Connectivity Algorithms Using Rubber-bands
Hunting for Functionally Analogous Genes
Automata, Games, and Positive Monadic Theories of Trees
Finding Independent Sets in Unions of Perfect Graphs
The Power and Limitations of Uniform Samples in Testing Properties of Figures
Pattern Matching in Compressed Texts
Nash Equilibria of Two-Player Matrix Games Repeated Until Collision
Concrete Categorical Model of a Quantum Circuit Description Language with Measurement
Clustering in Varying Metrics
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound
No, Coreset, No Cry
Computationally Sound Abstraction and Verification of Secure Multi-Party Computations
Simple Priced Timed Games are not That Simple
Randomized Approximation Algorithms in Combinatorial Optimization
BRICS and Quantum Information Processing
Synthesis in Distributed Environments
The Complexity of Quantitative Information Flow in Recursive Programs
On Optimal Parallelization of Sorting Networks
Logical Specification and Implementation
Reasoning About Game Equilibria Using Temporal Logic
Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences
Subdividing Alpha Complex
Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number
Representable Disjoint NP-Pairs
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound
A Graphic Language Based on Timing Diagrams
Balanced Judicious Bipartition is Fixed-Parameter Tractable
On Fair Division for Indivisible Items
Cyclic Proofs and Jumping Automata
Unifying Asynchronous Logics for Hyperproperties
Super-Fast 3-Ruling Sets
On the Expressiveness of TPTL and MTL
PTAS for Ordered Instances of Resource Allocation Problems
Jumping Automata for Uniform Strategies
Rewriting Logic as a Metalogical Framework
One-Counter Stochastic Games
An Algebraic Compositional Semantics of an Object Oriented Notation with Concurrency
Reuse of Proofs in Software Verification
Convexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk)
Fractional Pebbling and Thrifty Branching Programs
On the Greedy Superstring Conjecture
On Hashing-Based Approaches to Approximate DNF-Counting
A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol
Reachability for Two-Counter Machines with One Test and One Reset
On Ambiguity of DTOL Systems
On Decidability of LTL Model Checking for Process Rewrite Systems
Synthesis of Safe Message-Passing Systems
Token Sliding Independent Set Reconfiguration on Block Graphs
Defining Process Fairness for Non-Interleaving Concurrency
Average Case Complexity Analysis of RETE Pattern-Match Algorithm and Average Size of Join in Database
Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices
Semiperfect-Information Games
Incremental Algorithms for Constraint Solving and Entailment over Rational Trees
Randomized Parallel Selection
Benefits of Tree Transducers for Optimizing Functional Programs
Bounding Messages for Free in Security Protocols
An Efficient Distributed Algorithm for Finding Articulation Points, Bridges, and Biconnected Components in Asynchronous Networks
Parallel Parsing on a One-way Linear Array of Finite-State Machines
Preemption in Concurrent Systems
Finer Separations Between Shallow Arithmetic Circuits
Extending Temporal Logics with Data Variable Quantifications
Safely Freezing LTL
Normal and Feature Approximations from Noisy Point Clouds
Oblivious Complexity Classes Revisited: Lower Bounds and Hierarchies
Space Efficient Suffix Trees
Equational Axiomatization of Bicoercibility for Polymorphic Types
Rumors Across Radio, Wireless, Telephone
On the Roots of Independence Polynomial: Quantifying the Gap
Proximity Problems and the Voronoi Diagram an a Rectilinear Plane with Rectangular Obstacles
On the Interplay of Cube Learning and Dependency Schemes in {QCDCL} Proof Systems
Tight Chang's-Lemma-Type Bounds for Boolean Functions
Iterating Non-Aggregative Structure Compositions
GHC - A Language for a New Age of Parallel Programming
Complexity of the Gravitational Method for Linear Programming
Bounded Simultaneous Messages
Many Flavors of Edit Distance
Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas
Component-Based Construction of Deadlock-Free Systems: Extended Abstract
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures
First-order Definable String Transformations
Testing Geometric Convexity
On the Confluence of Trace Rewriting Systems
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
Improved Upper Bounds on Multiflow-Multicut Gaps in Cactus Graphs
An Explanation of Splaying
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space
Obtaining a Bipartite Graph by Contracting Few Edges
Side Channel Analysis Using a Model Counting Constraint Solver and Symbolic Execution (Invited Talk)
Reinforcement Planning for Effective ε-Optimal Policies in Dense Time with Discontinuities
A Framework for Intelligent Backtracking in Logic Programs
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs
Büchi Good-for-Games Automata Are Efficiently Recognizable
Automata and temporal logic over arbitrary linear time
Approximate Determinization of Quantitative Automata
Zero Error List-Decoding Capacity of the q /( q -1) Channel
Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference), December 14-18, 2020
A Class of Rational Trace Relations Closed Under Composition
Dependency Matrices for Multiplayer Strategic Dependencies
Maintenance of Multidimensional Histograms
Approximate Maximum Rank Aggregation: Beyond the Worst-Case
Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings
Pushdown Games with Unboundedness and Regular Conditions
Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four
Using Elimination Theory to construct Rigid Matrices
No Coreset, No Cry: II
How Computer Science Informs Modern Auction Design (Invited Talk)
What's Decidable about Availability Languages?
Perfect Matchings and Popularity in the Many-To-Many Setting
A new upper bound for 3-SAT
Comparing Labelled Markov Decision Processes
The Power of Depth 2 Circuits over Algebras
Two Views on Unification: Terms as Strategies
A Semantic Theory for Heterogeneous System Design
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, Chennai, India, December 13-15, 2016
Weighted One-Deterministic-Counter Automata
Decidability in the Logic of Subsequences and Supersequences
Relation Level Semantics
Faster Property Testers in a Variation of the Bounded Degree Model
Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees
Computational Complexity Since 1980
Generalized Temporal Verification Diagrams
A Linear-Time Recognition Algorithm for P 4 -Reducible Graphs
A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs
Quasi-Random PCP and Hardness of 2-Catalog Segmentation
Verifying Probabilistic Procedural Programs
Hardness of Learning Boolean Functions from Label Proportions
Train Scheduling on a Unidirectional Path
Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic Study
Binary Decompositions and Acyclic Schemes
The Complexity of Separation for Levels in Concatenation Hierarchies
Propositional Dynamic Logic for Message-Passing Systems
Complete Problems Involving Boolean Labelled Structures and Projections Translations
Optimal Parallel Algorithms on Circular-Arc Graphs
The Complexity of Computing over Quasigroups
Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents
Recent Developments in the Theory of Arrangements of Surfaces
Computing Reachability Properties Hidden in Finite Net Unfoldings
My Favorite Ten Complexity Theorems of the Past Decade
Local Versus Non-local Computation of Length of Digitized Curves
Discriminant Circumscription
Network Construction with Ordered Constraints
Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings
Strong Parameterized Deletion: Bipartite Graphs
On Estimation Algorithms vs Approximation Algorithms
A Look-Ahead Interpreter for Sequential Prolog and Its Implementation
38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, Ahmedabad, India, December 11-13, 2018
Listing 4-Cycles
Model Checking and Satisfiability for Sabotage Modal Logic
Probabilistic Mu-Calculus: Decidability and Complete Axiomatization
Regular Separators for VASS Coverability Languages
On Weighted Bipartite Edge Coloring
Synchronized CTL over One-Counter Automata
New Lower Bounds for Reachability in Vector Addition Systems
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
Symbolic Approximation of Weighted Timed Games
Testing Processes for Efficiency
A Proof System for Communicating Processes with Value-passing (Extended Abstract)
Graph Decompositions and Algorithms (Invited Talk)
Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy
Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete
Metaconfluence of Calculi with Explicit Substitutions at a Distance
Optimal Regular Tree Pattern Matching Using Pushdown Automata
Coloring Semi-Random Graphs in Polynomial Expected Time
Solving a Unification Problem under Constrained Substitutions Using Tree Automata
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs
A graph polynomial for independent sets of bipartite graphs
New bounds on the classical and quantum communication complexity of some graph properties
On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities
Probabilistic Disclosure: Maximisation vs. Minimisation
Matchings, Critical Nodes, and Popular Solutions
Verification of Asynchronous Programs with Nested Locks
Popular Matchings in Complete Graphs
Quasi-Weak Cost Automata: A New Variant of Weakness
Reasoning About Strategies
Quantum Sabotage Complexity
Transformations of Boolean Functions
Verified Analysis of List Update Algorithms
Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
A Conservative Extension of First-order Logic and Its Application to Theorem Proving
Probabilistic and Topological Semantics for Timed Automata
An Efficient Parallel Algorithm for Term Matching
Indistinguishability Obfuscation from Well-Founded Assumptions (Invited Talk)
Approximation Algorithms for Stochastic k-TSP
Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems
The Complexity of Counting Models of Linear-time Temporal Logic
The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk)
Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables
Ranking with Diverse Intents and Correlated Contents
Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization
On Parallel Sorting and Addition with Concurrent Writes
Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids
Proof Rules for Communication Abstractions (Abstract)
On Some Recent Advances in Algebraic Complexity (Invited Talk)
The Cayley-Graph of the Queue Monoid: Logic and Decidability
Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption
The Engineering of some Bipartite Matching Programs
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
BQP After 28 Years (Invited Talk)
Relational Refinement Types for Higher-Order Shape Transformers (Invited Talk)
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
A Lifting Theorem with Applications to Symmetric Functions
Physical limits of Communication (Invited Talk)
Linear Broadcast Routing
Winskel is (Almost) Right: Towards a Mechanized Semantics Textbook
Synthesising Full-Information Protocols
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, Mumbai, India, December 12-14, 2011
On the Complexity of Certified Write All Algorithms
Bandwidth of Timed Automata: 3 Classes
A Generalization of the Parikh Vector for Finite and Infinite Words
On Approximation Scheme Preserving Reducability and Its Applications
Properties and Utilization of Capacitated Automata (Invited Talk)
Parameterized Communicating Automata: Complementation and Model Checking
Summaries for Context-Free Games
Series and Parallel Operations on Pomsets
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings
Model Checking of Probabalistic and Nondeterministic Systems
On the (Parameterized) Complexity of Almost Stable Marriage
Sketching Graphs and Combinatorial Optimization (Invited Talk)
A Proof Technique for Register Automicity
A Natural Deduction treatment of Operational Semantics
On the Probabilistic Degree of OR over the Reals
The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk)
When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?
Cat Herding Game Played on Infinite Trees
A Finer View of the Parameterized Landscape of Labeled Graph Contractions
Dependence logic with a majority quantifier
Higher order indexed monadic systems
On the Structure and Complexity of Rational Sets of Regular Languages
C-sensitive Triangulations Approximate the MinMax Length Triangulation
On the Complexity of Bisimilarity for Value-Passing Processes (Extended Abstract)
Efficient Parallel Algorithms for Optical Computing with the DFT Primitive
Approximating the Regular Graphic TSP in Near Linear Time
On the Complexity of Computing Maximum Entropy for Markovian Models
Perspective Games with Notifications
Adventures in Bidirectional Programming
On the VNP-Hardness of Some Monomial Symmetric Polynomials
Non-Uniform Proof System: A New Framework to Describe Non-Uniform and Probabalistic Complexity Classes
Complexity of Spatial Games
Efficient Approximation of Optimal Control for Continuous-Time Markov Games
Optimal Strategies in Priced Timed Game Automata
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error
Erdös Magic
A Symbolic Framework to Analyse Physical Proximity in Security Protocols
Special tree-width and the verification of monadic second-order graph pr operties
Efficient Algorithms for Morphisms over Omega-Regular Languages
Circuits, Proofs and Propositional Model Counting
Domination Problems in Nowhere-Dense Classes
Counterfactual Explanations for MITL Violations
Recognition and Top-Down Generation of beta-Acyclic Database Schemes
Algenraic Operational Semantics
Key Substitution in the Symbolic Analysis of Cryptographic Protocols
An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks
Decision Tree Complexity Versus Block Sensitivity and Degree
Active Prediction for Discrete Event Systems
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
Incremental Algorithms for the Single-Source Shortest Path Problem
New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity
Algorithms and Hardness Results for Computing Cores of Markov Chains
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs
Higher-Order and Semantic Unification
Stringent Relativization
On Some Largest Empty Orthoconvex Polygons in a Point Set
VLDL Satisfiability and Model Checking via Tree Automata
Execution-Time Opacity Problems in One-Clock Parametric Timed Automata
Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, Bombay, India, December 11-13, 2019
On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
Decidability of MSO Theories of Tree Structures
The Sensing Cost of Monitoring and Synthesis
Optimizing Join Queries in Distributed Database
34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, New Delhi, India, December 15-17, 2014
The Ground Congruence for Chi Calculus
On the Undecidability of some Sub-Classical First-Order Logics
Stable Matchings with One-Sided Ties and Approximate Popularity
Mechanized Formal Methods: Progress and Prospects
Additive Word Complexity and Walnut
Minimum Weight Pseudo-Triangulations
Deductive Verification of Continuous Dynamical Systems
Romeo and Juliet Meeting in Forest like Regions
A Domain-Specific Language for Computing on Encrypted Data (Invited Talk)
A Dichotomy Theorem for the Inverse Satisfiability Problem
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers
Beyond Regular Model Checking
An Introduction to the Theory of Linear Integer Arithmetic (Invited Paper)
Quantum Protocols for Rabin Oblivious Transfer
Text Sparsification via Local Maxima
Beyond Decisiveness of Infinite Markov Chains
Communication Interference in Mobile Boxed Ambients
Dynamic Spectrum Allocation: The Impotency of Duration Notification
Distributed Resource Sharing in Computer Networks