yusuke1997/dblp-id-title huggingface dataset:
A Parallel Algorithm for Solving the Coloring Problem on Trapezoid Graphs
A Polynomial-Time Algorithm for Knapsack with Divisible Item Sizes
Automatic Content Analysis in an On-Line Environment
Optimal Search With Positive Switch Cost is NP-Hard
The Space-Optimal Version of a Known Rectangle Enclosure Reporting Algorithm
A Complete Equational Axiomatization for Prefix Iteration
Derivation of a rotator circuit with homogeneous interconnect
A Homophonic DES
Long directed detours: Reduction to 2-Disjoint Paths
On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems
Local Search, Reducibility and Approximability of NP-Optimization Problems
Highly connected molecular graphs are rigid in three dimensions
Connectivity in a random interval graph with access points
An improved particle swarm optimization algorithm for flowshop scheduling problem
A Space Efficient Greedy Triangulation Algorithm
Minimization of Demand Paging for the LRU Stack Model of Program Behavior
The state complexity of L 2 and L k
It is Hard to Know when Greedy is Good for Finding Independent Sets
Simulating Circular Attribute Grammars Through Attribute Reevaluation
A note on disjoint cycles
Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time
Loop Cleaning
A note on the descriptional complexity of semi-conditional grammars
The Economics of Large-Memory Computations
A bisection algorithm for grammar-based compression of ordered trees
Weight-based label-unknown multi-view data set generation approach
A note on isosceles planar graph drawing
A characterization of König-Egerváry graphs with extendable vertex covers
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
Optimal Parallel Construction of Heaps
Comorphisms of structured institutions
A Simple Optimal Algorithm for Scheduling Variable-Sized Requests
A short note on Merlin-Arthur protocols for subset sum
On the Computational Power of the Floor Function
Improved Solutions to the Steiner Triple Covering Problem
On fan-crossing and fan-crossing free graphs
A note on alternating one-pebble Turing machines with sublogarithmic space
Fault diameter of Cartesian product graphs
A bivalency proof of the lower bound for uniform consensus
The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two
Nowhere-zero 3-flows in dihedral Cayley graphs
Tree edit distance with gaps
Drawing trees in a streaming model
On the relationship between squared pairings and plain pairings
Improved constructions of secret sharing schemes by applying (lambda, omega)-decompositions
On the Complexity of Vector Computations in Binary Tree Machines
On the Inadequacy of Tournament Algorithms for the N-SCS Problem
Quantitative controller synthesis for consumption Markov decision processes
Inequality of finite behaviors of rational weight finite automata is in R
Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
A note on the search for k elements via quantum walk
Some Equivalent Transformations of Recursive Programs Based on Their Schematic Properties
On Hamiltonian properties of unidirectional hypercubes
The Power of Parallel Projection
Distributed Termination Detection in Reducible Communication Graphs
Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space
Bits and Relative Order From Residues, Space Efficiently
A Tight Lower Bound on the Size of Visibility Graphs
Finding a Maximum Matching in a Circular-Arc Graph
Inexact feasibility pump for mixed integer nonlinear programming
A Hybrid Biased Random Key Genetic Algorithm for the Quadratic Assignment Problem
The Interval B-Tree
The Nonexistence of Some Covering Context-Free Grammars
Longest previous overlapping factor array
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs
Alternating Multicounter Machines with Constant Number of Reversals
Breaking an ID-based encryption based on discrete logarithm and factorization problems
Sparse Matrix Vector Multiplication on Distributed Architectures: Lower Bounds and Average Complexity Results
A Fast Equivalence-Checking Algorithm for Circular Lists
Fair Reconstruction of a Secret
On the random generation of monotone data sets
Equivalent Approximation Algorithms for Node Cover
Cryptanalysis of multivariate threshold ring signature schemes
Composing ordered sequential consistency
On error linear complexity of new generalized cyclotomic binary sequences of period p 2
Parallel Complexity of Computing a Maximal Set of Disjoint Paths
On minimising the maximum expected verification time
A Hybrid of Quicksort with O(n log n) Worst Case Complexity
Comparing approximate and probabilistic differential privacy parameters
Metric Graphs Elastically Embeddable in the Plane
The Grammatical Inference Problem for the Szilard Languages of Linear Grammars
On the Decidability of Equivalence for Deterministic Pushdown Transducers
A Fast Algorithm for Building Lattices
A new differential LSI space-based probabilistic document classifier
Memory-Efficient Enumeration of Constrained Spanning Trees
Optimal Simulation of Multidimensional Reconfigurable Meshes by Two-Dimensional Reconfigurable Meshes
Efficient Parallel Circuits and Algorithms for Division
The Behavior of Shared Objects: Concepts, Pitfalls, and a New Model
DFS-Traversing Graphs in a Paging Environment, LRU or MRU?
New Enumeration Results About the Optical Orthogonal Codes
A New Upper Bound on the Complexity of Derivative Evaluation
How rich is the structure of the intrinsic complexity of learning
Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
An O(n log n log log n) Parallel Maximum Matching Algorithm for Bipartite Graphs
Computing minimum diameter color-spanning sets is hard
On the lexicographical generation of compressed codes
Approximating the minmax rooted-tree cover in a tree
The maximum linear arrangement problem for trees under projectivity and planarity
Progress Properties for Empty UNITY Programs
Non-extendible latin parallelepipeds
Kolmogorov complexity of enumerating finite sets
On the Equivalence Covering Number of Splitgraphs
The correct diameter of trivalent Cayley graphs
General parametric scheme for the online uniform machine scheduling problem with two different speeds
Prefix-Free Languages as omega-Generators
Bounds on partial online list colouring
Data exchange: On the complexity of answering queries with inequalities
Embedding Complete Binary Trees Into Hypercubes
Deciding origin equivalence of weakly self-nesting macro tree transducers
Two Tagless Variations on the Deutsch-Schorr-Waite Algorithm
Abstract interpretation of operational semantics for secure information flow
A nondeterministic space-time tradeoff for linear codes
In-memory hash tables for accumulating text vocabularies
Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type
Self-Adjusting Hash Tables
A CAT algorithm for generating permutations with a fixed number of inversions
The Translation Square Map and Approximate Congruence
Strings, Trees, and Patterns
Extended Conditions for Answering an Aggregate Query Using Materialized Views
A Secure and Useful 'Keyless Cryptosystem'
Direct Semantics and Exceptions Define Jumps and Coroutines
A New Combination of Input and Unit Deductions for Horn Sentences
A Structured Approach for Developing Concurrent Programs in Java
On the Worst-Case Ratio of a Compound Multiprocessor Scheduling Algorithm
Constructing Sparse Spanners for Most Graphs in Higher Dimensions
An algorithm for computing the restriction scaffold assignment problem in computational biology
Symmetric Quotients and Domain Constructions
A fast algorithm for the gas station problem
A Note on Comparison of Subrecursive Hierarchies
Hamiltonicity of hypercubes with faulty vertices
A Simple Linear Algorithm for the Edge-Disjoint (s, t)-Paths Problem in Undirected Planar Graphs
Checking Functional Consistency in Deductive Databases
A Simpler Derivation of Schema Hazard in Genetic Algorithms
Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees
On Average Edge Length of Minimum Spanning Trees
On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic
A process algebra for probabilistic and nondeterministic processes
A Note on Self-Modifying Finite Automata
An Approximation Algorithm for the General Routing Problem
Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
A Note on Parallel Complexity of Maximum f -Matching
The clique-transversal set problem in claw-free graphs with degree at most 4
Covering a Set with Arithmetic Progressions is NP-Complete
The Contraction Property is Sufficient to Guarantee the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces
A Fast Algorithm for String Matching with Mismatches
On the Subtree Isomorphism Problem for Ordered Trees
Addendum to Sidel'nikov sequences over nonprime fields
Line Arrangements and Range Search
Cyclomatic Numbers Do Not Measure Complexity of Unstructured Programs
FPT approximation and subexponential algorithms for covering few or many edges
A Lower Bound for Randomized List Update Algorithms
Unary finite automata vs. arithmetic progressions
Perceptrons Revisited
A Universally Hard Set of Formulae with Respect to Non-Deterministic Turing Acceptors
Performance analysis of a greedy algorithm for inferring Boolean functions
Average-Case Scalable On-Line Algorithms for Fault Replacement
Exact exponential-time algorithms for finding bicliques
A Probabilistic Analysis of an Error-Correcting Algorithm for the Towers of Hanoi Puzzle
Strong orientations of complete k-partite graphs achieving the strong diameter
A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
Hysterical B-trees
Generating Languages by a Derivation Procedure for Elementary Formal Systems
A Grid Embedding into the Star Graph for Image Analysis Solutions
Constructive dimension equals Kolmogorov complexity
An O(n log n+m log log n) Maximum Weight Clique Algorithm for Circular-Arc Graphs
Parallel ((Greek D)D+1)-Coloring of Constant-Degree Graphs
On Sorting in the Presence of Erroneous Information
Maximal Matching Stabilizes in Quadratic Time
The Theory of Functional and Subset Dependencies Over Relational Expressions
Approximate Storage Utilisation of B-Trees: A Simple Derivation and Generalisations
Geometric medians in reconciliation spaces of phylogenetic trees
The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen
Bounded families for the on-line t -relaxed coloring
Dynamic polar diagram
Fork sequential consistency is blocking
Program Inversion in the Refinement Calculus
Output-Sensitive Peeling of Convex and Maximal Layers
Lexical Ambiguity in Tree Adjoining Grammars
An Algorithm to Generate a Random Cyclic Permutation
On maximal repeats in strings
The Fermat star of binary trees
3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints
Mod m Arithmetic in Binary Systems
An improved incremental nonlinear dimensionality reduction for isometric data embedding
A Faster Algorithm for Computing the Strength of a Network
Remarks on Two-Way Automata with Weak-Counters
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
Abstract FOR-Loops Over Several Aggregates
Numerical Methods for Solving Integral Equations of Potential Problems
Longest common subsequence in sublinear space
Parity games on undirected graphs
A Lower Bound for Quantum Search of an Ordered List
Computing the metric dimension for chain graphs
Extension of Synthesis Algorithm of Recursive Processes to \mu-Calculus
On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems
Global and Logical Time in Distributed Algorithms
(Delta+1)-total-colorability of plane graphs with maximum degree Delta at least 6 and without adjacent short cycles
Type-based homeomorphic embedding for online termination
Provable security for 13 round Skipjack-like structure
A Lower Bound for On-Line Bin Packing
PTAS for minimum k-path vertex cover in ball graph
Efficient Test & Set Constructions for Faulty Shared Memory
Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring
A New Algebraic Algorithm to Decode the Ternary Golay Code
Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages
A Simple Approach to Implementing Multiplication with Small Tables
The Complexity of Symmetric Functions in Bounded-Depth Circuits
Universal approximate simplification under the discrete Fréchet distance
The Immortality Problem for LAG Systems
Analysis of the Pope-Stein Division Algorithm
Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching
On the Complexity of Quaternion Multiplication
On the Size of Nonredundant FD-Covers
A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming
An Optimal Algorithm for Computing the Repetitions in a Word
Shortest Enclosing Walks and Cycles in Embedded Graphs
Using static suffix array in dynamic application: Case of text compression by longest first substitution
A Regeneration Scheme for Generating Extensions
On the complexity of extension checking in default logic
Fault-Tolerant and Flexible Interconnection of Multiple Processors
Variations of the Firing Squad Problem and Applications
A Polynomial Algorithm for b-Matchings: An Alternative Approach
Worst-Case Performance of Some Heuristics for Steiner's Problem in Directed Graphs
Cliques enumeration and tree-like resolution proofs
Approximation algorithms for maximum linear arrangement
A One-to-One Correspondence Between a Class of Leftist Trees and Binary Trees
Aliasing Among Pointers in EUCLID
New bounds on the barycenter heuristic for bipartite graph drawing
Cooperating Proofs for Distributed Programs with Multiparty Interactions
A Hierarchical Clustering Algorithm Using Strong Components
On some special cases of the restricted assignment problem
On Module Assignment in Two-Processor Distributed Systems
NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times
On characterizing the existence of partial one-way permutations
On toughness and fractional (g, f, n)-critical graphs
Trace-based schedulability analysis to enhance passive side-channel attack resilience of embedded software
New instability results for high-dimensional nearest neighbor search
Using stable sets to bound the chromatic number
Enumerating maximal cliques in link streams with durations
On the Relationship Between SonTtrees and Symmetric Binary B-Trees
On Constructing Multiple Spanning Trees in a Hypercube
Minimal forbidden subwords
Corrigendum: Leftmost one Computation on Meshes with Row Broadcasting
Commutativity, Non-Commutativity, and Bilinearity
Improved algorithms for the k simple shortest paths and the replacement paths problems
A set coverage problem
Fast Two-Dimensional Pattern Matching
Frequency of correctness versus average polynomial time
An improved lower bound for approximating Shortest Integer Relation in l infinity norm (SIR infinity )
There is no optimal routing policy for the torus
Darts and hoopla board design
A note on algebraic techniques for subgraph detection
Approximating the Maximum Agreement Forest on k trees
On the Optimality of Semidynamic Routing Schemes
A Simple Relation Between Relational and Predicate Transformer Semantics for Nondeterministic Programs
Simulation of PRAMs with Scan Primitives by Unbounded Fan-In Circuits
A dichotomy in the complexity of consistent query answering for queries with two atoms
Depth-First Layout Algorithm for Trees
A Probabilistic Minimum Spanning Tree Algorithm
A linear-time algorithm for paired-domination problem in strongly chordal graphs
On the algorithmic complexity of zero-sum edge-coloring
Explicit small sets with ε-discrepancy on Bohr sets
Spectral independence, coupling, and the spectral gap of the Glauber dynamics
Corrigendum to "A note on Thue games" [Inf. Process. Lett. 118 (2017) 75-77]
The tensor product of two good codes is not necessarily robustly testable
Corrigendum to "Incidence coloring of Cartesian product graphs" [Inf. Process. Lett. (2015) 765-768]
k-Fold unions of low-dimensional concept classes
The greedy algorithm for domination in graphs of maximum degree 3
A Simple Model of Query Scheduling in Distributed Data Base Systems
Computing Longest Previous Factor in linear time and applications
A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity
Breaking the Shin-Shin-Rhee remotely keyed encryption schemes
Greedy online frequency allocation in cellular networks
A Noncommutative Algorithm for Multiplying 5*5 Matrices Using 102 Multiplications
Easy Verification of Behavioural Subtyping in Common Cases
Range-Restricted Mergeable Priority Queues
Approximate Storage Utilization of B-Trees
An Asymptotic Study of a Recursion Occurring in the Analysis of an Algorithm on Broadcast Communication
Two flow network simplification algorithms
Two-Dimensional Pattern Matching by Sampling
Convexifying polygons with simple projections
The Security of Two ID-Based Multisignature Protocols for Sequential and Broadcasting Architectures
Broadcasting in Hypercubes and Star Graphs with Dynamic Faults
Computational complexity of similarity retrieval in a pictorial database
Multiply-Twisted Hypercube with Five or More Dimensions is not Vertex-Transitive
On the displacement for covering a unit interval with randomly placed sensors
Succinct Iterative Characterizations of Primitive Computable Unary Functions
Approximating integer programs with positive right-hand sides
A Variant of Ben-Or's Lower Bound for Algebraic Decision Trees
The Eternal Dominating Set problem for proper interval graphs
Faster algorithms and a smaller kernel for Cliques or Trees Vertex Deletion
The monadic theory of finite representations of infinite words
Bounds for 3-Matroid Intersection Problems
Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
The Generalized Supplementary Magic-Sets Transformation for Stratified Datalog
Research on dynamic heuristic scanning technique and the application of the malicious code detection model
Parallel Tree-Contraction and Fibonacci Numbers
Variational networks of cube-connected cycles are recursive cubes of rings
SIMPLE: An Optimal Disk System with Two Restricted Heads
Alternate Solutions to the Cigarette Smokers' Problem Without Conditionals
Recognition of E0L Languages in Less Than Quartic Time
A second-order formulation of non-termination
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
L(2,1)-labeling of dually chordal graphs and strongly orderable graphs
A Markov Model for Multibus Multiprocessor Systems Under Asynchronous Operation
On d -distance m -tuple ( ℓ , r )-domination in graphs
Approximately Matching Context-Free Languages
Equivalence checking of two functional programs using inductive theorem provers
Meeting Times of Random Walks on Graphs
Generalized Hex and Logical Characterizations of Polynomial Space
A Novel Representation of Lists and its Application to the Function "reverse"
Noiselike Transforms of omega-Events
On the existence of translations of structured specifications
An Algorithm for "Ulam's Game" and its Application to Error Correcting Codes
Inverse star, borders, and palstars
Viennot Factorization of Infinite Words
An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees
The choice and agreement problems of a random function
The complexity of propositional implication
Remark on subcodes of linear complementary dual codes
A Polynomial Algorithm for the Extendability Problem in Bipartite Graphs
Parameterized complexity of control problems in Maximin election
Estimating the number of vertices of a polyhedron
On the period of the Naor-Reingold sequence
Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
Exposure to Deadlock for Communicating Processes is Hard to Detect
A note on stutter-invariant PLTL
Single machine scheduling with past-sequence-dependent setup times and learning effects
A lower bound for approximating the geometric minimum weight matching
The Interpolation-Sequential Search Algorithm
On the complexity of role updating feasibility problem in RBAC
On Computing the Determinant in Small Parallel Time Using a Small Number of Processors
Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis
On ( s , t )(s, t)-relaxed L (2, 1)L(2, 1)-labelings of the square lattice
String matching with simple devices
An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two
Group path covering and L(j, k)-labelings of diameter two graphs
Compressing probability distributions
On Bounded-Probability Operators and C=P
A large lower bound on the query complexity of a simple boolean function
A Counterexample for the Sufficiency of Edge Guards in Star Polygons
How strong is Nisanʼs pseudo-random generator?
Minimal Comparison Sorting by Choosing Most Efficient Comparisons
Using the incompressibility method to obtain local lemma results for Ramsey-type problems
Hardware Address Translation for Machines with a Large Virtual Memory
The termination of the higher-dimensional tarai functions
A Note on the Complexity of Local Search Problems
Internal Path Length of the Binary Representation of Heap-Ordered Trees
An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems
Alternating Automata with Start Formulas
A Parallelization of Miller's n^log n Isomorphism Technique
An Observation on Associative One-Way Functions in Complexity Theory
An efficient method to generate feasible paths for basis path testing
On Disjoint Concave Chains in Arrangements of (Pseudo) Lines
A general compression algorithm that supports fast searching
New bounds for the number of lightest cycles in undirected graphs
Extending H 1 -clauses with disequalities
An n² Algorithm for Determining the Bridges of a Graph
An efficient algorithm to find k-nearest neighbors in flocking behavior
An analytic criterion for CSAT
Complexity of min-max subsequence problems
Maximum Bounded H-Matching is MAX SNP-Complete
Periodicity of identifying codes in strips
Evaluation of a Hierarchical Bit-Vector Compression Technique
Vertex-transitivity on folded crossed cubes
Producing a Top-Down Parse Order with Bottom-up Parsing
Exact algorithms for the minimum latency problem
An improved GA and a novel PSO-GA-based hybrid algorithm
A Note on the Subtree Isomorphism for Ordered Trees and Related Problems
Self-generating program specializers
Fixed Hypercube Embedding
The Little Towers of Antwerpen problem
A Linear Algorithm to Color i -Triangulated Graphs
A Simple Proof on the Decidability of Equivalence Between Recursive and Nonrecursive Datalog Programs
Distances from Differences of Roots of Polynomials to the Nearest Integers
On the Complexity of Boolean Unification
The size and depth of layered Boolean circuits
Computability of Affine Non-Conditional Recurrent Systems
A unified scheme for generalizing cardinality estimators to sum aggregation
A note on time-bound hierarchical key assignment schemes
A Variant of Heapsort with Almost Optimal Number of Comparisons
Incorporating Negative-Weight Vertices in Certain Vertex-Search Graph Algorithms
Negation-Limited Circuit Complexity of Symmetric Functions
A simple coverage-evaluating approach for wireless sensor networks with arbitrary sensing areas
Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture
Single Step Graph Search Problem
Intractability results in predicate detection
Serializability by Commitment Ordering
Minimum cycle bases of weighted outerplanar graphs
On the linear complexity of bounded integer sequences over different moduli
Proxy-based hybrid cache management in Mobile IP systems
High Density Graphs for Processor Interconnection