yusuke1997/dblp-id-title huggingface dataset:
Ambiguity and Precedence in Syntax Description
Proving Relative Lower Bounds for Incremental Algorithms
A Logic-Based Approach to Program Flow Analysis
Persistence of Vector Replacement Systems is Decidable
Improved matrix pair undecidability results
Discovering workflow nets of concurrent iterative processes
Avoidable binary patterns in partial words
On timed alternating simulation for concurrent timed games
Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems
The Formal Definition of a Real-Time Language
Row-column combination of Dyck words
Gobang ist PSPACE-vollständig
Denotational Semantics of Object Specification
A theory of bunches
Programmed grammars and their relation to the LBA problem
Parallel Approximation Schemes for Problems on Planar Graphs
Special Factors, Periodicity, and an Application to Sturmian Words
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications
On the non-approximability of points-to analysis
The Complexity of Reachability in Distributed Communicating Processes
Testing membership for timed automata
In Memoriam: Andrei Petrovich Ershov
A core calculus for dynamic delta-oriented programming
A Characterisation of Meet and Join Respecting Pre-Orders and Congruences on Finite Lattices
Worst-Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees
Correctness of the Compiling Process Based on Axiomatic Semantics
Some properties of involution binary relations
Thrifty Execution of Task Pipelines
Zur Komplexität von Sortierproblemen
On a Class of Recursive Procedures and Equivalent Iterative Ones
Continuous Reductions Among Combinatorial Optimization Problems
On Some Decidable Properties of Finite State Translations
Three Measures for Synchronic Dependence in Petri Nets
The Characterization of Parallel Ultralinear Grammars by Rational Power Series
Proof Theory for Exception Handling in a Tasking Environment
Inner Loops in Flowgraphs and Code Optimization
Hypernode automata
Further Analysis of Code Generation for a Single Register Machine
On the Generative Power of Regular Pattern Grammars
Refinement verification of the lazy caching algorithm
Concurrent Testing of Processes
Algorithms for monitoring real-time properties
A comparison of pebble tree transducers with macro tree transducers
Reachability results for timed automata with unbounded data structures
Hiding in Stream Semantics of Uniform Concurrency
Dynamic Weighted Binary Search Trees
A Characterization of Systolic Binary Tree Automata and Applications
Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015)
On Sets of Boolean n -Projections Surjective
Characteristic bisimulation for higher-order session processes
Coupled similarity: the first 32 years
Receptive Process Theory
Fast allocation and deallocation with an improved buddy system
The Boolean closure of linear context-free languages
Preserving hyperproperties of programs using primitives with consensus number 2
A General Proof Rule for Procedures in Predicate Transformer Semantics
Axiomatising timed automata
Partial-Predicate Logic in Computer Science
Reasoning about probabilistic sequential programs in a probabilistic logic
On the Synthesis of Function Inverses
Correction to: Solving high-level Petri games
Minimum status of trees with a given degree sequence
Relating Confluence, Innermost-Confluence and Outermost-Confluence Properties of Term Rewriting Systems
Preface to Klaus-Jörn Lange Festschrift
Computation and Use of Data Flow Information in Optimizing Compilers
On the Valuedness of Finite Transducers
Exploiting a hypergraph model for finding Golomb rulers
Deriving and paraphrasing information grammars using object-oriented analysis models
Stateless model checking for TSO and PSO
Group weighted finite transducers
On Finitely Recognizable Semigroups
Constructing LR Parsers for Regular Right Part Grammars
Using the Blankinship Algorithm to Find the General Solution of a Linear Diophantine Equation
Modelling higher-order dual nondeterminacy
The Average Number of Registers Needed to Evaluate a Binary Tree Optimally
Complement for two-way alternating automata
Pathlistings Applied to Data Flow Analysis
Job Scheduling Guaranteeing Reasonable Turn-Around Times
A Maximum Entropy Analysis of the M/G/ 1 and G/M/ 1 Queueing Systems at Equilibrium
Languages Accepted by Systolic Y-Tree Automata: Structural Characterizations
Necessary and Sufficient Conditions for the Universality of Programming Formalisms
More Comments on the Programming Language Pascal
Naive Asymptotics for Hitting Time Bounds in Markov Chains
Algorithms Minimizing Mean Flow Time: Schedule-Length Properties
Synchronized extension systems
A Class of Measures on Formal Languages
Safety synthesis for incrementally stable switched systems using discretization-free multi-resolution abstractions
The Construction of Operator Interfaces Based on Logical Input Devices
Recognizability of graph and pattern languages
The SB-Tree: An Index-Sequential Structure for High-Performance Sequential Access
On the Recognition of Permuted Supnick and Incomplete Monge Matrices
An instruction set for reversible Turing machines
The identity problem of finitely generated bi-ideals
Spanning the spectrum from safety to liveness
A Principle of Independence for Binary Tree Searching
A note on prefix primitive words
Negotiation as concurrency primitive
Parikh matrices for powers of words
Modeling Splits in File Structures
Homeostasis tissue-like P systems with cell separation
Well Quasi-Orders and Regular Languages
Rangierkomplexität von Permutationen
A Modal Logic for Message Passing Processes
A Logic for the Specification and Proof of Regular Controllable Processes of CCS
Aggregation-based minimization of finite state automata
Dynamic Bayesian networks for formal verification of structured stochastic processes
Three-element codes with one d-primitive word
Canonical prefixes of Petri net unfoldings
On the observational theory of the CPS-calculus
Reasoning over n-indexed sequences in SMT
Characterizations of k-comma codes and k-comma intercodes
Optimum Multiway Search Trees
Merged processes: a new condensed representation of Petri net behaviour
A Characterization of Database Graphs Admitting a Simple Locking Protocol
LALR (1, 1) Parser Generation for Regular Right Part Grammars
A Calculus of Refinements for Program Derivations
Transformational Design of Real-Time Systems Part I: From Requirements to Program Specifications
Refined typing to localize the impact of forced strictness on free theorems
On the Hotz Group of a Context-Free Grammar
Semantic Properties of Lucid's Compute Clause and its Compilation
A deterministic parsing algorithm for ambiguous regular expressions
Space Efficient Algorithms for Some Graph Theoretical Problems
The second step in characterizing a three-word code
Checking interval properties of computations
On Removing the Machine from the Language
A Tree-Based Mergesort
Ein Vollständigkeitssatz für Programme und Schaltkreise
Preface to Martin Kutrib Festschrift
Optimal Fault-Tolerant Computing on Multiprocessor Systems
The Use of Deleted Tuples in Database, Querying and Updating
The stuttering principle revisited
Proof of Termination within a Weak Logic of Programs
Precedence Technique is not Worse than SLR(1)
Axioms for Total Correctness
What is Failure? An Approach to Constructive Negation
On Gurevich's theorem on sequential algorithms
Model-checking iterated games
Bases for closed sets of implicants and implicates in temporal logic
Efficiency of Universal Parallel Computers
Transforming Unbalanced Multiway Trees into a Practical External Data Structure
WCS-Analysis of the Context-Sensitive
A Practical Example of the Specification of Abstract Data Types
Multipass Precedence Analysis
Object type constructors
Verification of heap manipulating programs with ordered data by extended forest automata
Linear Regular Sets
On Languages Accepted by Space-Bounded Oracle Machines
Rewrite Systems on a Lattice of Types
Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
Automating the Knuth Bendix Ordering
A Branch-and-Bound Algorithm to Obtain an Optimal Evaluation Tree for Monotonic Boolean Functions
A criterion for atomicity revisited
Procédures de reprise dans les systèmes de gestion de base de données réparties
Observational Implementation of Algebraic Specifications
Single Machine Flow-Time Scheduling with Scheduled Maintenance
On-Line Multiversion Database Concurrency Control
Fifo Nets Without Order Deadlock
Rational Set of Trees and the Algebraic Semantics of Logic Programming
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems
Trading polarizations for labels in P systems with active membranes
Langages saturés et cones décroissants Langages et cones bifidèles
Symbolic execution for refuting ∀∃ hyperproperties
Preface to special issue: EXPRESS/SOS 2016 + 2017
Recursion and Petri nets
Deterministic ordered restarting automata for picture languages
Time Optimal Left to Right Construction of Position Trees
Normal Form Approach to Compiler Design
On the complexity of deciding typability in the relational algebra
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times
Tableau-Based Model Checking in the Propositional Mu-Calculus
Binary Search Trees in Secondary Memory
Algebraic Models of Microprocessors: Architecture and Organisation
Bounds on Algorithms for String Generation
An Effectively Given Initial Semigroup
On Proving that Certain Languages are not ETOL
The fibers and range of reduction graphs in ciliates
Networks of evolutionary processors: the power of subregular filters
Parameterized linear temporal logics meet costs: still not costlier than LTL
Cooperative Distributed Dynamic Load Balancing
Planning and execution with flexible timelines: a formal account
A characterization of rational D0L power series
Revisiting 2-3 red-black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking
On a New Approach to Representation Independent Data Classes
How to Calculate Symmetries of Petri Nets
An Almost Linear Robinson Unification Algorithm
On the Analysis of Petri Nets with Static Priorities
Varepsilon-Productions in Context-Free Grammars
Verification of Programs with Procedure-Type Parameter
A Class of Linearly Parsable Graph Grammars
Approximating Traces
Editorial 2024: moving forwards in the electronic age
Communication for Alternating Machines
On the Expressiveness of Subset-Sum Representations
A Model of a Virtual Memory System
Efficiently solving the Bin Packing problem through bio-inspired mobility
Configurable verification of timed automata with discrete variables
Online multi-coloring on the path revisited
Fundamental Operational Laws of Computer System Performance
Information Theoretic Analysis for a General Queueing System at Equilibrium with Application to Queues in Tandem
Metatheorems for Decision Problems on Hyperedge Replacement Graph Languages
Sur diverses familles de langages fermées par transduction rationelle
Distance Measures for Point Sets and their Computation
Analysis of Tree Algorithms for the Simulation Event List
Priority Conflict-Free Petri Nets
Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams
Speeding up Circularity Tests for Attribute Grammars
A Run-Time Load Balancing Strategy for Highly Parallel Systems
Good OL Forms
Proof of Correctness of Data Representations
Every Binary Pattern of Length Six is Avoidable on the Two-Letter Alphabet
Structural liveness of Petri nets is ExpSpace-hard and decidable
Analyse d'un algorithme de gestion simultanée Mémoire centrale - Disque de pagination
A top-down proof procedure for generalized data dependencies
Backtracking in Recursive Computations
Minimal Equational Representations of Recognizable Tree Languages
An Alternative Implementation of an Insertion-Only Recovery Technique
'Closed Interval Process Algebra' versus 'Interval Process Algebra'
A Denotational Framework for Data Flow Analysis
A Conservation Law for G/G/m Queueing Systems
Complexity of Analyzing the Synchronization Structure of Concurrent Programs
Total lineare Realisierbarkeit endlicher Automaten
A Markovian queue with varying number of servers and applications to the performance comparison of HSDPA user equipment
Proving Properties of Interacting Processes
Node Flows in Graphs with Conservative Flow
EOL Forms
An Efficient Incremental LR Parser for Grammars With Epsilon Productions
Randomization adaptive self-stabilization
Generalized normal form for rewriting P systems
LAR: A Logic of Algorithmic Reasoning
Variance Reduction Techniques for the Simulation of Markov Process
On-line coloring and cliques covering for K K s, t -free graphs
Correct hardware synthesis - An algebraic approach
An Abstract Data Type for Name Analysis
Predicate-Transformer Semantics of General Recursion
Fairness and Related Properties in Transition Systems - A Temporal Logic to Deal with Fairness
Probabilistic Models of Computer Systems - Part I (Exact Results)
Boundedly LR( k )-conflictable Grammars
Erratum to: Avoidable binary patterns in partial words
Sound and Complete Hoare-like Calculi Based on Copy Rules
Metric Semantics from Partial Order Semantics
Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
On Binary Tree Encodements
Complete Problems for Space Bounded Subclasses of NP
Congruence from the operator's point of view
Specification and Proving of Command Programs
Applications of the Theory of Records in the Study of Random Trees
A Note on Multihead Automata and Context-Sensitive Languages
Connected feedback vertex set on AT-free graphs
Containment and disjointedness in partitioned normal form relations
Bounded Delay for a Free Address
Special issue on Rich Models, EU-COST Action IC0901 Rich-Model Toolkit
On Abelian 2-avoidable binary patterns
Losslessness and Project-Join Constructibility in Relational Databases
Computation Sequences: A Way to Characterize Classes of Attribute Grammars
A binary integer programming-based method for qubit mapping in sparse architectures
Representation and uniformization of algebraic transductions
Best Huffman Trees
Providing view synchrony for group communication services
Finding a Maximum Matching in a Permutation Graph
The Optimal Binary Search Tree for Andersson's Search Algorithm
Conjunctive query containment over trees using schema information
Exponentially decreasing number of operations in balanced trees
A closer look at Hamiltonicity and domination through the lens of diameter and convexity
Explaining the Wheel Sieve
Iterated GSMs and Co-CFL
Referential Transparency, Definiteness and Unfoldability
Hardness of equivalence checking for composed finite-state systems
Flow Languages Equal Recursively Enumerable Languages
Behandlung verschiedener INTEGER-Darstellungen durch optimierende Compiler
Descending chains and narrowing on template abstract domains
Variance of Storage Requirements for B+-trees
A distributed QoS-Aware multicast routing protocol
Iterated Deterministic Substitution
Some kinds of primitive and non-primitive words
Some Extended Semaphore Primitives
On Sufficient-Completeness and Related Properties of Term Rewriting Systems
Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
Merging Sorted Runs Using Large Main Memory
Watson-Crick quantum finite automata
A general framework for types in graph rewriting
Periods in Extensions of Words
SLR(1) and LALR(1) Parsing for Unrestricted Grammars
Congruences et Automorphismes des Automates Finis
Another Polynomial Homomorphism
On the Semantics of Polymorphism
Some Comments on "Concurrent Readers and Writers"
Application of Regular Canonical Systems to Grammars Translatable from Left to Right
Resolution of Ambiguity in Parsing
Context-Free Languages over Infinite Alphabets
All congruences below stability-preserving fair testing or CFFD
Coincidental extension of scattered context languages
Solving high-level Petri games
Partitioning a Sequence into Few Monotone Subsequences
Free Choice Systems Have Home States
Alan J. Perlis 1922-1990
Storage Utilization in B*-Trees with a Generalized Overflow Technique
Throughput of a Satellite Channel Communication
A Family of NP-Complete Data Aggregation Problems
An Axiomatic Proof Technique for Parallel Programs I
Inherently Nonplanar Automata
On Termination Problems for Finitely Interpreted ALGOL-like Programs
On the undecidability and descriptional complexity of synchronized regular expressions
Inefficiency of equilibria for the machine covering game on uniform machines
On the number of nodes in universal networks of evolutionary processors
Maintaining Order in a Generalized Linked List
Optimal Multiway Search Trees for Variable Size Keys
The maximum gain of increasing the number of preemptions in multiprocessor scheduling
A word on 7 letters which is non-repetitive up to mod 5
Nonterminal complexity of one-sided random context grammars
Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t< n/3, O(n 2 ) messages, and constant time
Detecting Morphic Images of a Word on the Rank of a Pattern
Stochastic game logic
An algorithmic study of switch graphs
Big data interpolation using functional representation
LR (0) Grammars Generated by LR (0) Parsers
Fusion and Simultaneous Execution in the Refinement Calculus
A Decomposable Model of Program Paging Behaviour
Proving and Applying Program Transformations Expressed with Second-Order Patterns
Reasoning Algebraically about Loops
The Undecidability of the Unification and Matching Problem for Canonical Theories
Efficient LL(1) Error Correction and Recovery Using Only Insertions
Fast Algorithms for the Elimination of Common Subexpressions
Scattered Versus Context-Sensitive Rewriting
NP-complete Problems Simplified on Tree Schemas
On the Use of History Variables
Extending stratified datalog to capture complexity classes ranging from P to QH
Optimal alpha-beta Trees with Capacity Constraint
Two Notions of Correctness and Their Relation to Testing
Applications of Efficient Mergeable Heaps for Optimization Problems on Trees
An efficient simulation algorithm on Kripke structures
Incremental LR Parers
On best transitive approximations to simple graphs
The Synchronization of Independent Processes
The Calculus of Context Relations
Rational Index of Vector Addition Systems Languages
Addenda and Corrigenda: Formal Semantics of a Class of High-Level Primitives for Coordinating Concurrent Processes
Quantum loop programs
SMT-based generation of symbolic automata
A Second Order Theory of Data Types
On-Way Multihead Deterministic Finite Automata
Generating Words Lexicographically: An Average-Case Analysis
Inferring Multivalued Dependencies From Functional and Join Dependencies
Symbolic automata for representing big code
Analytic Models for the Primary Site Approach to Fault-Tolerance
Partial (Set) 2-Structures. Part II: State Spaces of Concurrent Systems
Performance Preorder and Competitive Equivalence
Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array
Symbolic checking of Fuzzy CTL on Fuzzy Program Graph
On Grammar Forms with Terminal Context
Systolic Automata for VLSI on Balanced Trees
The Complexity of Graph Languages Generated by Hyperedge Replacement
A Logic Covering Undefinedness in Program Proofs
Depth-first search in directed planar graphs, revisited
Inductive Completion with Retracts
M-nets: a survey
Approximating Queue Lengths in M (t)/ G /1 Queue Using the Maximum Entropy Principle
The Complexity of Drawing Trees Nicely
Über Separatoren in planaren Graphen
Optimal Multiprogramming
Fairness of Actions in System Computations
Generalized contexts for reaction systems: definition and study of dynamic causalities
Equivalences and optimizations in an expressive XSLT subset
A theory of structural stationarity in the pi -Calculus
General Properties of Derivational Complexity
Genericity and the pi-calculus
On the Algebraic Specification of Infinite Objects - Ordered and Continuous Models of Algebraic Types
Complete Parameterized Families of Job Scheduling Strategies
Axiomatics for Memory Allocation
Lifetime Analysis for Attributes
Infinitary rewriting: meta-theory and convergence
Efficient LR(1) Parsers
Conceptual Classes and System Classes in Object Databases
Judgmental subtyping systems with intersection types and modal types
Generation of Efficient LALR Parsers for Regular Right Part Grammars
The Multiple Phase Service Network with Generalized Processor Sharing
Using the Causal Domain to Specify and verify Distributed Programs
On Scheduling Tasks with Exponential Service Times and In-Tree Precedence Constraints
On path-controlled insertion-deletion systems
On Deciding Whether a Monoid is a Free Monoid or is a Group
Interactaive Graphics on Intelligent Terminals in a Time-Sharing Environment
Multi-Granularity Locking for Nested Transactions: A Proof Using a Possibilities Mapping
Frameworks for Abstract Interpretation
Step traces
On star-k-PCGs: exploring class boundaries for small k values
Safraless LTL synthesis considering maximal realizability
A Generalized Distribution Model for Random Recursive Trees
Mining approximate interval-based temporal dependencies
Ordered Attributed Grammars
Decision Problems for Finite Special String-Rewriting Systems that are Confluent on Some Congruence Class
A first step in characterizing three-element codes
On regular temporal logics with past
Performance Bounds for Binary Testing with Arbitrary Weights
Deadlock-Freedom in Resource Contentions
Sound reasoning in tock-CSP
M/M/1 retrial queue with working vacations
Nilpotency and periodic points in non-uniform cellular automata
Parallel LL parsing
Type-based hot swapping of running modules
Sticky-free and overhang-free DNA languages
On the Space Optimizing Effect of Eliminating Single Productions from LR Parsers
Deterministic Buffer Synchronization of Sequential Processes
Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games
Extensional Equivalences for Transition Systems
A Typed Logic of Partial Functions Reconstructed Classically
The Stability Problem of Broadcast Packet Switching Computer Networks
Average-energy games
Stacks, Queues, and Deques with Order-Statistic Operations
Forgetting Automata and Context-Free Languages
Editorial: Hybrid Systems
Programming by predicates: a formal model for interactive synthesis
Deriving Graphs from Graphs by Applying a Production
New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
Assume-admissible synthesis
Simple Extensions of 1-writer Atomic Variable Constructions to Multiwriter Ones
Bounded choice-free Petri net synthesis: algorithmic issues
Integrating Code Generation and Peephole Optimization
Deleting the Root of a Heap
An efficient algorithm for finding ideal schedules
A Regularity Test for Dual Bordered OS Systems
Identity-based signatures in standard model
New Lower Bounds on the Formula Size of Boolean Functions
Axiomatic Approach to Total Correctness of Programs
A Multiclass Networt Model of a Demand Paging Computer System
Simple chain automaton random number generator for IoT devices
Fair ambients
Worst Case Performance of Weighted Buddy Systems
Proof Rules for Gotos
Analysis of a Prioritized CSMA Protocol Based on Staggered Delays
Processors Selection and Traffic Splitting in a Parallel Processors System
pi-calculus with noisy channels
Editorial 2025: Going Beyond 40
A general exhaustive generation algorithm for Gray structures
Supercube: An Optimally Fault Tolerant Network Architecture
Correctness of dataflow and systolic algorithms using algebras of streams
Extending the accommodating function
Berechnung und Programm. I
Synthesized and Inherited Functions. A new Computational Model for Syntax-Directed Semantic
Average-Case Complexity for the Execution of Recursive Definitions on Relational Databases
Locations Considered Unnecessary
On stateless deterministic restarting automata
Performance heuristics for GR(1) synthesis and related algorithms
Stratified Balanced Search Trees