yusuke1997/dblp-id-title huggingface dataset:
Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence
Planted Models for the Densest k-Subgraph Problem
Graph Isomorphism is not AC^0 reducible to Group Isomorphism
Structure and Specification as Sources of Complexity
Efficient Addition on Field Programmable Gate Arrays
Geometric Avatar Problems
Generalized Mean-payoff and Energy Games
Half-Guarding Weakly-Visible Polygons and Terrains
Polarized Name Passing
Comparing Trees Via Crossing Minimization
Parallelism and Programming: A Perspective
Model Checking Population Protocols
Efficient Algorithm to Sort Linear Combinations of Arrays
Flow Games
Complexity of Sufficient-Completeness
Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains
Why Liveness for Timed Automata Is Hard, and What We Can Do About It
On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems
Keeping Track of the Latest Gossip in Shared Memory Systems
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings
Reasonong about Safety and Liveness Properties for Probabilistic Processes
Fair Tree Connection Games with Topology-Dependent Edge Cost
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings
Grid File Algorithms: An Analysis in the Biased Case
On Self-Testing without the Generator Bottleneck
Logic for Knowledge Representation
On the Existence and Construction of Robust Communication Protocals for Unreliable Channels
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems
An O(n) Algorithm for Realizing Degree Sequences
Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes
From Local to Global Determinacy in Concurrent Graph Games
Essential Intersection Type Assignment
O(1) Parallel Time Incremental Graph Algorithms
Bounds on the Length of Convex Partitions of Polygons
A Hamiltonian Approach to the Assignment of Non-reusable Frequencies
Reachability Analysis of Process Rewrite Systems
Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat Graphs
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version
On the Operational Interpretation of Complex Types
Reachability for Updatable Timed Automata Made Faster and More Effective
Non-Local Box Complexity and Secure Function Evaluation
Revisiting Mulmuley: Simple Proof That Maxflow Is Not in the Algebraic Version of NC
Looking for MUM and DAD: Text-Text Comparisons Do Help
Efficient and Expressive Tree Filters
Graded Modalities and Resource Bisimulation
Correcting Errors in the Curry System
Model checking time-constrained scenario-based specifications
Popular Matchings with Lower Quotas
Partially Polynomial Kernels for Set Cover and Test Cover
Model Checking Concurrent Programs with Nondeterminism and Randomization
Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
Degree-Restricted Strength Decompositions and Algebraic Branching Programs
Frontmatter, Table of Contents, Preface, Conference Organization, Author Index
Why MCSP Is a More Important Problem Than SAT (Invited Talk)
A Lambda Calculus with Letrecs and Barriers
Predicting deadlock in Store-and-Forward Networks
Recurrence and Transience for Probabilistic Automata
On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model
Word Equations over Graph Products
Using Linear Arithmetic Procedure for Generating Induction Schemes
Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis
Assumption-Commitment in Automata
On Clustering Using Random Walks
IPS Lower Bounds for Formulas and Sum of ROABPs
Markov Decision Processes with Multiple Long-Run Average Objectives
On Encoding p-pi in m-pi
Irregularities of Distribution, Derandomization, and Complexity Theory
Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings
What You Must Remember When Transforming Datawords
Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning
A Myhill-Nerode Style Characterization for Timed Automata with Integer Resets
The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity
On (Simple) Decision Tree Rank
Finding Even Subgraphs Even Faster
Imperative Programming in Sets with Atoms
The Multicore Revolution
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation)
Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages
The Implication Problem for Functional and Multivalued Dependencies: An Algebraic Approach
Origin-Equivalence of Two-Way Word Transducers Is in PSPACE
Petri Nets and Transition Systems (Abstract for an invited talk)
Approximation Algorithms for Flexible Graph Connectivity
Dynamic Message Sequence Charts
Primal Infon Logic: Derivability in Polynomial Time
Planar Point Location Revisited (A Guided Tour of a Decade of Research)
Black Box Absolute Reconstruction for Sums of Powers of Linear Forms
Minimisation of Event Structures
Explicit Substitutions and Programming Languages
Runtime Monitoring of Metric First-order Temporal Properties
Constructing Small Tree Grammars and Small Circuits for Formulas
An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests
A Simple Characterization of Database Serializability
Stable Matching Games: Manipulation via Subgraph Isomorphism
Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion
The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase
Composition Problems for Braids
Fast Exact Algorithms Using Hadamard Product of Polynomials
Packing Arc-Disjoint 4-Cycles in Oriented Graphs
Parallel Algorithms for Solving Certain Classes of Linear Recurrences
Beyond Monads and Biproducts: A Uniform Interpretation of Parallelism in Intuitionistic Logic
A Formal Investigation of
Leakage Resilience, Targeted Pseudorandom Generators, and Mild Derandomization of Arthur-Merlin Protocols
On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation
Proving Termination of Logic Programs by Transforming them into Equivalent Term Rewriting Systems
How Pinball Wizards Simulate a Turing Machine
Join Algorithms for the Theory of Uninterpreted Functions
On Typed Calculi with a Merge Operator
On Simple and Creative Sets in NP
An Improved Dictatorship Test with Perfect Completeness
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs
The effect of girth on the kernelization complexity of Connected Dominating Set
Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)
k-delivery traveling salesman problem on tree networks
Quantitative Games under Failures
Lower bounds for Quantum Oblivious Transfer
Computing the Shortest Path Tree in a Weak Visibility Polygon
Visibly Rational Expressions
Clustering With Center Constraints
Efficient Algorithms for Crash Recovery in Distributed Systems
Failure-aware Runtime Verification of Distributed Systems
On Solving Sparse Polynomial Factorization Related Problems
Deciding the First Level of the µ-Calculus Alternation Hierarchy
Deduction with Relation Matching
Fast Deterministic Selection on Mesh-Connected Processor Arrays
How to Compute with DNA
The unfolding of general Petri nets
A Transformation System for Deductive Database Modules with Perfect Model Semantics
Fast and Powerful Hashing Using Tabulation (Invited Talk)
Streaming Algorithms for Selection and Approximate Sorting
Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract)
From Falsification to Verification
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs
Persistent First Class Procedures are Enough
A Faster Algorithm for Finding Closest Pairs in Hamming Metric
A Polynomial Approximation Scheme for Machine Scheduling on Uniform Processors: Using the Dual Approximation Approach
Mixed Nash Equilibria in Concurrent Terminal-Reward Games
Verifying Recursive Active Documents with Positive Data Tree Rewriting
Limitations of the QRQW and EREW PRAM Models
A Simple Characterization of Stuttering Bisimulation
Improved Approximation Algorithms for Maximum Graph Partitioning Problems
A Simple File Structure for the Weighted Dictionary Problem
Minimizing Space Usage in Evaluation of Expression Trees
On the Controller Synthesis for Finite-State Markov Decision Processes
Local Normal Forms for Logics over Traces
Efficient Formal Verification of Hierarchical Descriptions
On Sets Growing Continously
The First-Order Isomorphism Theorem
Graph Isomorphism: Its Complexity and Algorithms (Abstract)
Relational Logic with Framing and Hypotheses
Space Efficient Edge-Fault Tolerant Routing
Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems
Compositional Design of Multitolerant Repetitive Byzantine Agreement
The Mathematics of Programming
Theta 2 p -Completeness: A Classical Approach for New Results
The Calculus of Constructions: State of the Art
Languages Given by Finite Automata over the Unary Alphabet
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
Locally Decodable/Correctable Codes for Insertions and Deletions
Complexity of Coverability in Bounded Path Broadcast Networks
Large Database Specification from Small Views
Computing a Largest Empty Anchored Cylinder, and Related Problems
Modeling Software: From Theory to Practice
CTL + is Exponentially more Succinct than CTL
A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs
Better Algorithms and Bounds for Directed Maximum Leaf Problems
Automata and Logics for Timed Message Sequence Charts
Software Development Graphs. A Unifying Concept for Software Development?
On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
On the Complexity of Multi-Pushdown Games
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, IIT Kanpur, India, December 15-17, 2009
First-Order Logic with Reachability Predicates on Infinite Systems
Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs
Static Race Detection for RTOS Applications
The First-Order Theory of Ground Tree Rewrite Graphs
On Some Communication Complexity Problems Related to THreshold Functions
Towards Constructive Program Derivation in VDM
Hardness Results for Multicast Cost Sharing
Mixed-Criticality Scheduling to Minimize Makespan
Structural Average Case Complexity
Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method"
Relating Full Abstraction Results for Different Programming Languages
A New Class of Separators and Planarity of Chordal Graphs
Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata
Improved Lowness Results for Solvable Black-box Group Problems
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem
Finite State Implementations of Knowledge-Based Programs
Shortest k-Disjoint Paths via Determinants
Understanding the Correlation Gap For Matchings
Games with Delays - A Frankenstein Approach
Complexity of Linear Connectivity Problems in Directed Hypergraphs
Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures
Deducing Causal Relationships in CCS
Monotonicity Characterizations of Regular Languages
On Reduction Criteria for Probabilistic Reward Models
Two Size Measures for Timed Languages
Automata-Theoretic Techniques for Image Generation and Compression
Using non-convex approximations for efficient analysis of timed automata
Dynamic Network Congestion Games
Parameterized k-Clustering: Tractability Island
On Generating Strong Elimination Orderings of Strongly Chordal Graphs
A Synchronous Semantics of Higher-Order Processes for Modeling Reconfigurable Reactive Systems
Different Types of Monotonicity for Restarting Automata
Decidability of Timed Language-Inclusion for Networks of Real-Time Communicating Sequential Processes
Circuit Definitions of Nondeterministic Complexity Classes
On the Interactive Complexity of Graph Reliability
An Equational Theory for Transactions
Priced Timed Automata: Theory and Tools
The Zero-Error Randomized Query Complexity of the Pointer Function
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals
Thin Homogeneous Sets of Factors
Foundations of Software Technology and Theoretical Computer Science, Fourth Conference, Bangalore, India, December 13-15, 1984, Proceedings
A Constructive Set Theory for Program Development
A Randomized Algorithm for Flow Shop Scheduling
Deciding Orthogonality in Construction-A Lattices
Concurrent Knowledge and Logical Clock Abstractions
Lower Bounds for Parallel Algebraic Decision Trees, Complexity of Convex Hulls and Related Problems
Approximate Swapped Matching
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings
On the Complexity of Parallel Implementation of Logic Programs
Promptness and Fairness in Muller LTL Formulas
On Counting the Number of Consistent Genotype Assignments for Pedigrees
Extending Planar Graph Algorithms to K 3, 3 -free Graphs
Donation Center Location Problem
A New Characterization of BPP
Homomorphism Polynomials Complete for VP
Concurrent Programming Using Actors: Exploiting large-Scale Parallelism
Admissibility in Quantitative Graph Games
The Directed Planar Reachability Problem
Online Matching with Recourse: Random Edge Arrivals
Polynomial-Time Manz-One Reductions for Petri Nets
Computation of Summaries Using Net Unfoldings
Confluence of Conditional Rewriting in Logic Form
A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems and Interval Transition Systems
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
Algorithms for Message Ferrying on Mobile ad hoc Networks
Short-Cuts on Star, Source and Planar Unfoldings
On the Urgency Expressiveness
General Refinement for High Level Petri Nets
Natural Language Processing, Complexity Theory and Logic (Extended Abstract)
Sound Lemma Generation for Proving Inductive Validity of Equations
Model Checking and Functional Program Transformations
Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable
Synthesizing Computable Functions from Rational Specifications over Infinite Words
Regular Separability and Intersection Emptiness Are Independent Problems
On the Way to Alternating Weak Automata
Verification of Dynamic Register Automata
Implementable Failure Detectors in Asynchronous Systems
Unformly Applicative Structures, A Theory of Computability and Polyadic Functions
Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths
Automata-Driven Efficient Subterm Unification
Applications of Discrepancy Theory in Multiobjective Approximation
Knowledge over Dense Flows of Time (from a Hybrid Point of View)
Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams
On Bounded Reachability Analysis of Shared Memory Systems
NP-hard Sets and Creativeness over Constant Time Languages
Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets
Solving Parity Games in Big Steps
Triangulations of Line Segment Sets in the Plane
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, Bangalore, India, December 9-11, 2008
A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems
Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds
Algebraic Software Development Concepts for Module and Configuration Families
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
Covering Minima and Lattice Point Free Convex Bodies
Strong Reductions and Isomorphism of Complete Sets
Solving Odd-Fair Parity Games
On the Computational Power of Operators in ICSP with Fairness
Foundations of Software Technology and Theoretical Computer Science, 17th Conference, Kharagpur, India, December 18-20, 1997, Proceedings
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less
A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games
Approximation Schemes for Geometric NP-Hard Problems: A Survey
Satisfiability of Acyclic and Almost Acyclic CNF Formulas
Online Carpooling Using Expander Decompositions
Fairness and Efficiency in Two-Sided Matching Markets
Summary-Based Inter-Procedural Analysis via Modular Trace Refinement
Program Analysis Using Weighted Pushdown Systems
On the Control of Asynchronous Automata
Merge and Termination in Process Algebra
Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping
Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems
Banach-Mazur Games on Graphs
Foundations for Faster External Sorting (Extended Abstract)
Forbidden Extension Queries
Minimizing Busy Time in Multiple Machine Real-time Scheduling
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
A Decision Method for Temporal Logic Based on Resolution
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Partial Order Reductions for Bisimulation Checking
Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk)
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality
Reachability and Matching in Single Crossing Minor Free Graphs
A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound
Practical Algorithms for Tracking Database Join Sizes
Inherent Nonslicibility of Rectangular Duals in VLSI Floorplanning
Graph Types for Monadic Mobile Processes
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, Kanpur, India, December 11-15, 2017
Automatic Retargetable Code Generation: A New Technique
Merging and Sorting By Strip Moves
A lOwer Bound for Solvability of Polynomial Equations
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
The Complexity of the Diagonal Problem for Recursion Schemes
Expanders in Higher Dimensions (Invited Talk)
Proof Rules for Model Checking Systems with Data
Finkel Was Right: Counter-Examples to Several Conjectures on Variants of Vector Addition Systems (Invited Talk)
An Optimal Construction of Finite Automata from Regular Expressions
The Complexity of Gradient Descent (Invited Talk)
One-Input-Face MPCVP Is Hard for L, But in LogDCFL
Branching Bisimulation for Context-free Processes
Robust Multiplication-Based Tests for Reed-Muller Codes
Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems
Testing Theories for Asynchronous Languages
Some Observations About the Nature of Computer Science
On the Probabilistic Degrees of Symmetric Boolean Functions
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
An Algorithm for Colouring Perfect Planar Graphs
The Well Structured Problem for Presburger Counter Machines
Determining the Winner of a Dodgson Election is Hard
Zigzag Products, Expander Constructions, Connections, and Applications
Fast Parallel Algorithms for Cographs
Computing Rational Radical Sums in Uniform TC^0
Quantitative Verification on Product Graphs of Small Treewidth
Bounded Size Graph Clustering with Applications to Stream Processing
Real-Time Model-Checking: Parameters Everywhere
Computing Threshold Budgets in Discrete-Bidding Games
ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games
A Separation Logic for Resource Distribution: Extended Abstract
Eventual Timed Automata
On the Bisimulation Congruence in chi -Calculus
Model Cheking
A Proof System for the Linear Time µ-Calculus
Timed Lossy Channel Systems
The Meaning of Ordered SOS
Comparing Sequences with Segment Rearrangements
Approximate Online Pattern Matching in Sublinear Time
Synthesizing Safe Coalition Strategies
Clustering Under Perturbation Stability in Near-Linear Time
Fair Rent Division: New Budget and Rent Constraints
Causal Closure for MSC Languages
Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division
Logics of Knowledge, Games and Dynamic Logic
Locating Matches of Tree Patterns in Forests
Prefix Languages of Church-Rosser Languages
Explaining Updates by Minimal Sums
Graph Games on Ordinals
Unbiased Rounding of Rational Matrices
Simulation based security in the applied pi calculus
Inapproximability of Rainbow Colouring
Semi-Unification
A Non-Standard Inductive Semantics
Decision Procedures for Queues with Integer Constraints
The Delta-Framework
Efficient Algorithms for Vertex Arboricity of Planar Graphs
Energy-Efficient Algorithms (Invited Talk)
Abstraction Refinement for Games with Incomplete Information
Generating Degrees of Belief from Statistical Information: An Overview
Hyper Partial Order Logic
Fast Sorting In-Place Sorting with O(n) Data
The Equivalence Problem for n-Tape Finite Automata with Simple Cycles
Finding Sparser Directed Spanners
Completeness of Hierarchical Combinations of term Rewriting Systems
Model Checking: Theory into Practice
Models and Transformations for Nondeterministic Extensions of Functional Programming
Approximate Bisimulation Minimisation
On Functional Independencies
Bypassing Worst Case Analysis: Tensor Decomposition and Clustering (Invited Talk)
Foundations of Software Technology and Theoretical Computer Science, Eighth Conference, Pune, India, December 21-23, 1988, Proceedings
Nivat-Theorem and Logic for Weighted Pushdown Automata on Infinite Words
Distributed Synthesis for Well-Connected Architectures
Revisiting Robustness in Priced Timed Games
Online Facility Location with Weights and Congestion
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
Selection from Read-Only Memory and Sorting with Optimum Data Movement
Observational Logics and Concurrency Models
Quantitative Games with Interval Objectives
Visibly Pushdown Games
Superlinear Speedup in Parallel State-Space Search
Approximation Schemes Using L-Reductions
New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
From Concept Learning to SAT-Based Invariant Inference (Invited Talk)
On Some Computational Problems Related to Data Base Coding (Abstract)
Demand-Driven Evaluation on Dataflow Machine
Justified Representation in Multiwinner Voting: Axioms and Algorithms
Frequency Assignment in Mobile Phone Systems
The Preemptive Resource Allocation Problem
An Adaptive Regulator Approach for the Design of Load Sharing Algorithms
A Generalized Quantum Branching Program
Inductive Definitions and Type Theory: an Introduction (Preliminary Version)
Regularity is Decidable for Normed PA Processes in Polynomial Time
Improved Pseudo-Polynomial-Time Approximation for Strip Packing
Solvency Games
Nash Equilibrium in Generalised Muller Games
Synthesizing Distributed Transition Systems from Global Specification
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs
McCarthy's Amb Cannot Implement Fair Merge
Undirected Graphs of Entanglement 2
Dynamic Compressed Hypertoctrees with Application to the N-Body Problem
On Timed Alternating Simulation for Concurrent Timed Games
Safety Verification of Communicating One-Counter Machines
Isomorphism testing of read-once functions and polynomials
Covering of ordinals
On Resource-Bounded Measure and Pseudorandomness
Computational and Information-Theoretic Questions from Causal Inference (Invited Talk)
One-Counter Automata with Counter Observability
A New Competitive Algorithm for Agent Searching in Unknown Streets
Feasability of Design in Stereolithography
Parameterized Verification of Timed Networks with Clock Invariants