yusuke1997/dblp-id-title huggingface dataset:
Improving LSH via tensorized random projection
Recursive Petri nets
Analysis of dual-hop and multiple relays cooperative truncated ARQ with relay selection in WSNs
An efficient alternative strategy for finding prices in envy-free perfect matchings
Synchronized regular expressions
A Kernel Language for Programmed Rewriting of (Hyper)graphs
Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information
Sur les générateurs algébriques et linéaires
Preference rankings in the face of uncertainty
Product Properties and Their Direct Verification
DKL: an efficient algorithm for learning deterministic Kripke structures
Lineare Realisierbarkeit endlicher Automaten über endlichen Körpern
LR Parsing for Affix Grammars
Crypt-Equivalent Algebraic Specifications
From regular expression matching to parsing
Context-Free Grammars With Selective Rewriting
Sequential and Jumping Machines and their Relation to Computers
On constructibility and unconstructibility of LTS operators from other LTS operators
Impurity measures in databases
A new Lower Bound on the Monotone Network Complexity of Boolean Sums
A Note on Synthesis and Classification of Sorting Algorithms
MAT learners for tree series: an abstract data type and two realizations
Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
Using transition set sequences to partition behaviors of petri nets
On the Expressive Power of Data Dependencies
Choosing a Storage Schema
Category-theoretic fibration as an abstraction mechanism in information systems
Program reversals for evolutions with non-uniform step costs
Object Inheritance Beyond Subtyping
On Random 2-3 Trees
TSO-to-TSO linearizability is undecidable
Toward Formal Development of Programs from Algebraic Specifications: Parameterisation Revisited
Semantics analysis through elementary meanings
Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
Consistent and Complementary Formal Theories of the Semantics of Programming Languages
Consistent Records in Asynchronous Computations
Partage de tâches entre processeurs homogenes
Fundamentals of control flow in workflows
The Expressive Power of Delay Operators in SCCS
The variance of the height of digital search trees
Adding inclusion dependencies to an object-oriented data model with uniqueness constraints
Labelled transition logic: an outline
An Algebraic Semantics of Higher-Order Types with Subtypes
A Note on the Density of Inherently Ambiguous Context-free Languages
Performances of an Algorithm Constructing a Nearly Optimal Binary Tree
Three-word codes $\{a,\ aba,\ u\}$ and $\{a,\ ab,\ v\}$ having finite completions
A construction of distributed reference counting
On the Implementation of Strassen's Fast Multiplication Algorithm
A Theory of Interactive Programming
On Non-Determinancy in Simple Computing Devices
Constructing Maximal Slicings from Geometry
Page Size in Demand-Paging Systems
Theoretical Foundations of Handling Large Substitution Sets in Temporal Integrity Monitoring
Tree-systems of morphisms
On the Complexity of some Problems Concerning the Use of Procedures II
Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages
Distinguishing and relating higher-order and first-order processes by expressiveness
Synchronisationsgraphen
Automatic Program Verification I: A Logical Basis and its Implementation
The Effect of Fixed-Length Record Implementation on File System Response
Reoptimization of parameterized problems
The Formal Power of One-Visit Attribute Grammars
Bounded Quantification and Relations Recognizable by Finite Automata
Speicheroptimale Formelübersetzung
New proof for the undecidability of the circular PCP
A Simple Fixpoint Argument Without the Restriction to Continuity
On α 2 - ν 2-products of automata
Automatic verification of concurrent systems using a formula-based compositional approach
Revised Report on the Algorithmic Language ALGOL 68
Extended Directed Graphs, a Formalism for Structured Data and Data Structures
A tool for deciding the satisfiability of continuous-time metric temporal logic
Preface for the SYNT
A Class of Coders Based on GSM
On a Relation Between Uniform Coding and Problems of the Form DTIMEF( F ) =? DSPACEF( F )
Implementing Daubechies Wavelet Transform with Weighted Finite Automata
On-line graph coloring of P 5 -free graphs
Compositional schedulability analysis of real-time actor-based systems
Depth-First K-Trees and Critical Path Analysis
Testing for refinement in Circus
The Connection between an Event Structure Semantics and an Operational Semantics for TCSP
Describing an Algorithm by Hopcroft
Satisfiability of Co-Nested Formulas
Arithmetical datatypes with true fractions
Dynamic LL(k) Parsing
A Transformation Method for Dynamic-Sized Tabulation
Preface for the special issue GandALF 2015
On minimum t-claw deletion in split graphs
Networks of evolutionary processors
Hierarchical information and the synthesis of distributed strategies
A Functional Model for Describing and Reasoning About Time Behaviour of Computing Systems
Recursive Assertions and Parallel Programs
A Simple, Fast, and Effective LL(1) Error Repair Algorithm
Combinator-Based Compilation of Recursive Functions with Different Parameter Passing Modes
On Procedures as Open Subroutines. II
Efficient and secure attribute-based signature for monotone predicates
Mellin Transforms and Asymptotics: The Mergesort Recurrence
Berechnung und Programm. II
On the Look-Ahead Problem in Lexical Analysis
Disjunctivity and other properties of sets of pseudo-bordered words
Semantic Foundations of 4NF in Relational Database Design
Translating between models of concurrency
SEMANOL (73) A Metalanguage for Programming the Semantics of Programming Languages
A generalised theory of Interface Automata, component compatibility and error
On deterministic sensing $5'\rightarrow 3'$ Watson-Crick finite automata: a full hierarchy in 2detLIN
On an Equivalence between Continuation and Stack Semantics
The Choice Coordination Problem
An Observation on Suffix Redundancy in LL(1) Error Repair
Subtyping for session types in the pi calculus
General quantitative specification theories with modal transition systems
Eigenschaften der von linearen Automaten erkennbaren Worte
Using contracted solution graphs for solving reconfiguration problems
Toward Formal Development of Programs from Algebraic Specifications: Implementations Revisited
On the Performance Evaluation of Extendible Hashing and Trie Searching
An automated system repair framework with signal temporal logic
A Note on Classes of Complements and the LBA Problem
A Relational Approach to the Design of Deterministic Programs
Syntactic Complexity of Context-Free Grammars Over Word Monoids
Conjunctive grammars and alternating pushdown automata
Data Refinement by Calculation
The Programming Language Pascal
A "Yo-Yo" Parsing Algorithm for a Large Class of van Wijngaarden Grammars
General Correctness: A Unification of Partial and Total Correctness
On a Gauntlet Thrown by David Gries
Generating Boolean mu-Expressions
On the Max-Entropy Rule for a Binary Search Tree
Proving Total Correctness of Nondeterministic Programs in Infinitary Logic
An O(n) Algorithm for Computing the Set of Available Expressions of D-Charts
On the Sequential Nature of Interprocedural Program-Analysis Problems
Algorithms for Fast Evaluation of Boolean Expressions
Applying relation algebra and Rel View to solve problems on orders and lattices
Efficient Worst-Case Data Structures for Range Searching
On the hardness of analyzing probabilistic programs
Efficient Memo-Table Management Strategies
On the complexity of drawing trees nicely: corrigendum
On the probabilistic bisimulation spectrum with silent moves
Der programmierbare endliche Automat
Self-stabilizing group communication in directed networks
Redundant Proofs of Non-Interference in Levin-Gries CSP Program Proofs
Optimal Search Trees Using Two-Way Key Comparisons
On Bounds of Response Time Performance Achievable by Multiclass Single-Server Queues
The Analysis of Heuristics for Search Trees
Trajectory-based codes
Charting the completeness frontier of inference systems for multivalued dependencies
Minimal Huffman Trees
Scattered context grammars that erase nonterminals in a generalized k -limited way
Hex ist PSPACE-vollständig
Relaxed red-black trees with group updates
Exploration of k-edge-deficient temporal graphs
Minimale und m-minimale Variablenmengen für partielle Boole'sche Funktionen
Timed tree automata with an application to temporal logic
Step Failures Semantics and a Complete Proof System
Optimization in temporal qualitative constraint networks
Eliminating Unit Productions from LR Parsers
Scheduling with Slack Time
Undecidability of Restricted Uniform Recurrence Equations
Forward and backward application of symbolic tree transducers
Analysis of a Service Facility with Periodic Checkpointing
Iteration of Transformation Passes over Attributed Program Trees
On Procedures as Open Subroutines. I
An All-Round Sweep Algorithm for 2-Dimensional Nearest-Neighbor Problems
Bitopological duality for algebras of Fitting's logic and natural duality extension
Abstract reduction in directed model checking CCS processes
On Parsing Arithmetic Expressions in a Multiprocessing Environment
Two Graph Algorithms Derived
Endliche Automaten und Zufallsfolgen
Erratum: Predicative Methodology
Optimal Bounds on the Gain of Permitting Dynamic Allocation of Communication Channels in Distributed Computing
Hybrid networks of evolutionary processors are computationally complete
Equational weighted tree transformations
Inference rules for proving the equivalence of recursive procedures
Analysis of a Class of Communicating Finite State Machines
On Real-Time Cellular Automata and Trellis Automata
Dynamic Multi-Dimensional Data Structures Based on Quad- and K - D Trees
Nearly Optimal Hierarchies for Network and Formula Size
The time complexity of typechecking tree-walking tree transducers
On the equivalence between FDs in XML and FDs in relations
Properties of Data Flow Frameworks
d-Words and d-Languages
The Additivity Problem for Functional Dependencies in Incomplete Relations
Unsafe Operations in B-Trees
On the relations between Markov chain lumpability and reversibility
An Optimal Emulator and VLSI Layout for Complete Binary Trees
RETRPROV, A System that Looks for Axioms
One-Pass Transformations of Attributed Program Trees
Syntactic Complexity of Scattered Context Grammars
Decidability of Model Checking for Infinite-State Concurrent Systems
Depletable channels: dynamics, behaviour, and efficiency in network design
Information Management in Context Trees
On the Rational Subsets of the Free Group
Novel tree-search method for synthesizing SMT strategies
Effective Construction of the Syntactic Algebra of a Recognizable Series on Trees
Computational Fractal Geometry with WFA
Replication, refinement & reachability: complexity in dynamic condition-response graphs
A Reply to Comments on "A Comparison of Two Synchronizing Concepts"
Net-Based Control Versus Rational Control. The Relation Between ITNC Vector Languages and Rational Relations
The Analysis of Quicksort Programs
Dispatcher Primitives for the Construction of Operating System Kernels
Step semantics of boolean nets
Deriving very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique
Quad Trees: A Data Structure for Retrieval on Composite Keys
On the Complexity of Some Problems Concerning the Use of Procedures I
On Fast Multiplication of Polynomials over Arbitrary Algebras
Two-tier relaxed heaps
A symbolic algorithm for lazy synthesis of eager strategies
Null Values in Nested Relational Databases
Design and Correctness of a Compiler for a Non-Procedural Language
An Optimal Algorithm for Solving the Searchlight Guarding Problem on Weighted Two-Terminal Series-Parallel Graphs
Decision problems for pushdown threads
Prototyping Realistic Programming Languages Based on Formal Specifications
The complexity of counting models of linear-time temporal logic
Lattices in Machine Learning: Complexity Issues
Classes of Systolic Y-Tree Automata and a Comparison with Systolic Trellis Automata
A Maximum Entropy Priority Approximation for a Stable G/G/ 1 Queue
Sur une Conjecture de S. Greibach
Program Behavior Prediction and Prepaging
Speeding up Dynamic Transitive Closure for Bounded Degree Graphs
Reversible Watson-Crick automata
CHAP and rewrite components
A Closer Look at Termination
Compositional verification of asynchronous concurrent systems using CADP
On the Expansion of Non-Linear Functions
On the Lengths of Values in a Finite Transducer
View selection for real conjunctive queries
Natural language guided object retrieval in images
Correction: Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms
Parallel Language Recognition in Constant Time by Cellular Automata
Periodic-like words, periodicity, and boxes
On first-order runtime enforcement of branching-time properties
Indépendance Forte de Certaines Opérations
An Optimal Algorithm for Decomposing a Window into Maximal Quadtree Blocks
Data Management Support for Database Management
Minimum-Delay Schedules in Layered Networks
Avoiding cross-bifix-free binary words
Permuting Data with the Omega Network
Optimal Disk Merge Patterns
Deterministic Sequential Functions
On Efficient Implementation of an Approximation Algorithm for the Steiner Tree Problem
Orthogonality of Information Structures
A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds
Approximating subset sum ratio via partition computations
Branching Processes of Petri Nets
Associative composition of components with double-sided interfaces
Amounts of Nondeterminism in Finite Automata
The Semigroups of Linearly Realizable Finite Automata II
A type safe state abstraction for coordination in Java -like languages
Index appearance record with preorders
Lamplighter groups and automata
Structural operational semantics and bounded nondeterminism
Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems
A Unified View of the Complexity of Evaluation and Interpolation
Termination of nondeterministic quantum programs
Context Free Derivations on Word Monoids
A Network for the Detection of Words in Continuous Speech
Pushdown automata and constant height: decidability and bounds
Task Allocation in Fault-Tolerant Distributed Systems
Scheduling Saves in Fault-Tolerant Computations
Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs
A new natural structural congruence in the pi-calculus with replication
Observable liveness of Petri nets
Performance Considerations in the Parallel Execution of Numerical Algorithms on two Processors
The size of random bucket trees via urn models
A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases
Special issue: selected papers from the 21st international symposium on temporal representations and reasoning (TIME-2014)
Short Proofs for Tricky Formulas
An Endogenous Priority Model for Load Control in Combined Batch-Interactive Computer Systems
On the Scalability and Mean-Time to Failure of k Resilient Protocols
Size-depht Tradeoff in Non-monotone Boolean Formulae
Adding a path connectedness operator to FO+poly (linear)
Program Proving: Jumps and Functions
A Workload Model Representative of Static and Dynamic Characteristics
Fooling a Two-Way Nondeterministic Multihead Automaton with Reversal Number Restriction
A general account of coinduction up-to
Factorisation of transition systems
Apex Graph Grammars and Attribute Grammars
A Specification Technique Based on Predicate Transformers
Reachability analysis of linear systems
Performance Evaluation of Fork and Join Synchronization Primitives
Unconditional Transfer in Regulated Rewriting
An Analytic Storage Allocation Model
Maintaining Range Trees in Secondary Memory. Part I: Partitions
Information Theoretic Approximations for the M/G/ 1 Retrial Queue
Balancing m-ary search trees with compressions on the fringe
Synthesizing efficient systems in probabilistic environments
Familles de langages translatables et fermées par crochet
Two Impossibility Theorems on Behaviour Specification of Abstract Data Types
The ELL(1) Parser Generator and the Error Recovery Mechanism
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
Controlled finite automata
Subsequence versus substring constraints in sequence pattern languages
Modular Correctness Proofs of Behavioural Implementations
A Survey of Normal Form Covers for Context Free Grammars
Lower Bounds on Space Complexity for Contextfree Recognition
Reversibility for stateless ordered RRWW-automata
Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata
Hierarchy Theorems for Two-Way Finite State Transducers
Complexity Theory and the Operational Structure of Algebraic Programming Systems
On decidability of LTL model checking for process rewrite systems
Semantics, calculi, and analysis for object-oriented specifications
Termination Conventions and Comparative Semantics
Extended Nested Relations
Proving Finiteness of CCS Processes by Non-Standard Semantics
Richer interface automata with optimistic and pessimistic compatibility
Optimal covers in the relational database model
M-Nets: An Algebra of High-Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages
Problematic Features of Programming Languages: A Situational-Calculus Approach
A Recursive Second Order Initial Algebra Specification of Primitive Recursion
Equivalence of the Gries and Martin Proof Rules for Procedure Calls
A Proof Method for Cyclic Programs
The Method of Attributes for Data Flow Analysis: Part II. Demand Analysis
Partial Abstract Types
Querying Sequence Databases with Transducers
The Merlin-Randell Problem of Train Journeys
Nonterminals Versus Homomorphisms in Defining Languages for Some Classes of Rewriting Systems
Temporal Predicat Transformers and Fair Termination
Purely Top-Down Updating Algorithms for Stratified Search Trees
Bin Packing: Maximizing the Number of Pieces Packed
Some Order Dimension Bounds for Communication Complexity Problems
Edge-Disjoint Spanning Trees and Depth-First Search
On integer linear programs for treewidth based on perfect elimination orderings (extended version)
One-sided random context grammars
Simulation Output Analysis for Local Area Computer Networks
Dependency Preservation in Semantic Databases
The Equivalence of Horn and Network Complexity for Boolean Functions
A note on the factorization conjecture
Tracy, traces, and transducers: computable counterexamples and explanations for HyperLTL model-checking
safeDpi: a language for controlling mobile code
Transformational Methods and their Application to Complexity Problems
Adaptive sorting: an information theoretic perspective
Transducer degrees: atoms, infima and suprema
Solving HPP and SAT by P Systems with Active Membranes and Separation Rules
Remarks on R. D. Tennent's Language Design Methods Based on Semantic Principles: Algol 68, A Language Designed Using Semantic Principles
How to allocate review tasks for robust ranking
Correctness of Semantic Integrity Checking in Database Management Systems
An Analysis of a Contention Resolution Algorithm: Another Approach
Performance Analysis of Multiprocessor Systems Containing Functionally Dedicated Processors
Predicative Methodology
Characteristic invariants in Hennessy-Milner logic
The longest letter-duplicated subsequence and related problems
Early action in an Earley parser
A linear-time branching-time perspective on interface automata
The Paging Drum Queue: A Uniform Perspective and Further Results
Alternating complexity of counting first-order logic for the subword order
Converting Untyped Formulas to Typed Ones
The Linear Landscape of External Contextual Languages
The Implementation of Retention in a Coroutine Environment
A Performance Guarantee for the Greedy Set-Partitioning Algorithm
Guiding Craig interpolation with domain-specific abstractions
Binary Search Trees of Almost Optimal Height
The Design of a Portable Programming Language
Relaxed balance for search trees with local rebalancing
Prescribed Teams of Grammars
Partial (Set) 2-Structures. Part I: Basic Notions and the Representation Problem
Non-deterministic Data Types: Models and Implementations
Special issue on "Combining Compositionality and Concurrency": part 1
Program-Substitution and Admissibility of Rules in Algorithmic Logic
A Transformation System for Concurrent Processes
On regular tree languages and deterministic pushdown automata
Ein Modell des P=NP -Problems mit einer positiven Lösung
Domain Independence and the Relational Calculus
On the power of deep pushdown stacks
Formes de langages et de grammaires
Parameterized synthesis of self-stabilizing protocols in symmetric networks
Dependability Evaluation of Hierarchical Systems
A Direct Complement Construction for LR(1) Grammars
Minimal Communication Cost Software Construction in the Internet Environment
Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
Language Design Methods Based on Semantic Principles
Concurrent abstract state machines
Proving Properties of Pascal Programs in MIZAR 2
Analysis of range search for random k-d trees
Off-the-shelf automated analysis of liveness properties for just paths
Birkhoff-von Neumann quantum logic as an assertion language for quantum programs
The Behaviour of a Single-Queue in a General Queueing Network
Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing
Efficiently building a parse tree from a regular expression
General Purpose Schedulers for Database System
Attribute (Re)evaluation in OPTRAN
Visibly rational expressions
Data structures for order-sensitive predicates in parallel nondeterministic systems
Reduced Constants for Simple Cycle Graph Separation
Some Efficient Computational Algorithms Related to Phase Models
Relational structures model of concurrency
Sufficient-Completeness, Ground-Reducibility and their Complexity
Remarks on "A Synthesis of Several Sorting Algorithms" by John Darlington
Some results on the Collatz problem
Synchronous cooperation for explicit multi-threading
Regular numeral systems for data structures
Inhibitionsfelder
Regenerative Simulation of Response Times in Networks of Queues with Multiple Job Types
Correction: Birkhoff-von Neumann quantum logic enriched with entanglement quantifiers: coincidence theorem and semantic consequence
Event algebra for transition systems composition application to timed automata
Models for Reactivity
Ianov Pushdown Schemes Are Contained in Boolean Recursive Schemes
Asymptotic Expansions of the Mergesort Recurrences
Geometrical Tools to Map Systems of Affine Recurrence Equations on Regular Arrays
Regular and context-free nominal traces
Klaus Samelson
Finding the k Most Vital Edges with Respect to Minimum Spanning Tree
A trace-based service semantics guaranteeing deadlock freedom
Minimal Coverings for Incompletely Specified Sequential Machines
Timing and Causality in Process Algebra
Algebraic reasoning for probabilistic action systems and while-loops
Shortest characteristic factors of a deterministic finite automaton and computing its positive position run by pattern set matching
Preface for the special issue "FM15"
On Parsing Two-Level Grammars
A Three-Stage Construction for Multiconnection Networks
On Problems with Short Certificates
First-Order Identities as a Defining Language
Even faster generalized LR parsing
A Hierarchy of Uniquely Parsable Grammar Classes and Deterministic Acceptors
Transformational Design of Real-Time Systems. Part II: From Program Specifications to Programs
Reducing non-determinism in right nulled GLR parsers
The Verification and Synthesis of Data Structures
Is Text Compression by Prefixes and Suffixes Practical?
Addendum to Null Values in Nested Relational Databases
Modeling Data-Intensive Reactive Systems with Relational Transition Systems
Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence
On Computing the Transitive Closure of a Relation
On using data abstractions for model checking refinements