yusuke1997/dblp-id-title huggingface dataset:
Inverse obnoxious p -median location problems on trees with edge length modifications under different norms
On sets of indefinitely desubstitutable words
Unification in Free Distributive Lattices
Non-adaptive complex group testing with multiple positive sets
Algorithme Explicite pour la Recherche du P.G.C.D. dans certains Anneaux Principaux d'Entiers de Corps de Nombres
The minimum backlog problem
Dynamic data structures for interval coloring
Design of Abstract Domains Using First-Order Logic
On the initialization of clocks in timed formalisms
Recognizing and drawing IC-planar graphs
Decidable containment of recursive queries
Complexity Classes without Machines: On Complete Languages for UP
On logical and extensional characterizations of attributed feature models
Interpretations of Recursively Defined Types
Efficient Inference Control for Range SUM Queries
Renaming in distributed certification
A Pragmatic Approach to Reuse in Tactical Theorem Proving
Editorial - SAS'97
Energy conservation in wireless sensor networks and connectivity of graphs
The complexity of makespan minimization for pipeline transportation
Optimization of Static Traffic Allocation Policies
Learning attribute-efficiently with corrupt oracles
How many zombies are needed to catch the survivor on toroidal grids?
Competitive graph searches
Market equilibria with hybrid linear-Leontief utilities
On product covering in 3-tier supply chain models: Natural complete problems for W [3] and W [4]
An Improved Zero-One Law for Algorithmically Random Sequences
A best online algorithm for scheduling on two parallel batch machines
Quantitative Domains and Infinitary Algebras
Computation by 'While' Programs on Topological Partial Algebras
Finding minimum and maximum termination time of timed automata models with cyclic behaviour
The multi-multiway cut problem
On the Chvátal rank of the Pigeonhole Principle
The principle of least cognitive action
Asymmetry in k -center variants
Using PVS to validate the algorithms of an exact arithmetic
Commutativity in Free Inverse Monoids
Density of k-ary words with 0, 1, 2 - error overlaps
Divergence bounded computable real numbers
Forword to the Special Issue on Real Numbers and Computers
Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]
Data Types, Abstract Data Types and Their Specification Problem
All minimal prime extensions of hereditary classes of graphs
Online scheduling of time-critical tasks to minimize the number of calibrations
A multidimensional critical factorization theorem
Linear Speed-Up for Cellular Automata Synchronizers and Applications
A note on an identity-based ring signature scheme with signer verifiability
Formal properties of PA-matching
Integer k-matching preclusion of some interconnection networks
When a dollar makes a BWT
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
Collusion-resistant identity-based Proxy Re-encryption: Lattice-based constructions in Standard Model
Process Calculus Based Upon Evaluation to Committed Form
Editorial: Quantitative Aspects of Programming Languages
Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
Approximating edge dominating set in dense graphs
Varieties of Finite Monoids and Buchi-McNaughton Theorem
Algebra of Communicating Processes with Abstraction
Bounding lemmata for non-deterministic halting times of transfinite Turing machines
Data structures and algorithms for tilings I
Exact Solutions for Open, Closed and Mixed Queueing Networks with Rejection Blocking
Optimal reconfiguration of optimal ladder lotteries
ELAN from a rewriting logic point of view
A really simple approximation of smallest grammar
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs
On the approximability of robust spanning tree problems
Studying Equivalences of Transition Systems with Algebraic Tools
Relating conflict-free stable transition and event models via redex families
Query complexity of tournament solutions
On maximizing the throughput of multiprocessor tasks
Time-freeness and clock-freeness and related concepts in P systems
Parametrization of approximate algebraic curves by lines
The intersection of retracts of A*
Towards the range property for the lambda theory H
k-shortest simple paths in bounded treewidth graphs
On the treewidth of dynamic graphs
Algorithms for interactive Sprouts
A Third-Order Representation of the lambda-mu-Calculus
Linear time algorithms for weighted offensive and powerful alliances in trees
Foundational aspects of multiscale modeling of biological systems with process algebras
Effectivity questions for Kleene's recursion theorem
A Complexity Theory of Efficient Parallel Algorithms
On the size of inverse semigroups given by generators
On Guarded Recursion
Fast algorithms for the Sylvester equation AX-XB T =C
Language-theoretic problems in certain matrix monoids
Actions, wreath products of C -varieties and concatenation product
Strongly Menger connectedness of data center network and ( n , k )-star graph
Nets, Time and Space
Hardness results for multicast cost sharing
DNF tautologies with a limited number of occurrences of every variable
An Overview of Transaction Logic
Random Allocation of Jobs with Weights and Precedence
Possible worlds and resources: the semantics of BI
Approximations for Steiner trees with minimum number of Steiner points
The wide window string matching algorithm
Paths, Computations and Labels in the lambda-Calculus
On the computational power of the light: A plan for breaking data encryption standard
Palindromic language of thin discrete planes
Soft linear logic and polynomial time
The complexity of controlling candidate-sequential elections
Dual Bases and Bit-Serial Multiplication in F q n
Approximate proof-labeling schemes
Edge-fault-tolerant strong Menger edge connectivity on regular graphs
About non-monotony in Boolean automata networks
An improved lower bound for one-dimensional online unit clustering
About thin arithmetic discrete planes
On Dejean's conjecture over large alphabets
On mixed polynomials of bidegree (n, 1)
Categorical specification and implementation of Replicated Data Types
Intersecting periodic words
Compact and tractable automaton-based representations of time granularities
Undecidability of the emptiness problem for context-free picture languages
Ranks of strictly minimal reaction systems induced by permutations
Unifying theories of reactive design contracts
Constructive logical characterizations of bisimilarity for reactive probabilistic systems
Uniform-budget solo chess with only rooks or only knights is hard
On decision problems concerning contextual insertions and deletions
Interpolation of polynomials given by straight-line programs
Fast-mixed searching and related problems on graphs
Reachability Problems 2014: Special issue
On the expressiveness of linear-constraint query languages for spatial databases
Jug measuring: Algorithms and complexity
Weak lighting functions and strong 26-surfaces
Fusing Logic and Control with Local Transformations: An Example Optimization
Modular Termination of r-Consistent and Left-Linear Term Rewriting Systems
Kolmogorov complexity and combinatorial methods in communication complexity
Behavioural logics for configuration structures
Fixpoint operators for domain equations
Gemmating P systems: collapsing hierarchies
Automata and Concurrency
A Finiteness Condition for Rewriting Systems
Decidability of DPDA equivalence
Combinatorial network abstraction by trees and distances
Results on multiples of primitive polynomials and their products over GF(2)
Logic and rational languages of scattered and countable series-parallel posets
Abstract canonical presentations
Spy-game on graphs: Complexity and simple topologies
Monads, shapely functors, and traversals
The Bancomat problem: an example of resource allocation in a partitionable asynchronous system
Upper semi-lattice of binary strings with the relation "x is simple conditional to y"
On the complexity of decision using destinies in H-bounded structures
On the kernelization complexity of string problems
A relaxation of the Directed Disjoint Paths problem: A global congestion metric helps
Profinite techniques for probabilistic automata and the Markov Monoid algorithm
On benefits and drawbacks of aging strategies for randomized search heuristics
Computing minimal and maximal suffixes of a substring
Arborescence optimization problems solvable by Edmonds' algorithm
Parallel RAM Algorithms for Factorizing Words
Lyndon Words and Singular Factors of Sturmian Words
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
On time complexity for connectivity-preserving scattering of mobile robots
On the Orbits of the Product of two Permutations
Two absolute bounds for distributed bit complexity
All-pairs disjoint paths from a common ancestor in O~(n infinit ) time
Constructing NP-intermediate problems by blowing holes with parameters of various properties
L(A)=L(B)? A simplified decidability proof
String editing under pattern constraints
New results on single-machine scheduling with past-sequence-dependent delivery times
Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars
On the complexity of multiple bondage in graphs
The Number of Registers Required for Evaluating Arithmetic Expressions
Tree-shellability of Boolean functions
Improved bounds about on-line learning of smooth-functions of a single variable
P-Selectivity: Intersections and Indices
Smart PAC-learners
Parameterized complexity of broadcasting in graphs
Functional Completeness of the Mixed lambda-Calculus and Combinatory Logic
Analytic Machines
The one-dimensional Ising model: Mutation versus recombination
Bivariate complexity analysis of Almost Forest Deletion
An algorithm for the word entropy
The t / k -diagnosability and strong Menger connectivity on star graphs with conditional faults
Generalized threshold processes on graphs
Phutball is PSPACE-hard
On uniformly continuous functions for some profinite topologies
Faster and space efficient indexing for locality sensitive hashing
McNaughton families of languages
Towards a descriptive set theory for domain-like structures
On Characterizing Boundedness of Database Schemes with Bounded Dependencies
Tree-based generation of languages of fractals
Characterization of interval graphs that are unpaired 2-disjoint path coverable
Sublinear bounds for randomized leader election
Relationships Between the Dynamical Systems Associated to the Rauzy Substitutions
Strict hierarchy among Bell Theorems
Boundary properties of graphs for algorithmic graph problems
Structural properties of bounded relations with an application to NP optimization problems
Complexity of the cluster deletion problem on subclasses of chordal graphs
Computational aspects of the inverse single facility location problem on trees under l k -norm
Efficient public key encryption with equality test in the standard model
Remarks on Commutative N -Rational Series
Representing Scope in Intuitionistic Deductions
Integration of a security type system into a program logic
Complexity of Graph Embeddability Problems
A Brief History of Timed CSP
Parameterized algorithms for stable matching with ties and incomplete lists
Independent set reconfiguration under bounded-hop token jumping
Regular database update logics
Offensive alliances in signed graphs
Constraint Nets: A Semantic Model for Hybrid Dynamic Systems
Analysis of an Optimized Search Algorithm for Skip Lists
Short fail-stop signature scheme based on factorization and discrete logarithm assumptions
Foundations of a Theory of Synchronous Systems
On the asymptotic behaviour of primitive recursive algorithms
Upper and lower degree-constrained graph orientation with minimum penalty
Parameterized dictionary matching and recognition with one gap
The existence and efficiency of PMMS allocations
Recognition and drawing of stick graphs
Partial correctness for probabilistic demonic programs
Uniform proofs of standard completeness for extensions of first-order MTL
A polynomial nominal unification algorithm
Approximate Algorithms for Some Generalized Knapsack Problems
Locating-dominating sets of functigraphs
Identification of Partial Disjunction, Parity, and Threshold Functions
Locating the Contractum in the Double Pushout Approach
Resource control for synchronous cooperative threads
General Rumor Blocking: An efficient random algorithm with martingale approach
On counting untyped lambda terms
Monads and Algebras in the Semantics or Partial Data Types
Reliability and hybrid diagnosis of exchanged hypercube
2D knapsack: Packing squares
Minimal achievable approximation ratio for MAX-MQ in finite fields
Localic sup-lattices and tropological systems
Combinatorial interpretation of Kolmogorov complexity
Glance: A lightweight querying service for wireless sensor networks
Deadline scheduling and power management for speed bounded processors
On orientations maximizing total arc-connectivity
Efficient construction of maximal and minimal representations of motifs of a string
Efficient transitive closure of sparse matrices over closed semirings
On compact representations of All-Pairs-Shortest-Path-Distance matrices
Approximate NFA universality and related problems motivated by information theory
Parameterized searching with mismatches for run-length encoded strings
The sweep-line state space exploration method
Sturmian Words: Structure, Combinatorics, and Their Arithmetics
Coin-Sliding and Go
Induced-path partition on graphs with special blocks
Complexity assessments for decidable fragments of set theory. II: A taxonomy for 'small' languages involving membership
Descriptive complexity of computable sequences revisited
Rule formats for distributivity
Computing bounds on product graph pebbling numbers
The Limited Regular Languages
Some properties of the factors of Sturmian sequences
The number of valid factorizations of Fibonacci prefixes
Fast construction of wavelet trees
Can a convex polyhedron have a developable face-cycle?
Computational aspects of optimal strategic network diffusion
Tight lower bounds for query processing on streaming and external memory data
Transducing reversibly with finite state machines
Algebras, Polynomials and Programs
log-Lists and their applications to sorting by transpositions, reversals and block-interchanges
A p×p bit fraction model of binary floating point division and extremal rounding cases
Fully leakage-resilient signatures revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model
Learning recursive functions: A survey
Feedforward neural networks for compound signals
Tetris with few piece types
Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23]
Defect particle kinematics in one-dimensional cellular automata
Structure connectivity and substructure connectivity of the crossed cube
The Undecidability of the Preperfectness of Thue Systems
A Boolean Function Requiring 3n Network Size
Minimum energy broadcast on rectangular grid wireless networks
Separation of Deterministic, Nondeterministic and Alternating Complexity Classes
Semi-clairvoyant scheduling
Flow shop for dual CPUs in dynamic voltage scaling
Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions
Lightweight algorithms for constructing and inverting the BWT of string collections
Complexity and approximation for precedence constrained scheduling problems with large communication delays
Membership Problem for Embedded Multivalued Dependencies under some Restricted Conditions
Online coloring of disk graphs
Computable Concurrent Processes
General Recursive Functions in a Very Simply Interpretable Typed lambda-Calculus
Faster compressed dictionary matching
The component (edge) connectivity of shuffle-cubes
Applying Cellular Automata to Complex Environmental Problems: The Simulation of the Bioremediation of Contaminated Soils
Combinatorial model and bounds for target set selection
Speedup of Determinism by Alternation for Multidimensional Turing Machines
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
Fair division with minimal withheld information in social networks
Reliability analysis of the cactus-based networks
Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets
Artin-Schreier Curves, Exponential Sums, and Coding Theory
Solving the generalized mask constraint for test generation of binary floating point add operation
Optimal Las Vegas reduction from one-way set reconciliation to error correction
Parameterized complexity of candidate control in elections and related digraph problems
A unified approach to computing the nearest complex polynomial with a given zero
Nash equilibria with minimum potential in undirected broadcast games
Generic hardness of inversion on ring and its relation to self-bilinear map
Automatic verification of recursive procedures with one integer parameter
Dynamic path finding for multi-load agent pickup and delivery problem
Selfish cops and passive robber: Qualitative games
A universal characterization of the double powerlocale
An intermediate language for the stochastic simulation of biological systems
Online removable knapsack with limited cuts
Preface - Workshop on Optimization and Implementation of Declarative Programs
The submodularity of two-stage stochastic maximum-weight independent set problems
Properties of Complexity Measures for Prams and Wrams
Generalized substring compression
Secure computation without computers
Single machine scheduling with release dates and job delivery to minimize the makespan
On the parameterized complexity of dynamic problems
A dynamic temporal logic for quality of service in choreographic models
Quasiperiodic and Lyndon episturmian words
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms
k -Critical graphs in P 5 -free graphs
The Set of Strings Mapped Into a Submonoid by Iterates of a Morphism
Decidability of Structural Equivalence of E0L Grammars
Strongly polynomial-time truthful mechanisms in one shot
Transposing partial components - An exercise on coalgebraic refinement
A Compositional Semantic Basis for the Analysis of Equational Horn Programs
Progressive solutions to a parallel automata equation
The touring rays and related problems
How hard is it to find extreme Nash equilibria in network congestion games?
Mining for empty spaces in large data sets
Net Processes Correspond to Derivation Processes in Graph Grammars
Coexistence of Uniquely Ergodic Subsystems of Interval Mapping
The Genericity Theorem and Parametricity in the Polymorphic lambda-Calculus
Classification of Finite Monoids: The Language Approach
Efficient algorithms for the minmax regret path center problem with length constraint on trees
A local strategy for cleaning expanding cellular domains by simple robots
Quantales, finite observations and strong bisimulation
Binary (generalized) Post Correspondence Problem
Connections among nonlinearity, avalanche and correlation immunity
Finding and counting small tournaments in large tournaments
The complexity of one-agent refinement modal logic
TNFS resistant families of pairing-friendly elliptic curves
Termination of narrowing revisited
On the role of the equal partition in degree realization by a bipartite graph
Factors of characteristic words: Location and decompositions
A Complete Description for a Monoid of Deterministic Bottom-Up Tree Transformation Classes
Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures
Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
Land use and land cover change simulation enhanced by asynchronous communicating cellular automata
A 3D graphical representation of DNA sequences and its application
An algorithmic construction of union-intersection-bounded families
On average and highest number of flips in pancake sorting
On Inherently Ambiguous E0L Languages
Finding proportionally dense subgraphs of maximum size in degree-constrained graphs
Two categories of effective continuous cpos
The Subgraph Isomorphism Problem for Outerplanar Graphs
A linear time algorithm for connected p -centdian problem on block graphs
Type dependencies for logic programs using ACI-unification
Turing machines and bimachines
Double Dipping: the Case of the Missing Binomial Coefficient Identities
The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems
Matching preclusion number of graphs
Subresultants revisited
Some results on k-power-free morphisms
Efficient unfolding of contextual Petri nets
On finding a longest common palindromic subsequence
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
Quantitative Aspects of Programming Languages and Systems (2011-12)
On the binary digits of n and n 2
First-order logic axiomatization of metric graph theory
Operational equivalence for interaction nets
A Strong Pumping Lemma for Context-Free Languages
Topological 3D-manifolds: a statistical study of the cells
An improved lower bound for competitive graph exploration
Unavoidable sets
Partial Inductive Definitions
Characterizing EF and EX tree logics
On a Relationship between Graph L-Systems and Picture Languages
Equational Completion in Order-Sorted Algebras
A framework for non-interactive instance-dependent commitment schemes (NIC)
A tight threshold bound for search trees with 2-way comparisons
A General Storage Theorem for Integers in Call-by-Name lambda-Calculus
Iteration and coiteration schemes for higher-order and nested datatypes
Languages of Colonies
Construction of Voronoi Diagrams in the Plane by Using Maps
A process calculus approach to detection and mitigation of PLC malware
Parallel High-Level Replacement Systems
Complexity and approximability of the happy set problem
On the complexity of the black-and-white coloring problem on some classes of perfect graphs
Interactive information systems: Toward perception based computing
Time-Optimal Solution of the Firing-Squad-Synchronization-Problem for n-Dimensional Rectangles with the General at an Arbitrary Position
Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna
A new approach to all-pairs shortest paths on real-weighted graphs
Algorithms for computing a parameterized st-orientation
Universal enzymatic numerical P systems with small number of enzymatic rules
Combinatorial Algorithms - Preface
Accumulators: New Logic Variable Abstractions for Functional Languages
Algorithms for interval structures with applications
Confluence reduction for Markov automata
Paths in circuit graphs of matroids
Distributed distance- r covering problems on sparse high-girth graphs
The complexity of counting homomorphisms seen from the other side
Bulking II: Classifications of cellular automata
Stable Domains are Generalized Topological Spaces
A note on the problem of reporting maximal cliques
A compiler for MSVL and its applications
Succinctness of regular expressions with interleaving, intersection and counting
Playing Guess Who with your kids: Code-word strategy against adversaries
Stepped surfaces and Rauzy fractals induced from automorphisms on the free group of rank 2
Logical Definability of Fixed Points
An Algebraic Theory of Functional and Multivalued Dependencies in Relational Databases
Rice's Theorem for the Limit Sets of Cellular Automata
An Algebraically Specified Language for Data Directed Design
Probabilistic guarded commands mechanized in HOL
Traps Characterize Home States in Free Choice Systems
Improved linear problem kernel for planar connected dominating set
Preparing a (quantum) belief system
Note on the Topological Structure of Random Strings
On the complexity of minimizing interference in ad-hoc and sensor networks
Towards a language theory for infinite N-free pomsets
On the regularity of {⌊log b (αn+ β)⌋} n ≥0
Complexity Measures and Hierarchies for the Evaluation of Integers and Polynomials
D2B: A de Bruijn based content-addressable network
The proper vertex-disconnection of graphs
More on randomized on-line algorithms for caching