yusuke1997/dblp-id-title huggingface dataset:
The Powerset Operator on Abstract Interpretations
Online learning of smooth functions
Correlation bounds and #SAT algorithms for small linear-size circuits
On the approximability of robust network design
Formal Specification of Parallel SIMD Execution
A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over Z/pZ
Total coloring of embedded graphs with maximum degree at least seven
Competitive perimeter defense in linear environments
Finite Automata and Unary Languages
A framework for generating some discrete sets with disjoint components by using uniform distributions
Parallel-machine scheduling of simple linear deteriorating jobs
Skew circuits of small width
Coalgebraic constructions of canonical nondeterministic automata
On the polyhedral complexity of the integer points in a hyperball
High fault-tolerant performance of the divide-and-swap cube network
Modelling and analysis of biological systems: - Based on papers presented at the Workshop on Membrane Computing and Biologically Inspired Process Calculi (MeCBIC) held in 2008 (Iasi), 2009 (Bologna) and 2010 (Jena)
Parameterized algorithms for the spanning forest isomorphism and containment on tree
A first-order one-pass CPS transformation
Balanced substructures in bicolored graphs
Faster space-efficient STR-IC-LCS computation
Complexity results on register context-free grammars and related formalisms
Complexity insights of the Minimum Duplication problem
Growth-sensitivity of context-free languages
Off-line and on-line algorithms for closed string factorization
Verify heaps via unified model checking
The cost of offline binary search tree algorithms and the complexity of the request sequence
Voronoi diagram with visual restriction
A trusted effective approach for forecasting the failure of data link and intrusion in wireless sensor networks
Generalisations of matrix partitions: Complexity and obstructions
A 2 O ( k ) n algorithm for k -cycle in minor-closed graph families
Localities in systems with a/sync communication
Deadness and how to disprove liveness in hybrid dynamical systems
Distributed temporal logic for the analysis of security protocol models
Minimizing finite automata is computationally hard
The game of Cops and Eternal Robbers
Characterization of networks supporting multi-dimensional linear interval routing schemes
Formal analysis of PIN block attacks
Constructive Universal Algebra: An Introduction
Methode de col et lois limites en analyse combinatoire
On the complexity of local-equitable coloring of graphs
Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks
Adversarial queuing theory with setups
Weighted Graphs: A Tool for Studying the Halting Problem and Time Complexity in Term Rewriting Systems and Logic Programming
Quick greedy computation for minimum common string partition
Maximal Superpositions of Horizontally Convex Polyominoes
On partially blind multihead finite automata
Growth Problems for Avoidable Words
Erratum to: "Synthesis of multi-qudit hybrid and d-valued quantum logic circuits by decomposition" [TCS 367 (3) (2006) 336-346]
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
A combinatorial error bound for t-point-based sampling
Annotated Nonmonotonic Rule Systems
Exact and approximate balanced data gathering in energy-constrained sensor networks
Running time analysis of the (1+1)-EA for robust linear optimization
A lower bound for constant-size local certification
An Approximation Scheme for Scheduling Independent Jobs into Subcubes of a Hypercube of Fixed Dimension
Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
The supercover of an m-flat is a discrete analytical object
Online optimization of busy time on parallel machines
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches
On Recursive Path Ordering
Information Flow in Tabular Interpretations for Generalized Push-Down Automata
Average-Case Analysis of Unification Algorithms
A logical characterization of timed regular languages
Testing data processing-oriented systems from stream X-machine models
On minimal elements of upward-closed sets
Parameterized and subexponential-time complexity of satisfiability problems and applications
Transformations and Confluence for Rewrite Systems
On the teaching complexity of linear sets
What is the coalgebraic analogue of Birkhoff's variety theorem?
Algorithms for Determining Relative Inclusion Star Height and Inclusion Star Height
Approximation hardness of domination problems on generalized convex graphs
A Comparison between Algebraic Query Languages for Flat and Nested Databases
Intuitionistic Propositional Logic is Polynomial-Space Complete
Asymptotics and random sampling for BCI and BCK lambda terms
The h -edge tolerable diagnosability of balanced hypercubes
Kernels of seminorms in constructive analysis
On the number of hexagonal polyominoes
Complexity issues for timeline-based planning over dense time under future and minimal semantics
Energy parity games
Component edge connectivity of hypercube-like networks
Discrete Newton methods for the evacuation problem
Strict partitions and discrete dynamical systems
Optimal Simulation of Two-Dimensional Alternating Finite Automata by Three-Way Nondeterministic Turing Machines
Rational omega-Languages are Non-Ambiguous
A game-theoretic approach to fault diagnosis and identification of hybrid systems
Evaluation Transform
Square-free shuffles of words
Transition complexity of language operations
On a conjecture about finite fixed points of morphisms
Almost Optimal Sublinear Time Parallel Recognition Algorithms for Three Subclasses of Context Free Languages
Geometric spanner games
A note on first-order projections and games
An Algebraic Structure for Derivations in Rewriting Systems
Designware: Software Development by Refinement
Constructions of 2-resilient rotation symmetric Boolean functions through symbol transformations of cyclic Hadamard matrix
Theory of evolutionary computation - Special Issue Editorial
M. J. Fischer: On the Complexity of 2-Output Boolean Networks
Decentralized dynamics for finite opinion games
On the Role of Memory in Object-Based and Object-Oriented Languages
Polyominoes simulating arbitrary-neighborhood zippers and tilings
The finite graph problem for two-way alternating automata
Optimal time data gathering in wireless networks with multidirectional antennas
On the Greatest Fixed Point of a Set Functor
Construction of minimal deterministic finite automata from biological motifs
Nontrivial Monotone Weakly Symmetric Boolean Functions with Six Variables are Elusive
Constructions of balanced odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity
Transposing G to C ♯ : Expressivity of generalized algebraic data types in an object-oriented language
Choosing selection pressure for wide-gap problems
Erratum to "Optimal estimation on the order of local testability of finite automata" - [TCS 231(2000) 59-74]
Balance properties of multi-dimensional words
A Note on Natural Complete Sets and Gödel Numberings
A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer
Simple permutations: Decidability and unavoidable substructures
Fast periodic correction networks
On boolean lowness and boolean highness
The parameterized complexity of welfare guarantees in Schelling segregation
Partitioning a Graph in O(|A| log2 |V|)
A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic VS. LL(k) Grammars
Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks
Approximation algorithms for the dynamic k -level facility location problems
A note on approximate Nash equilibria
A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
The robustness of stability under link and node failures
List version of L ( d , s )-labelings
Dynamical Properties of PWD0L Systems
Towards a quantum World Wide Web
On group-characterizability of homomorphic secret sharing schemes
Optimal conclusive sets for comparator networks
Probabilistic pursuits on graphs
The passport control problem or how to keep a dynamic service system load balanced?
A Nim game played on graphs II
The Complexity of a Multiprocessor Task Assignment Problem without Deadlines
Multiplicative complexity of vector valued Boolean functions
A relaxed condition for avoiding the occur-check
Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
Training Sequences
Strong normalization of ML F via a calculus of coercions
On the Covering Problem for Left-Recursive Grammars
Nondeterminacy and Recursion via Stacks and Games
On the Rank of the Subsets of a Free Monoid
Continuations in Possible-World Semantics
Parameterized complexity of completeness reasoning for conjunctive queries
On the Mutual-Exclusion Problem - A Quest for Minimal Solutions
Complexity of DNA sequencing by hybridization
Sequences of words defined by two-way transducers
The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles
On the road to the weakest failure detector for k-set agreement in message-passing systems
Analysis of Dynamic Algorithms in Knuth's Model
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
An Algorithm Deciding Functional Equivalence in a New Class of Program Schemes
Homomorphisms and inverse homomorphisms on graph-walking automata
Which Kleene Semigroups are Finite?
Colouring a dominating set without conflicts: q -Subset Square Colouring
Regular Semigroups with D = R as Syntactic Monoids of Prefix Codes
Rapid almost-complete broadcasting in faulty networks
Matching preclusion number in product graphs
Clifford gates in the Holant framework
Strictly-upward Drawings of Ordered Search Trees
Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
Numerical factorization of multivariate complex polynomials
Literal Shuffle
Paths to trees and cacti
Optimal Parallel Algorithms for Path Problems on Planar Graphs
Two Results on Linear Embeddings of Complete Binary Trees
The Local Detection Paradigm and Its Application to Self-Stabilization
Graphs of plural cuts
Renewal theory in the analysis of tries and strings
Two polygraphic presentations of Petri nets
Equitable colorings of bounded treewidth graphs
A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs
Sur la topologie d'un plan arithmétique
Fine and Wilf's Theorem for Three Periods and a Generalization of Sturmian Words
Discrete Lawvere theories and computational effects
FUN with algorithms
Edge colorings of planar graphs without 5-cycles with two chords
Concrete Domains
Verifiable attribute-based multi-keyword search scheme with sensitive information hiding for cloud-assisted e-healthcare sharing systems
Constructibility and decidability versus domain independence and absoluteness
Minimum-cost delegation in service composition
Set Intersection and Sequence Matching with mismatch counting
On Prouhet's solution to the equal powers problem
Balanced stable marriage: How close is close enough?
Union of shadows
A General Context-Free Parsing Algorithm Running in Linear Time on Every LR (k) Grammar Without Using Lookahead
Approximate core allocations for edge cover games
On a Representation of Tree Automata
Learnability with Respect to Fixed Distributions
Controlled non-uniform random generation of decomposable structures
Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditions
NP-completeness for calculating power indices of weighted majority games
Golden games
On Robson's convergence and boundedness conjectures concerning the height of binary search trees
Listing all potential maximal cliques of a graph
Two equational theories of partial words
Synchronization modulo P in dynamic networks
Topological abstraction of higher-dimensional automata
Relational structures for concurrent behaviours
Data exchange: semantics and query answering
A generalized attack on RSA type cryptosystems
BOTTOM-UP-HEAPSORT, a New Variant of HEAPSORT, Beating, on an Average, QUICKSORT (if n is not Very Small)
Language-theoretic problems arising from Richelieu cryptosystems
Context-Free Like Restrictions on Selective Rewriting
Sampling polynomial trajectories for LTL verification
A Proof of Ehrenfeucht's Conjecture
Principles of Programming with Complex Objects and Collection Types
Repetitive perhaps, but certainly not boring
Subtraction games in more than one dimension
CoFI with Don Sannella
A comparison of semantic models for noninterference
Theory of interaction
Pfaffian orientations and perfect matchings of scale-free networks
Multipass automata and group word problems
The complexity of bicriteria tree-depth
Algebraic theory on shortest paths for all flows
Online scheduling with reassignment on two uniform machines
Leaf realization problem, caterpillar graphs and prefix normal words
The Parallel Numerical Method of Mechanical Theorem Proving
Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k
On the Complexity of 1-Tape ATMs and Off-line 1-Tape ATMs Running in Constant Reversals
Unified graphical co-modeling, analysis and verification of cyber-physical systems by combining AADL and Simulink/Stateflow
Conflict complexity is lower bounded by block sensitivity
Testing DNA code words properties of regular languages
A logic of plausible justifications
Competitive and deterministic embeddings of virtual networks
Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments
Finite-Automaton Aperiodicity is PSPACE-Complete
A fast algorithm for data collection along a fixed track
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Sense of direction in distributed computing
Strategies for parallel unaware cleaners
Fixed Topology Steiner Trees and Spanning Forests
Descriptive complexity of qcb0-spaces
Convergence of the non-uniform Physarum dynamics
Linear Embedding for a Quantitative Comparison of Language Expressiveness
Hash function design for cloud storage data auditing
Unique key Horn functions
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
Analysis of Petri Nets by Partitioning: Splitting Transitions
A model learning based testing approach for kernel P systems
A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle
Subnetwork reliability analysis about complete-transposition graph networks
Connection methods in linear logic and proof nets construction
A characterization theorem for injective model classes axiomatized by general rules
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
Single-machine scheduling under the job rejection constraint
On Complete Sets of Samples for Generalized Regular Expressions
Fixed-parameter algorithms for scaffold filling
Design and analysis of periodic multiple seeds
Preface for the special issue of Theoretical Computer Science in honor of the 60 th birthday of Yuxi Fu
Nest Sets and Relativized Closure Properties
Embeddings of Binary Trees in Lines
Semantics of Finite Delay
Parallel algorithms for Burrows-Wheeler compression and decompression
On the transition graphs of turing machines
Fully Abstract Models of Typed lambda -Calculi
La Reconnaissance des Facteurs d'un Langage Fini dans un Texte en Temps Lineaire
Degrees of Parallelism in the Continuous Type Hierarchy
Alignment distance of regular tree languages
Another generalization of abelian equivalence: Binomial complexity of infinite words
A Compositional µ-Calculus Proof System for Statecharts Processes
CERES: An analysis of Fürstenberg's proof of the infinity of primes
A Space Efficient Algorithm for Finding the Best Nonoverlapping Alignment Score
The compatibility of the minimalist foundation with homotopy type theory
Object-oriented hybrid systems of coalgebras plus monoid actions
Universality and programmability of quantum computers
Fast BWT in small space by blockwise suffix sorting
Largest triangle inside a terrain
Opinion formation games with dynamic social influences
Dense open-shop schedules with release times
Computing the center of uncertain points on cactus graphs
Reconstruction of interval graphs
From modal logic to terminal coalgebras
Undecidability of performance equivalence of Petri nets
Contract-based discovery of Web services modulo simple orchestrators
On the Form Equivalence of L -Forms
On conditional fault tolerance of hierarchical cubic networks
CSP, partial automata, and coalgebras
Extending the metric dimension to graphs with missing edges
Bisimulation indexes and their applications
Derivation of Efficient Programs for Computing Sequences of Actions
Bi-criteria and approximation algorithms for restricted matchings
Robustly reusable fuzzy extractor from isogeny
Approximability of the capacitated b-edge dominating set problem
Pattern matching with pair correlation distance
On reconfigurability of target sets
Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings
DLS-trees: A model of evolutionary scenarios
Compressing table data with column dependency
Priority evacuation from a disk: The case of n ≥ 4
Node replacement graph grammars with dynamic node relabeling
On Pi_2 Theories of hp-T Degrees of Low Sets
Locally Commutative Power Semigroups and Counting Factors of Words
Formal Validation of Data-Parallel Programs: A Two-Component Assertional Proof System for a Simple Language
Reconstruction of domino tiling from its two orthogonal projections
On the obfuscation complexity of planar graphs
Fan-planarity: Properties and complexity
Model-order reduction of ion channel dynamics using approximate bisimulation
Text sparsification via local maxima
The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable
Explicit fusions
Parametric lambda -theories
Leakage resilient one-way functions: The auxiliary-input setting
Quotients and atoms of reversible languages
Algorithms and Computation (ISAAC 2012)
Theory of one-tape linear-time Turing machines
Generalization of the Ginsburg-Rice Schützenberger Fixed-Point Theorem for Context-Sensitive and Recursive-Enumerable Languages
Exact computation of the expectation surfaces for uniform crossover along with bit-flip mutation
Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
Burrows-Wheeler transform and palindromic richness
May I Borrow Your Logic? (Transporting Logical Structures Along Maps)
Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking
Navigable Small-World networks with few random bits
The finite power property in free groups
A generalized modal logic in causal structures
Dynamic range majority data structures
Riemann and Edalat integration on domains
A Generalized Counter Scheme
Recursive Types for Fun
Fringe analysis of synchronized parallel insertion algorithms in 2-3 Trees
Quorum sensing P systems
On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems
On the Complementation of Asynchronous Cellular Büchi Automata
Another Proof of the Intuitionistic Ramsey Theorem
Semantics of Distributed Definite Clause Programs
Peek arc consistency
Vertex-weighted realizations of graphs
On the equivalence of the static and disjunctive well-founded semantics and its computation
An automatic abstraction technique for verifying featured, parameterised systems
A Process Algebraic View of Input/Output Automata
The scientific works of Rainer Kemp (1949-2004)
Automaticity of the Hankel determinants of difference sequences of the Thue-Morse sequence
Optimally bracing grid frameworks with holes
A feedback vertex set of 2-degenerate graphs
Incremental algorithms for solving regular expression intersection non-emptiness
Theory of cellular automata: A survey
Computations with effective real numbers
Abstract Interpretation based Verification of Logic Programs
Power consumption in packet radio networks
How to meet in anonymous network
On the complexity of failed zero forcing
New approximation algorithms for the rooted Budgeted Cycle Cover problem
Simple 8-state minimal time solution to the firing squad synchronization problem
Reachability problems in BioAmbients
PSPACE-hardness of variants of the graph coloring game
Pseudo-Minimal Transducer
Génération aléatoire uniforme de mots de langages rationnels
On the Interpolation of D0L-Sequences
Beyond ω -regular languages: ωT -regular expressions and their automata and logic counterparts
Nonparametric multiple change point estimation in highly dependent time series
Rich square-free words
A compositional approach to CTL* verification
Canonical Constraints for Parameterized Data Types
Fast computations on ordered nominal sets
Automatic Generation of Finite-Element Code by Simultaneous Optimization of Expressions
A linear translation from CTL* to the first-order modal μ -calculus
On-line construction of compact suffix vectors and maximal repeats
Attribute-based proxy re-encryption from standard lattices
Modal Logics for Communicating Systems
The complexity of partition functions
On the competitive ratio of the work function algorithm for the k-server problem
Accepting Networks of Genetic Processors are computationally complete
Scheduling two-stage jobs on multiple flowshops
Comparison between the complexity of a function and the complexity of its graph
Angelic processes for CSP via the UTP
Card-based protocols for securely computing the conjunction of multiple variables
Abstract Data Types and Algebraic Semantics of Programming Languages
Component-based construction of bio-pathway models: The parameter estimation problem
Tomographic reconstruction of 2-convex polyominoes using dual Horn clauses
The Arithmetic of Reversed Positional Games
Unified temporal logic
Contextual array grammars with matrix control, regular control languages, and tissue P systems control
Exact Performance Equivalence: An Equivalence Relation for Stochastic Automata
( k , p )-planarity: A relaxation of hybrid planarity
Information Storage and Retrieval - Mathematical Foundations II (Combinatorial Problems)
On the Approximability of Some Maximum Spanning Tree Problems
Fast stabbing of boxes in high dimensions
Cost analysis of object-oriented bytecode programs
A comprehensive analysis of degree based condition for Hamiltonian cycles
How to Tidy up a General Set-System by Use of Uncrossing Operations
A DNA computing inspired computational model
Bit-array-based alternatives to HyperLogLog
Fixed Points in Free Process Algebras, Part II
Efficient sample sort and the average case analysis of PEsort
Special Issue on ALT 2015: Guest Editors' Introduction
Edge-outer graph embedding and the complexity of the DNA reporter strand problem
Dynamic scheduling of parallel computations
Minimal equivalent subgraphs containing a given set of arcs
Complexity and approximation of the minimum recombinant haplotype configuration problem
On the Tiling of a Torus with Two Bars
Monad transformers as monoid transformers
Polynomial-time identification of very simple grammars from positive data
A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its Implementation
Regular languages and their generating functions: The inverse problem
On g-extra conditional diagnosability of hypercubes and folded hypercubes
Static space-times naturally lead to quasi-pseudometrics
Nonlinear neural-like P model for time series classification
Approximation algorithms for minimizing the total weighted tardiness on a single machine
Towards better models of externalities in sponsored search auctions
Independent Parallelism in Finite Copying Parallel Rewriting Systems