yusuke1997/dblp-id-title huggingface dataset:
Optimal binary search trees with costs depending on the access paths
Space-efficient algorithms for reachability in directed geometric graphs
On parameterized complexity of the Multi-MCS problem
Approximating a vehicle scheduling problem with time windows and handling times
One-visibility cops and robber on trees
Dynamic maintenance case base using knowledge discovery techniques for case based reasoning systems
Functional dependency restricted insertion propagation
Some Simplified Undecidable and NP-Hard Problems for Simple Programs
Finitary PCF is not decidable
A formal proof of the deadline driven scheduler in PPTL axiomatic system
Synchronous consensus under hybrid process and link failures
The Ajtai Random Class of Lattices
An array P system based on a new variant of pure 2D context-free grammars
Cops and Robber on some families of oriented graphs
The κ-word problem over DRH
Using quantum key distribution for cryptographic purposes: A survey
Simulating one-reversal multicounter machines by partially blind multihead finite automata
Computational complexity of normalizing constants for the product of determinantal point processes
Searching with Known Error Probability
Computability aspects for 1st-order partial differential equations via characteristics
Minimal change list for Lucas strings and some graph theoretic consequences
Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
Domain-Independent Formulas and Databases
Online multiple-strip packing
Computing the hull number in Δ-convexity
On the robustness of the approximate price of anarchy in generalized congestion games
Remarks on external contextual grammars with selection
Non-existence of linear universal drift functions
Generating bracelets with fixed content
Small Deterministic Turing Machines
Scale-free online learning
Subjective-cost policy routing
Delta_2^P-Complete Lexicographically First Maximal Subgraph Problems
Scheduling games on uniform machines with activation cost
Productivity of stream definitions
A theoretical framework for knowledge-based entity resolution
Computing Minimum with Primitive Recursion over Lists
On the hardness of inferring phylogenies from triplet-dissimilarities
Multidimensional Unrepetitive Configurations
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
Searching for gapped palindromes
On the complexity of various parameterizations of common induced subgraph isomorphism
Protean graphs with a variety of ranking schemes
An analysis of the exponential decay principle in probabilistic trust models
A fixed-parameter algorithm for dominance drawings of DAGs
A new framework for the design and analysis of identity-based identification schemes
Interval Logics and Their Decision Procedures, Part I: An Interval Logic
Refined upper bounds for right-arm rotation distances
Hardness results for three kinds of colored connections of graphs
A Matrix Extension of Winograd's Inner Product Algorithm
Target users' activation probability maximization with different seed set constraints in social networks
Cayley Automata
Contention resolution in a non-synchronized multiple access channel
On Gabbay's Temporal Fixed Point Operator
Parameterized complexity of critical node cuts
Molecular interaction
Efficient optimally lazy algorithms for minimal-interval semantics
Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
On the descriptional power of heads, counters, and pebbles
Deterministic Two-Dimensional On-Line Tessellation Acceptors are Equivalent to Two-Way Two-Dimensional Alternating Finite Automata Through 180°-Rotation
The nearest polynomial to multiple given polynomials with a given zero in the real case
A fully abstract model for the exchange of information in multi-agent systems
Concurrent Transition Systems
Payment scheduling in the Interval Debt Model
Optimal time-abstract schedulers for CTMDPs and continuous-time Markov games
A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
Nonnegative Companion Matrices and Star-Height of N -Rational Series
Coherent network partitions: Characterizations with cographs and prime graphs
Hopf Algebras and Identities in Free Partially Commutative Monoids
Bandwidth Constraints on Problems Complete for Polynomial Time
Compatibility Problems in the Development of Algebraic Module Specifications
The approximation algorithms for a class of multiple-choice problem
On the Design of Efficient RSA-based Off-line Electronic Cash Schemes
Trees and Semantics
Group Rekeying in the Exclusive Subset-Cover Framework
Preservation of Stronger Equivalence in Unfold/Fold Logic Program Transformation
Codes, orderings, and partial words
Finding the second-best candidate under the Mallows model
A Uniform Treatment of Order of Evalaution and Aggregate Update
Complexity and parameterized algorithms for Cograph Editing
Loop checking in SLD-derivations by well-quasi-ordering of goals
Decomposition and factorization of chemical reaction transducers
Linear multi-objective drift analysis
Algebraic rewritings for optimizing regular path queries
Efficient algorithms for robustness in resource allocation and scheduling problems
Community-based rumor blocking maximization in social networks: Algorithms and analysis
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
Quantum entanglement and the communication complexity of the inner product function
The computational complexity of the parallel knock-out problem
Some Results on the Deductive Structure of Join Dependencies
Complexity of Path-Forming Games
Geometric matching algorithms for two realistic terrains
Complexity of the maximum leaf spanning tree problem on planar and regular graphs
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
Event Structures and Domains
Local search for string problems: Brute-force is essentially optimal
Bandwidth on AT-free graphs
Small fast universal Turing machines
A Theory of Timed Automata
Compound Node-Kayles on paths
Kernelization for edge triangle packing and covering via a discharging method
Adding one or more equivalence relations to the interval temporal logic
Corrigendum: Towards a Theory of Local and Global in Computation
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
Nonterminal Bounded NLC Graph Grammars
On the bounded-hop MST problem on random Euclidean instances
An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs
A recognition and parsing algorithm for arbitrary conjunctive grammars
Gossiping by energy-constrained mobile agents in tree networks
Reconstructing weighted graphs with minimal query complexity
Searching in random partially ordered sets
Robust synthesis for real-time systems
Foreword: Selected Papers from ICDT 1997
Better-quasi-orderings and coinduction
Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
An infinite hierarchy induced by depth synchronization
On two problems of almost synchronizing groups
Map Theory
Strictly causal functions have a unique fixed point
Two approximate algorithms for model counting
Practical regular expression constrained sequence alignment
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
A Generalization of the Schützenberger Product of Finite Monoids
A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings
Coalgebraic Methods in Computer Science - Foreword
On dart-free perfectly contractile graphs
Structure fault-tolerance of divide-and-swap k -ary n -cube
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem
Computing the multi-string BWT and LCP array in external memory
Computing similarity between RNA structures
Minimum connected dominating sets and maximal independent sets in unit disk graphs
Full domain functional bootstrapping using the prime cyclotomic ring
On a Problem of Yekutieli and Mandelbrot about the Bifurcation Ratio of Binary Trees
On Maximal Codes with Bounded Synchronization Delay
Finding disjoint paths in networks with star shared risk link groups
Jordan curves with polynomial inverse moduli of continuity
The giant component threshold for random regular graphs with edge faults H. Prodinger
On the Connectedness of Pictures in Chain Code Picture Languages
EPTAS for the dual of splittable bin packing with cardinality constraint
Parallel time and space upper-bounds for the subset-sum problem
Undecidability of the trace coding problem and some decidable cases
Algorithmic combinatorics based on slicing posets
Sorting by reversals and the theory of 4-regular graphs
On Polynomials with Symmetric Galois Group which Are Easy to Compute
Sharp Characterizations of Squarefree Morphisms
Testing Logic Programs for Local Stratification
Fibonacci BSTs: A new balancing method for binary search trees
Recognizable Subsets of Some Partially Abelian Monoids
Alternating On-Line Turing Machines with Only Universal States and Small Space Bounds
A static analysis for Brane Calculi providing global occurrence counting information
Minimal dominating sets in graph classes: Combinatorial bounds and enumeration
Encoding 2D range maximum queries
Combination of parallel machine scheduling and vertex cover
On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
Combining word problems through rewriting in categories with products
Privacy in population protocols with probabilistic scheduling
A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model
Inferring ground truth from crowdsourced data under local attribute differential privacy
Sampling methods for shortest vectors, closest vectors and successive minima
Conditional diagnosability and strong diagnosability of Split-Star Networks under the PMC model
Parallel batch scheduling with nested processing set restrictions
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
Reliability analysis of subsystem in dual cubes
A hybrid soft computing with big data analytics based protection and recovery strategy for security enhancement in large scale real world online social networks
Bias and pathology in minimax search
Computing bond orders in molecule graphs
The chord version for SONET ADMs minimization
Flow metrics
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
Recognizing the tractability in big data computing
On derandomization and average-case complexity of monotone functions
Computational Indistinguishability: Algorithms vs. Circuits
On Pseudo-c-beta-Normal Form in Combinatory Logic
Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
Assumption/Guarantee Specifications in Linear-Time Temporal Logic
Strong matching preclusion for k -composition networks
More on weighted servers or FIFO is better than LRU
Motif matching using gapped patterns
The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs
Simplicity via provability for universal prefix-free Turing machines
Finding a minimum spanning tree with a small non-terminal set
Two-dimensional cellular automata and deterministic on-line tessalation automata
A Pushdown Automaton or a Context-Free Grammar - Which is More Economical?
Least Fixed Points Revisited
A characterization of (regular) circular languages generated by monotone complete splicing systems
The 2-surviving rate of planar graphs without 4-cycles
A new algorithm for computing the nearest polynomial to multiple given polynomials via weighted ℓ2,-norm minimization and its complex extension
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
A simple characterization of asynchronous computations
On the structure of graphs in the Caucal hierarchy
Inductive-data-type systems
Playout policy adaptation with move features
Some combinatorial results on Bernoulli sets and codes
Investigation of E-voting system using face recognition using convolutional neural network (CNN)
On the Partially Commutative Shuffle Product
Shared-object system equilibria: Delay and throughput analysis
Type-based Diagnosis of CLP Programs
Subexponential concurrent constraint programming
Algorithmic aspects of upper edge domination
The bipanconnectivity and m-panconnectivity of the folded hypercube
Balanced cut approximation in random geometric graphs
Finding small-width connected path decompositions in polynomial time
Inapproximability of survivable networks
Improved analysis of the online set cover problem with advice
Parameterized resiliency problems
A family of formulas with reversal of arbitrarily high avoidability index
Distributed distance domination in graphs with no K 2, t -minor
Refined pivot selection for maximal clique enumeration in graphs
A family of NFAs which need 2n- deterministic states
Computing Downwards Accumulations on Trees Quickly
Orphan gene finding - an exon assembly approach
Presburger liveness verification of discrete timed automata
On clonal selection
Splicing on Tree-Like Structures
Optimal Representation in Average Using Kolmogorov Complexity
A family of Nim-like arrays: The Locator Theorem
On minimum cost edge searching
Computational power of autonomous robots: Transparency vs. opaqueness
Embedding algorithm of spined cube into grid structure and its wirelength computation
Marked D0L systems and the 2n-conjecture
A Generalised Mathematical Theory of Structured Programming
From decidability to undecidability by considering regular sets of instances
Concurrent and Maximally Concurrent Evolution of Nonsequential Systems
A proof technique for parallel programs
Bounds on the efficiency of black-box commitment schemes
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
The Retracts in P omega do not Form a Continuous Lattice - A Solution to Scott's Problem
Popularity on the roommate diversity problem
NextPriorityConcept: A new and generic algorithm computing concepts from complex and heterogeneous data
A General Construction of Hyperuniverses
Finite-state dimension
Random reals as measures of natural open sets
Enumeration of subtrees of trees
A First Order Logic for Partial Functions
From adaptive renaming to set agreement
Behavioural inverse limit lambda-models
Quantum algorithms for longest common and palindromic substrings in the circuit model
Query complexity of membership comparable sets
On post correspondence problem for letter monotonic languages
Sorted dependency insertion grammars
Colored visual cryptography without color darkening
β-expansion and transcendence in F q ((x -1 ))
On BPP versus NPcoNP for ordered read-once branching programs
The first order theory of primal grammars is decidable
Mediated population protocols
Nonemptiness problems of Wang tiles with three colors
Categorial grammars with iterated types form a strict hierarchy of k-valued languages
On the Kleijn-Rozenberg k-Adjacent Languages
Optimal schedulers vs optimal bases: An approach for efficient exact solving of Markov decision processes
On the complexity of stable hypergraph matching, stable multicommodity flow and related problems
Counting dominating sets in some subclasses of bipartite graphs
Efficient and reliable post-quantum authentication
Coloring vertices of a graph or finding a Meyniel obstruction
Weights for Total Division Orderings on Strings
Two-dimensional drift analysis: Optimizing two functions simultaneously can be hard
Cryptographic logical relations
Game-theoretic analysis of Internet switching with selfish users
Approximation algorithms for connected maximum cut and related problems
On mutual concavity and strategically-zero-sum bimatrix games
Approximation algorithm for maximum edge coloring
Authenticated key agreement in dynamic peer groups
On primary and secondary repetitions in words
Witness to non-termination of linear programs
A practical algorithm to find the best subsequence patterns
A geometric interpretation of LD-resolution
Palindromic factors of billiard words
Computing longest palindromic substring after single-character or block-wise edits
Redundancy of minimal weight expansions in Pisot bases
Algebraic specification of reactive systems
Semi-online scheduling on two uniform processors
On Locally Presented Posets
Instance-optimal information-based voting
On the security of two identity-based conditional proxy re-encryption schemes
Arbitrary-size permutation networks using arbitrary-radix switches
Operational Semantics of a Kernel of the Language ELECTRE
A note on quantum divide and conquer for minimal string rotation
The Rational Index of the Dyck Language D'*-1
Meet continuity properties of posets
Term-generic logic
Restricted assignment scheduling with resource constraints
Rewriting queries using views in the presence of arithmetic comparisons
The differential lambda-calculus
Random generation of Q-convex sets
Deciding Hypergraph 2-Colourability by H-Resolution
On the derandomization of the graph test for homomorphism over groups
Characteristic morphisms of generalized episturmian words
Watson-Crick D0L systems: generative power and undecidable problems
Time efficient centralized gossiping in radio networks
Adaptive and optimal online linear regression on l 1 -balls
Stone coalgebras
A weakly mixing tiling dynamical system with a smooth model
Peirce's Rule in Natural Deduction
Nonterminal complexity of programmed grammars
Enumeration of irredundant forests
From mathematical equivalence such as Ma equivalence to generalized Zhang equivalency including gradient equivalency
Further construction of even-variable balanced rotation symmetric Boolean functions with optimal algebraic immunity
Self-Embedding Indexed Grammars
Erratum to: "A new framework for declarative programming": [Theoret. Comput. Sci. 300 (2003) 91-160]
Hardness and algorithms of equitable tree-coloring problem in chordal graphs
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
Celebrity games
On Extended P 4 -Reducible and Extended P 4 -Sparse Graphs
On the structure of equilibria in basic network formation
On Kurtz randomness
State complexity of star of union and square of union on k regular languages
Shortest paths between shortest paths
On the Ratio of Growth Functions in EDT0L Languages
Memory-limited non-U-shaped learning with solved open problems
Generation of Invertible Functions
Egalitarian roommate allocations: Complexity and stability
Minimum power partial multi-cover on a line
Ultrafilters on words for a fragment of logic
Counting the number of games
On Neciporuk's Theorem for Branching Programs
Guthrie's Problem: New Equivalences and Rapid Reductions
On the complexity of the k -kernel problem on cyclically k -partite digraphs
Distributed computation in dynamic networks via random walks
Conditional Rewrite Rules
On the power of local graph expansion grammars with and without additional restrictions
Preface: Special Issue of ICALP 2006 - dedicated to the memory of Ingo Wegener
Fast recognition of deterministic cfl's with a smaller number of processors
One-round multi-party communication complexity of distinguishing sums
Structure Preserving Elimination of Null Productions from Context-Free Grammars
Provably secure certificateless proxy signature scheme in the standard model
Stochastic runtime analysis of a Cross-Entropy algorithm for traveling salesman problems
Computational aspects of the 2-dimension of partially ordered sets
A Fast Numerical Algorithm for the Composition of Power Series with Complex Coefficients
CCA-security from adaptive all-but-one lossy trapdoor functions
The domino problem of the hyperbolic plane is undecidable
The induced matching and chain subgraph cover problems for convex bipartite graphs
Variations of checking stack automata: Obtaining unexpected decidability properties
A new algorithm for optimal 2-constraint satisfaction and its implications
Linear computation of unbordered conjugate on unordered alphabet
Lattices, closures systems and implication bases: A survey of structural aspects and algorithms
Reduction Graphs in the Lambda Calculus
Sorting algorithms for broadcast communications: mathematical analysis
Towards practical feasibility of core computation in data exchange
Computability of the Additive Complexity of Algebraic Circuits with Root Extracting
Minimum sum multicoloring on the edges of trees
The Simple Type Theory of Normalization by Evaluation
Near-gathering of energy-constrained mobile agents
Virtual raw anchor coordinates: A new localization paradigm
Deciding equivalence-based properties using constraint solving
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]
Binary matrices under the microscope: A tomographical problem
Improved edge-coloring with three colors
Mixed-case community detection problem in social networks: Algorithms and analysis
On the Complexity of the k -Chain Subgraph Cover Problem
A 5 k -vertex kernel for 3-path vertex cover
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Evacuating from ℓ p unit disks in the wireless model
Corrigendum to: "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares" [Theor. Comput. Sci. 769 (2019) 63-74]
On the complexity of list H-packing for sparse graph classes
Vertex deletion on split graphs: Beyond 4-hitting set
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Parameterized approximation algorithms for packing problems
Communication complexity in number-conserving and monotone cellular automata
Realizability models and implicit complexity
Indexing and querying color sets of images
Linearly many faults in dual-cube-like networks
Refining Multiset Tranformers
A note on busy beaver bounds
P-Optimal Heuristics
A channel assignment problem for optical networks modelled by Cayley graphs
Voronoi game on polygons
On Proof Normalization in Linear Logic
Non finite axiomatisability of weak bisimulation-based congruences
Irredundant tandem motifs
Random regular graphs with edge faults: Expansion through cores
On 2-protected nodes in random digital trees
A new order-theoretic characterisation of the polytime computable functions
Constructing dual-CISTs of folded divide-and-swap cubes
Bijections and the Riordan group
Variations on the bottleneck paths problem
On two-sided infinite fixed points of morphisms
Corrigendum to "A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time" - [TCS 202 (1998) 1-54]
Cartesian and Lyndon trees
Improved online algorithms for parallel job scheduling and strip packing
On effective construction of the greatest solution of language inequality XA ⊆ BX
Boosting over non-deterministic ZDDs
Modified Schelling games
(Imperfect) strategies to generate primitive polynomials over GF (2)
How Good is the Information Theory Bound in Sorting?
Efficient algorithms for membership in boolean hierarchies of regular languages
On the complexity of typechecking top-down XML transformations
A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms
On the Computational Power of Self-Stabilizing Systems
Design tools for reporter strands and DNA origami scaffold strands
On the average-case complexity of Berge algorithm
The Parikh counting functions of sparse context-free languages are quasi-polynomials
Efficient diagonalization of symmetric matrices associated with graphs of small treewidth
Model checking QCTL plus on quantum Markov chains
Signal extraction and knowledge discovery based on statistical modeling
Fault-free longest paths in star networks with conditional link faults
Rank inequalities and separation algorithms for packing designs and sparse triple systems
Overlapping edge unfoldings for convex regular-faced polyhedra