yusuke1997/dblp-id-title huggingface dataset:
Algorithms solving path systems
Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings
Languages Defined by Generalized Equality Sets
Analogies of PAL and COPY
On Approximate Solution of the Problem of Equivalent Transformations of Programs
Specification Patterns and Proofs for Recursion through the Store
Modifying the Upper Bound on the Length of Minimal Synchronizing Word
The Equational Logic of Iterative Processes
Some Universal Algebraic and Model Theoretic Results in Computer Science
Structural Equivalences and ET0L Grammars (Extended Abstract)
A grammatical model for the top-down design of structured programs
Invariants of grammartransformations
Computing Subset Vertex Covers in H-Free Graphs
On the Expressiveness of Asynchronous Cellular Automata
Complexity of Conformant Election Manipulation
Grammar Systems as Language Analyzers and Recursively Enumerable Languages
Diophantine Complexity
Local Testing of Message Sequence Charts Is Difficult
The Power of Nondeterminism in Polynominal-size Bounded-width Branching Programs
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs
A Simplest Probability Model of Asynchronous Iterations
Distributed Acyclic Orientation of Asynchronous Networks
Expressive Power of LL(k) Boolean Grammars
Mathematical Structures Underlying Greedy Algorithms
Estimating a Probability Using Finite Memory (Extended Abstract)
How to Guard the Guards Themselves
Interpretations of Synchronous Flowchart Schemes
A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems
On Occurrence Net Semantics for Petri Nets with Contacts
On the Isomorphism Problem for Decision Trees and Decision Lists
On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars
A Linear-Time Heuristic for Minimum Rectangular Coverings (Extended Abstract)
Remarks on Searching Labyrinths by Automata
Depth efficient transformations of arithmetic into Boolean circuits
On the restriction of some NP-complete graph problems to permutation graphs
An Algorithm to Identify Slices, with Applications to Vector Replacement Systems
Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks
On Recursively Enumerable Subsets of N and Rees Matrix Semigroups over (Z 3 ; + )
Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus)
Products of group languages
Fundamentals of Computation Theory, 9th International Symposium, FCT '93, Szeged, Hungary, August 23-27, 1993, Proceedings
The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design
Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings
Translations Between Flowchart Schemes and Process Graphs
Two Characterizations of Finite-State Dimension
Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
Small-Space Analogues of Valiant's Classes
Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations
General Solution of Mirror Equation
On Strongly Cube-Free Omega-Words Generated by Binary Morphisms
Block Representation of Reversible Causal Graph Dynamics
Fixed-Points and Algebras with Infinitely Long Expressions, II
Kleene Theorems for Event-Clock Automata
A String-Based Model for Simple Gene Assembly
A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs
On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS
A Novel Information Transmission Problem and Its Optimal Solution
Highly Succinct Dynamic Data Structures
The Borel Hierarchy is Infinite in the Class of Regular Sets of Trees
On the Mathematics of Data Centre Network Topologies
Average-Case Analysis via Incompressibility
The Number of Fuzzy Monotone Functions
On Computing Optimal Temporal Branchings
Local Equational Logic
Efficient Parameterized Preprocessing for Cluster Editing
Degrees of Nondeterminism for Pushdown Automata
Together or Separate? Algorithmic Aggregation Problems
Random Access Machines and Straight-Line Programs
Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs
Relational Automata ina Category and their Language
Energy-Efficient Fast Delivery by Mobile Agents
Network Complexity
Computing Diverse and Nice Triangulations
Input sets of strongly connected automata
Behavioural Characterizations of Partial Order Logics
Workshop on Distributed Systems, WDS 1999, A satellite workshop to FCT 1999, Iassy, Romania, September 2-3, 1999
Forets de Greibach et homomorphismes inverses
Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems
On the Complexity of Decidable Cases of Commutation Problem for Languages
Exponential Lower Bounds for Real-Time Branching Programs
Embedding Theorem in the Algebraic Theory of Graph Grammars
On determinants, matchings, and random algorithms
A Definition of the P=NP-Problem in Categories
Real-Time Reversible Iterative Arrays
Constructive Mathematics as a Programming Logic I: Some Principles of Theory
Efficient Implementation of Structural Recursion
A Logic for Nondeterministic Functional Programs (Extended Abstract)
Easity Checked Self-Reducibility (Extended Abstract)
If P != NP Then Some Strongly Noninvertible Functions Are Invertible
Reactive Turing Machines
Some Remarks on Relational Composition in Computational Theory and Practice
On the Complexity of Elementary Periodical Functions Realized by Switching Circuites
Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report)
A Genralized Computability Thesis
A Faster and Simpler 2-Approximation Algorithm for Block Sorting
Real-time computations of two-way multihead finite automata
On Cellular Graph-Automata and Second-Order Definable Graph-Properties
Groups with a Recursively Enumerable Irreducible Word Problem
Three-Dimensional Traps and Barrages for Cooperating Automata (Extended Abstract)
Independence Results for n -Ary Recursion Theorems
Logic of complex algorithms
An Improved Approximation Algorithm for TSP with Distances One and Two
Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps
Isomorphism Completeness for Some Algebraic Structures
Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers
On the LBA Problem
Degeneration of Shimura surfaces and a problem in coding theory
Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract)
β-skeletons for a Set of Line Segments in R 2
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
The Complexity of Bicriteria Tree-Depth
Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension
The Effect of Null-Chains on the Complexity of Contact Schemes
What is Computable for Abstract Data Types?
Computations Over Infinite Groups
On the Tractability of Covering a Graph with 2-Clubs
An Action Structure for Synchronous pi-Calculus
Unifying Binary-Search Trees and Permutations
The Rectilinear Convex Hull of Line Segments
The Complexity of Error-Correcting Codes
On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
The Complexity of Universal Text-Learners
Two Way Finite State Generators
Optimal Continguous Expression DAG Evaluations
Finding d-Cuts in Probe H-Free Graphs
Faster FPT Algorithms for Deletion to Pairs of Graph Classes
On Logical Method for Counting Dedekind Numbers
Contracting Edges to Destroy a Pattern: A Complexity Study
Clique-Width for Four-Vertex Forbidden Subgraphs
Quantum Reversibility and a New Model of Quantum Automaton
Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning Process
String grammars with disconnecting
The Maximum Resource Bin Packing Problem
Regular Tree Languages Without Unary Symbols are Star-Free
Independence of linear and one-counter generators (extended abstract)
Index-Sets of Factor-Objects of the Post Numbering
Online Maximum k-Coverage
Implementation of a Universal Unification Algorithm for Macro Tree Transducers
A Delegation-based Object Calculus with Subtying
The Smoothed Analysis of Algorithms
Complexity of linear problems
Extremal Combinatorial Problems in Relational Data Base
Linear Automata and Recognizable Subsets in Free Semirings
Streaming Deletion Problems Parameterized by Vertex Cover
Stochastic Analysis of Dynamic Processes
On the Error Correcting Power of Pluralism in Inductive Inference
A Partial Order Method for the Verification of Time Petri Nets
A Simple Abstract Semantics for Equational Theories
Optimal Online Flow Time with Resource Augmentation
On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals
Distributed Infimum Approximation
Traces, Feedback, and the Geometry of Computation (Abstract)
The Rewriting Logic Semantics Project: A Progress Report
A Chriterion of Polynominal Lower Bounds of Combinational Complexity
Data Reduction for Graph Coloring Problems
Space-Efficient 1.5-Way Quantum Turing Machine
Dag Realizations of Directed Degree Sequences
Depth, Highness and DNR Degrees
Privacy in Elections: k-Anonymizing Preference Orders
Real-Time Vector Automata
Iterative Arrays with a Wee Bit Alternation
Complexity of Word Problems for HNN-Extensions
Space Efficient Algorithms for Breadth-Depth Search
Exact Algorithms for Graph Homomorphisms
The Complexity of Querying External Memory and Streaming Data
Universal Algebras and Tree Automata
The Problem of Minimal Implicating Vector
Linear Time Algorithms for Colorful 3-Rainbow Domination in Block and Cactus Graphs
On the Programs with Finite Development
Fast Algorithms for the Rooted Triplet Distance Between Caterpillars
Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting
Metrical an Ordered Properties of Powerdomains
On the Parameterized Complexity of Connected Cluster Vertex Deletion
Collapsing Recursive Oracles for Relativized Polynomial Hierarchies
A Polynomial Time Approximation Scheme for Dense MIN 2SAT
Using Determinancy of Games to Eliminate Quantifiers
Reachability in K 3, 3 -Free Graphs and K 5 -Free Graphs Is in Unambiguous Log-Space
Linear comparison complexity of the n-cube membership problem
Linear Time Algorithms for Some NP-Complete Problems on (P 5 , Gem)-Free Graphs
Regular Model Checking with Regular Relations
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words
LIFO-Search on Digraphs: A Searching Game for Cycle-Rank
Maximal Rectangular Relations
Efficient Rewriting in Cograph Trace Monoids
Minimum Consistent Subset Problem for Trees
Winning Strategies for Streaming Rewriting Games
Complexity of Sequence Encoding
On Weak-Space Complexity over Complex Numbers
On Structure Complexity of Normal Basis of Finite Field
Expressive Power of Evolving Neural Networks Working on Infinite Input Streams
Multi-dimensional Packing with Conflicts
Productivity of Stream Definitions
Vectors of Coroutines over Blikle Nets
The Implicating Vector Problem and its Applications to Probabilistic and Linear Automata
Canonical Forms of Context - Free Grammars and Position Restricted Grammar Forms
Alternation Hierarchies of First Order Logic with Regular Predicates
Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings
Are There Essentially Incomplete Knowledge Representation Systems?
Iterated Deterministic Top-Down Look-Ahead
Automatic Proof Methods for Algebraic Specifications
Reading Functions and an Extension of Kleene Theorem for some Families of Languages
Transformations de noyaux reconnaissables
Combinatorial Queries and Updates on Partial Words
On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree
Stability of linear space automata and semicontinuity of cut point languages
On Product Hierarchies of Automata
The critical complexity of all (monotone) Boolean functions and monotone graph properties
Exact and Parameterized Algorithms for the Independent Cutset Problem
Using Generating Functions to Compute Concurrency
Perfect Reconstruction of Black Pixels Revisited
Contextual Grammars with Distributed Catenation and Shuffle
Verification of Programs with Higher-Order Arrays
On the Parameterized Complexity of Cosecure Domination
A General Categorical Connection between Local Event Structures and Local Traces
Decidability Results on Plane Automata Searching Mazes
On Finite and Infinite Computations
A multiparameter analysis of the boundedness problem for vector addition systems
On the Topological Complexity of Weakly Recognizable Tree Languages
A Confluence Result for a Typed lambda-Calculus of Exception Handling with Fixed-Point
The Complexity Class Theta 2 p : Recent Results and Applications in AI and Modal Logic
Representing the Boolean OR Function by Quadratic Polynomials Modulo 6
Incremental Complexity of a Bi-objective Hypergraph Transversal Problem
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves
Best Increments for the Average Case of Shellsort
Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings
Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku
Formal Parametric Equations
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems
Dense and Disjunctive Properties of Languages
Tree-partite graphs and the complexity of algorithms
Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings
Efficiency of Monte Carlo Algorithms in Numerical Analysis
Decidability of Equivalence for Linear Letter to Letter To-down Tree Transducers
Decidability of omaega-Trees with Bounded Sets - A Survey
The Equivalences Problems for Binary EOL-Systems are Decidable
Some Observations on Dynamic Random Walks and Network Renormalization
On the Optimal Compression of Sets in PSPACE
On the Complexity of Finding a Largest Common Subtree of Bounded Degree
Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems
Optimal, Distributed Decision-Making: The Case of No Communication
Algorithms for Graphs Embeddable with Few Crossings Per Edge
Automata and planar graphs
On the Temporal Complexity of Boolean Mappings Realizations iin Two-dimensional Homogeneous Automata
The Complexity of Semilinear Problems in Succinct Representation
Verbal Operation on Automaton
Context-Free Languages of Infinite Words As Least Fixpoints
Axiomatization of the Coherence Property for Categories of Symmetries
Minimal Disconnected Cuts in Planar Graphs
Determining the Metric Dimension of K a ˟ K b ˟ K c by Static Black-Peg Mastermind
Machines and their behaviour in a category
Maximal and Minimal Scattered Context Rewriting
On the Hierarchy of Nondeterministic Branching k-Programs
The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited
Principal Types for Nominal Theories
Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL
The Analysis of Concurrent Logic Control Algorithms
Characterizing Composability of Abstract Implementations
On the Complexity of Realizing Some Systems of the Functions of the Algebra of Logic by Contact and Generalized Contact Circuits
Restrictive Acceptance Suffices for Equivalence Problems
Property Testing and the Branching Program Size of Boolean Functions
On Computing a Center Persistence Diagram
About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions
Functorial Semantics of the Type Free lambda-beta eta Calculus
How Hard is to Compute the Edit Distance
A Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider
Towards Axiomatic Basis of Inductive Inference
Logics Which Capture Complexity Classes over the Reals
Fundamentals of Computation Theory - 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings
Approximating Graphs by Graphs and Functions (Abstract)
Input-Driven Languages are Recognized in log n Space
A Fast Construction oF Disjoint Paths in Communication Networks
On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation
On Development of Dialogue Concurrent Systems
Nearest Fixed Points and Concurrent Priority Games
Growing Patterns in 1D Cellular Automata
Dense Families and Key Functions of Database Relation Instances
The Equivalence of Pebbles and Sensing Heads for Finite Automata
Some Algebraic Aspects of Recognizability and Rationality
Five Facets of Hyperedge Replacement Beyond Context-Freeness
Parameterized Complexity of Weak Odd Domination Problems
Constructing Sparse t-Spanners with Small Separators
Token Jumping in Minor-Closed Classes
Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem
Bounded Set Theory and Polynominal Computability
Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic
Synchronization of 1-Way Connected Processors
Partially-additive semantics: A progress report
Differential Resultants and Subresultants
On One Approximate Algorithm for Solving Systems of Linear Inequalities with Boolean Variables
A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity
Optimal Channel Utilization with Limited Feedback
Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities
The Reducibility of Random Sequences by Automata
Observability and Nerode Equivalence in Concrete C5ategories
Improved Approximation Algorithms for Constrained Fault-Tolerant Resource Allocation - (Extended Abstract)
Conjunctive Visibly-Pushdown Path Queries
Chain-like Model of Programs Communication
Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings
On Complementation of Nondeterministic Finite Automata Without Full Determinization
Hunting Distributed Malware with the κ-Calculus
Nets over Many Sorted Operator Domains and Their Semantics
A Type System for Computationally Secure Information Flow
Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings
Applicability of a Production in a Categorical Grammar
On the Complexity of Lie Algebras
An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration
Directed Graphs of Entanglement Two
A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings
Contextuality in Multipartite Pseudo-Telepathy Graph Games
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case
Compositional Homomorphisms of Relational Structures
Coloring Graphs without Short Cycles and Long Induced Paths
Polynomial Kernels for Proper Interval Completion and Related Problems
On machine maps in categories
Automata and Their Interaction: Definitional Suggestions
Pythagorean Triples in Unification Theory of Nilpotent Rings
Normal and Sinkless Petri Nets
Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs
Approximation Algorithms for Fractional Covering and Packing Problems, and Applications
α-β-Factorization and the Binary Case of Simon's Congruence
Functions That Preserve p-Randomness
Conditions for Existence of Nontrivial Parallel Decompositions of Sequential Machines
On Polya series in noncommuting variables
Bivariate B-Splines from Convex Pseudo-circle Configurations
On equivalence of safe Petri nets
The Power of Frequency Computation (Extended Abstract)
Continuous abstract data types: basic machinery and results
About Connections Between Syntactical and Computational Complexity
Approximation Algorithms for Channel Assignment in Cellular Radio Networks
Partially Ordered Sets Corresponding to the Partition Problem
Deterministic Automata on Unranked Trees
Finding Maximum Convex Polygons
Pattern Matching in Protein-Protein Interaction Graphs
Several algorithms for finite algebras
On the Complexity of Graph Reconstruction
Largest Common Prefix of a Regular Tree Language
Array processing machines
Factorisation Forests for Infinite Words
Quasi-Equational Logic for Partial Algebras
On the Standard and Pseudostandard Star Height of Regular Sets
On compilation of parallel programs
Combinatorics of Palindromes
Adaptive and Compact Discretization for Weighted Region Optimal Path Finding
Empty - Storage - Acceptance of omega-Languages
Linear Test Procedures of Recognition
Some Time-Space Bounds for One-Tape Deterministic Turing Machines
Modeling Interaction by Sheaves and Geometric Logic
The average depth of a prefix of the Dycklanguage D$
First Order Dynamic Logic with Decidable Proofs and Workable Model Theory
Non-Generable RE Sets
Effective Lower Bounds for Complexity of Some Classes of Schemes
Computational Complexity of Computing a Quasi-Proper Equilibrium
Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version)
Optimal versus Stable in Boolean Formulae
The complexity of embedding graphs into binary trees
On Polynomial Ideals, Their Complexity, and Applications
Implicit definability of algebraic structures by means of program properties
Reconfiguring Planar Perfect Matchings via Bounded Length Alternating Cycles
Arsenals and Lower Bounds
Translational Lemmas for Alternating TMs and PRAMs
About Planar Cayley Graphs
Intersecting two polyhedra one of which is convex
The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions
Simulating in research of functional equivalence of programs (on structure and problematics of program schemas' theory)
Dummy Elimination: Making Termination Easier
A Study of the Binary and Boolean Rank of Matrices with Small Constant Real Rank
Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps
On Finding Acyclic Subhypergraphs
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time
Approximation Algorithms for Counting Problems in Finite Fields
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems
Maximum Covering with D Cliques
The Effect of Homogeneity on the Complexity of k-Anonymity
Vertex Ordering with Precedence Constraints
New Simulations between CRCW PRAMs
Parameterized Algorithms for Editing to Uniform Cluster Graph
Constructivity, Computability, and Computational Complexity in Analysis
Disjointness, Inclusion, and Regularity of ømega-Rational Trace Languages - Extended Abstract -
New Results on Routing via Matchings on Graphs
A Note on Powerdomains and Modalitiy
On a Theory of Inductive Inference
The Satisfiability Problem for a Quantitative Fragment of PCTL
Extension of Some Edge Graph Problems: Standard and Parameterized Complexity
Kernelization: An Overview
On the Problem of Completeness for the Regular Mappings
Specifying Algebraic Data Types by Domain Equations
Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings
On Random Betweenness Constraints
Deductive Program Synthesis and Markov's Principle
The Computational Complexity of Monotonicity in Probabilistic Networks
A Two-Dimensional Hierarchy for Attributed Tree Transducers
Valency-Based Consensus Under Message Adversaries Without Limit-Closure
Inapproximability Results for Bounded Variants of Optimization Problems
The complexity of distributive computations
On the Capabilities of Alternating and Nondeterministic Multitape Automata
On Checking Correctness of Some Classes of Control Systems
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates
Correcting Sorted Sequences in a Single Hop Radio Network
Simulations Between Different Models of Parallel Computers
Tape Complexity of Word Problems