yusuke1997/dblp-id-title huggingface dataset:
Learning Classes of Regular and Linear Languages in Valiant's Learnability Framework
Global Escape in Multiparty Sessions
Ordered Tree-Pushdown Systems
Backward Deterministic Büchi Automata on Infinite Words
A Composition Theorem for Randomized Query Complexity
Randomizing Reductions of Search Problems
Hard Sets and Pseudo-random Generators for Constant Depth Circuits
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture
Priority and Abstraction in Process Algebra
Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract)
On Mapping Cube Graphs onto VLSI Arrays
Combining Semantics with Non-standard Interpreter Hierarchies
The Price of Local Power Control in Wireless Scheduling
The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable
Expected Window Mean-Payoff
A Combinatorial Proof of Ihara-Bass's Formula for the Zeta Function of Regular Graphs
An O(n²) Algorithm for Fan-Out Free Query Optimization
Solvency Markov Decision Processes with Interest
Notes on Counting with Finite Machines
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems
New Protocols for the Election od a Leader in a Ring
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
Popular Roommates in Simply Exponential Time
Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract)
Interval Temporal Logic for Visibly Pushdown Systems
An Autoepistemic Logical View of Knowledge Base
Refinement and Composition of Transition-based Rely-Guarantee Specification with Auxiliary Variables
Weighted Strategy Logic with Boolean Goals Over One-Counter Games
A Provably Correct Sampler for Probabilistic Programs
Symmetric Synthesis
Fixpoint Logics on Hierarchical Structures
Intersection Types for Normalization and Verification (Invited Talk)
Reachability in Dynamical Systems with Rounding
On the Expressiveness of Multiparty Sessions
A Distributed Algorithm for Edge-Disjoint Path Problem
Layer Systems for Proving Confluence
Computable Analysis for Verified Exact Real Computation
Linear-Time Temporal Logic with Team Semantics: Expressivity and Complexity
Streamability of Nested Word Transductions
Density Functions subject to a Co-Matroid Constraint
On Reduction-Based Semantics
An Algebra for XML Query
Thresholds and Optimal Binary Comparison Search Trees
Safe and Optimal Scheduling for Hard and Soft Tasks
Complexity Results for 1-safe Nets
Clustering on Sliding Windows in Polylogarithmic Space
The Design and Regulation of Exchanges: A Formal Approach
Advocating Ownership
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension
Nonnegative Rank Measures and Monotone Algebraic Branching Programs
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average
Pinpointing Computation with Modular Queries in the Boolean Hierarchy
Hoare-Style Compositional Proof Systems for Reactive Shared Variable Concurency
Exponential Space Improvement for minwise Based Algorithms
Near-Optimal Cayley Expanders for Abelian Groups
Hardness of Finding Kings and Strong Kings
Towards a CTL* Tableau
Parallel Algorithms for Approximate Edge Colouring of Simple graphs
Algorithmic Combinatorics Based on Slicing Posets
Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases
Harmonic Algorithms for Packing d-Dimensional Cuboids into Bins
Properties of Distributed Timed-Arc Petri Nets
Expressiveness of streaming string transducers
Quantum Computation and Information
A New Linear Algorithm for the Two Path Problem on Chordal Graphs
Planted Models for k-Way Edge and Vertex Expansion
Synthesis from Weighted Specifications with Partial Domains over Finite Words
Partiality and Approximation Schemes for Local Consistency in Networks of Constraints
Approximating Fault-Tolerant Group-Steiner Problems
Extension of Weakest Precondition Formalism to a Low Level Language
Kernels for Feedback Arc Set In Tournaments
Rainbow Connectivity: Hardness and Tractability
Verification of Timed Asynchronous Programs
An Optimal Algorithm for Sorting in Trees
Verification of Open Interactive Markov Chains
Ambiguity Through the Lens of Measure Theory
Minimal Relative Normalization in Orthogonal Expression Reduction Systems
Dynamics on Games: Simulation-Based Techniques and Applications to Routing
Acyclic Petri and Workflow Nets with Resets
Arithmetic Circuits and the Hadamard Product of Polynomials
Parallel Complexity of Depth-First-Search and Maximal Path in Restricted Graph Classes
Scheduling to Minimize the Average Completion Time of Dedicated Tasks
Continuous Algorithms (Invited Paper)
Schema Mappings and Data Examples: Deriving Syntax from Semantics (Invited Talk)
On Parity Decision Trees for Fourier-Sparse Boolean Functions
Solving the Lagrangian Dual when the Number of Constraints is Fixed
A Distributed Algorithm to Implement N-Party Rendevouz
Scheduling Resources for Executing a Partial Set of Jobs
Property B: Two-Coloring Non-Uniform Hypergraphs
Advances in Algorithmic Meta Theorems (Invited Paper)
Temporal Logics on Words with Multiple Data Values
The Power of Collision: Randomized Parallel Algorithms for Chaining and Integer Sorting
A Zone-Based Algorithm for Timed Parity Games
Branching Automata and Pomset Automata
Concurrent Runtime Checking of Annotated Ada Programs
Range Allocation for Equivalence Logic
Maximum-Area Rectangles in a Simple Polygon
On the Inner Product Predicate and a Generalization of Matching Vector Families
Phase Semantics for Linear Logic with Least and Greatest Fixed Points
Subexponential Algorithms for Partial Cover Problems
Semilinear Representations for Series-Parallel Atomic Congestion Games
Reasoning in Systems of Equations and Inequations
On Approximation Resistance of Predicates (Invited Talk)
Acceleration in Convex Data-Flow Analysis
On the Parameterized Complexity of [1, j]-Domination Problems
Randomized Black-Box PIT for Small Depth +-Regular Non-Commutative Circuits
Some Recent Applications of Knowledge
Axioms for Regular Words: Extended Abstract
Approximately Counting Graph Homomorphisms and Retractions (Invited Talk)
Is the Standard Proof System for SAT P-Optimal?
On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas
Inference Systems for Logical Algorithms
All-Norms and All-L_p-Norms Approximation Algorithms
A Characterization of Asynchronous Message-Passing
Parameterized Dynamic Cluster Editing
Counting and Sampling from Substructures Using Linear Algebraic Queries
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes
Scheduling in the Secretary Model
Reasoning About Distributed Systems: WYSIWYG (Invited Talk)
From Logic to Games
Verification of Open Systems
Iterative Methods in Combinatorial Optimization
Cost-Parity and Cost-Streett Games
Fault-Tolerant Approximate Distance Oracles with a Source Set
New Results on Quantum Property Testing
Monitoring for Silent Actions
On Sampled Semantics of Timed Systems
A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words
Fixed Points of Büchi Automata
More Verifier Efficient Interactive Protocols for Bounded Space
Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems
Fast Sequential and Randomised Parallel Algorithms for Rigidity and approximate Min k-cut
Game Semantics for Higher-Order Concurrency
On the Hardness of Order Finding and Equivalence Testing for ROABPs
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
Computations in Undistinguished Networks
Multiple-Environment Markov Decision Processes
Solving Connected Dominating Set Faster Than 2 n
Average-Time Games
Bisimilarity of Probabilistic Pushdown Automata
Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties
A new approach to the planted clique problem
Width Notions for Ordering-Related Problems
Beyond Matrix Completion (Invited Talk)
Quantum State Description Complexity (Invited Talk)
Largest Similar Copies of Convex Polygons in Polygonal Domains
The Fine Structure of Game Lambda Models
The Isomorphism Problem of Power Graphs and a Question of Cameron
Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem
Soundness and Completeness of UNITY Logic
Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets
Hardness of Rainbow Coloring Hypergraphs
On the Expressive Power of CCS
Relativised Cellular Automata and Complexity Classes
List Decoding from Erasures: Bounds and Code Constructions
DLOGTIME Proof Systems
Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements
System Specification and Refinement in Temporal Logic
Scheduling of Hard Real-Time Systems
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace
History Determinism vs. Good for Gameness in Quantitative Automata
Reasoning About Linear Constraints Using Parametric Queries
Local First-Order Logic with Two Data Values
An Abstract Interpretation Scheme for Groundedness, Freeness, and Sharing Analysis of Logic Programs
A Decomposition Approach to the Weighted k-Server Problem
ATL with Strategy Contexts: Expressiveness and Model Checking
Adjunct Elimination Through Games in Static Ambient Logic
Smooth Surfaces for Multi-Scale Shape Representation
Algorithms, Games, and Evolution (Invited Talk)
Foundations of Software Technology and Theoretical Computer Science, 14th Conference, Madras, India, December 15-17, 1994, Proceedings
Dynamic matrix rank with partial lookahead
Energy Efficient Scheduling and Routing via Randomized Rounding
A New Method for Proving Termination of AC-Rewrite Systems
Verification and Refutation of Probabilistic Specifications via Games
PROLOG-Based Inductive Theorem Proving
On the Covering Steiner Problem
Fast and Exact Convex Hull Simplification
Reachability Analysis of Multithreaded Software with Asynchronous Communication
Cutoff for the Swendsen-Wang Dynamics on the Complete Graph
On Fair and Efficient Allocations of Indivisible Public Goods
2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
A Fast Parallel Algorithm for Finding a Maximal Bipartite Set
2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds
Exact and Approximate Digraph Bandwidth
The Degree of a Finite Set of Words
Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model
Static Analysis for Checking Data Format Compatibility of Programs
Developments in Data Structure Research During the First 25 Years of FSTTCS
Understanding Cutting Planes for QBFs
Widths of Regular and Context-Free Languages
Model Checking CTL Properties of Pushdown Systems
Program Checking
Constraint Reaction in FD
Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
AC-Equation Solving
Synchronizing Words for Weighted and Timed Automata
Accelerating tree-automatic relations
Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches
A Mechanically Verified Compiling Specification for a Lisp Compiler
Approximate Range Searching Using Binary Space Partitions
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, Guwahati, India, December 12-14, 2013
Improved Approximation for Pathwidth One Vertex Deletion and Parameterized Complexity of Its Variants
The update complexity of selection and related problems
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
Continuous Optimization: The "Right" Language for Graph Algorithms? (Invited Talk)
Explicit Representation of Terms Defined by Counter Examples
One Time-traveling Bit is as Good as Logarithmically Many
Communication Complexity of Equality and Error-Correcting Codes
Simple Invariants for Proving the Safety of Distributed Protocols (Invited Talk)
Foundations of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings
Optimal Output Sensitive Fault Tolerant Cuts
Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT
Planar Graph Blocking for External Searching
A General Framework for Types in Graph Rewriting
On the Pseudoperiodic Extension of u^l = v^m w^n
Extending the Limits of Sequentially Phased Reasoning
Toward a Grainless Semantics for Shared-Variable Concurrency
Generalizing the powerset construction, coalgebraically
Convex Optimization and Dynamic Data Structure (Invited Talk)
Generating Plans in Linear Logic
Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse Polynomials
On the Power of Imperfect Information
Parameterized Verification of Many Identical Probabilistic Timed Processes
Fall-Through Semantics for Mitigating Timing-Based Side Channel Leaks
Towards a Theory of Commonsense Visual Reasoning
Pattern Matching for Arc-Annotated Sequences
On Nondeterministic Unranked Tree Automata with Sibling Constraints
Single-Sink Network Design with Vertex Connectivity Requirements
The Anatomy of Innocence Revisited
On the Calling Behaviour of Procedures
On Synthesizing Systolic Arrays from Recurrence Equations with Linear Dependencies
Inheritance in the Join Calculus
On Improved Degree Lower Bounds for Polynomial Approximation
Randomly-oriented k-d Trees Adapt to Intrinsic Dimension
On the Limitations of Locally Robust Positive Reductions
Optimal Constructions for Active Diagnosis
Degrees of Second and Higher-Order Polynomials
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
Computing Information Flow Using Symbolic Model-Checking
Improved Linearly Ordered Colorings of Hypergraphs via SDP Rounding
Symbolic Bisimulation for the Applied Pi Calculus
Recent Progress and Open Problems in Algorithmic Convex Geometry
Generalized Data Automata and Fixpoint Logic
A Decidable Dense Branching-Time Temporal Logic
Output-Sensitive Pattern Extraction in Sequences
Obseving Behaviour Categorically
Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design
The MSO Theory of Connectedly Communicating Processes
Process Specification of Logic Programs
The Deduction Theorem for Strong Propositional Proof Systems
On Approximability of the Independent/Connected Edge Dominating Set Problems
Modal Strength Reduction in Quantified Discrete Duration Calculus
Algebraic and Operational Semantics of Positive/Negative Conditional Algebraic Specification
Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation
Refining the Undecidability Frontier of Hybrid Automata
An Abductive Semantics for Disjunctive Logic Programs and Its Proof Procedure
Hard QBFs for Merge Resolution
Recursively Defined Domains and Their Induction Principles
Model Checking Algol-Like Languages Using Game Semantics
Test Generation Using Symbolic Execution
Model Checking Randomized Security Protocols (Invited Paper)
Approximation Through Local Optimality: Designing Networks with Small Degree
Boolean algebras of unambiguous context-free languages
Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery Using Drones
Context-Sensitive Dependency Pairs
Satisfiability of Algebraic Circuits over Sets of Natural Numbers
A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation
Constructing Faithful Homomorphisms over Fields of Finite Characteristic
A 5-Approximation for Universal Facility Location
An Optimal Deterministic Algorithm for Online b-Matching
The Algebraic Cost of a Boolean Sum
Coresets for Discrete Integration and Clustering
On-Line Edge-Coloring with a Fixed Number of Colors
On Sampling Based Algorithms for k-Means
Languages of Words of Low Automatic Complexity Are Hard to Compute
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case
Branch and Bound on the Network Model
Distributed Reset (Extended Abstract)
The Tree-Generative Capacity of Combinatory Categorial Grammars
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)
Immediate Fixpoints and Their Use in Groundness Analysis
Hierarchical Refinement Of A Z Specification
On the Problem of Computing the Probability of Regular Sets of Trees
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
Robust Proximity Search for Balls Using Sublinear Space
Branching Rules for Satisfiability (Extended Abstract)
Protecting Facets in Layered Manufacturing
On Parallel Evaluation of Classes of Circuits
Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS
Shrinking Timed Automata
Simulation Over One-counter Nets is PSPACE-Complete
45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2025, BITS Pilani, K K Birla Goa Campus, India, December 17-19, 2025
Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice
A Condition for the Three Colourability of Planar Locally Path Graphs
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
A Complete System for SCCS with Modal Assertions
Formal Verification of an O. S. Submodule
Asymptotically Optimal Encodings for Range Selection
An ETH-Tight Algorithm for Multi-Team Formation
Dimension, Pseudorandomness and Extraction of Pseudorandomness
Computing a Viewpoint of a Set of Points Inside a Polygon
Overlap of Convex Polytopes under Rigid Motion
Lower Bounds for Semi-adaptive Data Structures via Corruption
A Theory for Game Theories
A Distributed Algorithm for Detecting Communication Deadlocks
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings
Towards Better Separation between Deterministic and Randomized Query Complexity
Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing
Complexity of Algebraic Specification
Parameterized Complexity of Incomplete Connected Fair Division
Minimum Enclosing Circle with Few Extra Variables
Foundations of Software Technology and Theoretical Computer Science, 16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings
Place-Boundedness for Vector Addition Systems with one zero-test
STCON in Directed Unique-Path Graphs
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks
Parikh Automata over Infinite Words
Weak Consistency Of Read-only Transactions: A Tool to Improve Concurrency in Heterogeneous Locking Protocols
Depth-3 Arithmetic Circuits for S n 2 (X) and Extensions of the Graham-Pollack Theorem
Improving the Results of Static Analyses Programs by Local Decreasing Iteration
Scalable Learning of One-Counter Automata via State-Merging Algorithms
Distributed Synthesis for Acyclic Architectures
On the Succinctness of Alternating Parity Good-For-Games Automata
Characterizing NC¹ with Typed Monoids
On the NP-Completeness of the Minimum Circuit Size Problem
Explorability in Pushdown Automata
Control Improvisation
Efficient on-line algorithm for maintaining k-cover of sparse bit-strings
Reasoning About Quantum Knowledge
Parameterized Algorithms for Deletion to (r, ell)-Graphs
Complexity of Liveness in Parameterized Systems
Querying Regular Languages over Sliding Windows
Energy-Time Trade-offs in VLSI Computation
Recovery of Noncurrent Variables in Source-Level Debugging of Optimized Code
Renting a Cloud
Online Piercing of Geometric Objects
Some Observations on 2-way Probabilistic Finite Automata
Certifying polynomials for AC^0(parity) circuits, with applications
A New Class of High Level Programs for Distributed Computing Systems
Sample-And-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model
Algorithms for Game Metrics
Computationally Complete Symbolic Attacker in Action
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison
43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, IIIT Hyderabad, Telangana, India, December 18-20, 2023
Efficient Algorithms for Domination and Hamilton Circuit Problems on Permutation Graphs
On the Hardness of Approximating Distances of Quantum Codes
Lower Bounds for the Average and Smoothed Number of Pareto Optima
On the Design of Hybrid Control Systems Using Automata Models
Refinement and Separation Contexts
Degrees of Ambiguity of Büchi Tree Automata
Degrees of Non-Determinism and Concurrency: A Petri Net View
On Optimal Parallel Algorithm for Sorting Presorted Files
The Complexity of the Local Hamiltonian Problem
An Axiomatization of Event Structures
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number
Weighted Tiling Systems for Graphs: Evaluation Complexity
Two-Way Parikh Automata
My O Is Bigger Than Yours (Invited Talk)
Bisimulation Quantified Logics: Undecidability
A Proof Technique for Rely/Guarantee Properties
Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions
Algorithmic Improvisation for Dependable Intelligent Autonomy (Invited Talk)
On Continuous Timed Automata with Input-Determined Guards
Approximating Petri Net Reachability Along Context-free Traces
On Canonical Models for Rational Functions over Infinite Words
Algorithms for Non-uniform Size Data Placement on Parallel Disks
Extending Propositional Separation Logic for Robustness Properties
Learning Mixtures of Distributions over Large Discrete Domains
Interpreter Verification for a Functional Language
Concurrent Parameterized Games
Synchronization Under Dynamic Constraints
On Symbolic Heaps Modulo Permission Theories
A Correct by Construction Fault Tolerant Voter for Input Selection of a Control System
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
Constant-Space String-Matching
Randomness extractors -- applications and constructions
Optimally Representing Euclidean Space Discretely for Analogically Simulating Physical Phenomena
Foundation of Diagnosis and Predictability in Probabilistic Systems
New Developments in Iterated Rounding (Invited Talk)
Replacement in Monotone Boolean Networks: An Algebraic Perspective
A Categorical Account of Replicated Data Types
On the Expressive Equivalence of TPTL in the Pointwise and Continuous Semantics
Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version)
When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT
Characterization of the Principal Type of Normal Forms in an Intersection Type System
Retrospection on the Compiler Structure
Computing the Order of a Locally Testable Automaton
Regulating Synchronous Data Exchange to Meet Control Flow and Data Specifications
Modular Synthesis of Deadlock-Free Control Structures
Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems
The Quest for Mathematical Understanding of Deep Learning (Invited Talk)
Foundations of Software Technology and Theoretical Computer Science, 20th Conference, FST TCS 2000 New Delhi, India, December 13-15, 2000, Proceedings
Distance Between Mutually Reachable Petri Net Configurations
The Non-Recursive Power of Erroneous Computation
Compact Location Problems
Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms
New Verification Schemes for Frequency-Based Functions on Data Streams
On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions
The Complexity of a Counting Finite-State Automaton
Fast Exponential Algorithms for Maximum r -Regular Induced Subgraph Problems
Average Stack Cost of Büchi Pushdown Automata
Constructions of Sparse Asymmetric Connectors: Extended Abstract
Extending the Rackoff technique to Affine nets
Boolean Algebras from Trace Automata