yusuke1997/dblp-id-title huggingface dataset:
A note on the complexity of manipulating weighted Schulze voting
Approximations for the Maximum Acyclic Subgraph Problem
Algorithmic aspects of {P}-isolation in graphs and extremal graphs for a {P3}-isolation bound
The Computational Complexity of the Reliability Problem on Distributed Systems
Shortest Path Computations in Source-Deplanarized Graphs
The P3 infection time is W[1]-hard parameterized by the treewidth
An LR Parser with Pre-Determined Reduction Goals
The Greedy and Delaunay Triangulations are Not Bad in the Average Case
Improving the diameters of completely independent spanning trees in locally twisted cubes
Polynomial time quantum computation with advice
Decimal Adjustment of Long Numbers in Constant Time
A Linear Time Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem
Uniform Multipaging Reduces to Paging
Modular termination of prefix-constrained term rewrite systems
Computing a Basis for a Finite Abelian p-Group
Deferred Data Structure for the Nearest Neighbor Problem
The Effective Entropies of Some Extensions of Context-Free Languages
An Example of a PD2L-System with the Growth Type 2½
A diameter-revealing proof of the Bondy-Lovász lemma
A comment on "The domination number of exchanged hypercubes"
Maximum Finding on a Multiple Access Broadcast Network
A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph
The Area-Time Complexity of the Greatest Common Divisor Problem: A Lower Bound
Memoryless determinacy of infinite parity games: Another simple proof
Exploiting Intra-Object Dependencies in Parallel Simulation
Minimal Fully Adaptive Wormhole Routing on Hypercubes
The greedy algorithm for shortest superstrings
Fast non-blocking atomic commit: an inherent trade-off
Thorup-Zwick emulators are universally optimal hopsets
Models for the Substitution Axiom of UNITY Logic
Fast, silent self-stabilizing distance-k independent dominating set construction
A Synchronization Anomaly
The Complexity of Minimizing Wire Lengths in VLSI Layouts
Efficient weakest preconditions
A Transformation of Self-Stabilizing Serial Model Programs for Asynchronous Parallel Computing Environments
Static analysis of navigational XPath over graph databases
Covering segments on a line with drones
Deterministic sublinear-time approximations for metric 1-median selection
A non-clausal tableau calculus for MinSat
The joy of formula manipulation
A simple recognition of maximal planar graphs
Assembling approximately optimal binary search trees efficiently using arithmetics
On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles
Interval Analysis, Pagination and Program Locality
On Computing a Conditional Edge-Connectivity of a Graph
Recognizing Hamming Graphs in Linear Time and space
Notes on complexity of packing coloring
Increasing the Orders of Equidistribution of the Leading Bits of the Tausworthe Sequence
Polynomially Solvable Satisfiability Problems
Simple LPO Constraint Solving Methods
Complexity of approximation of 3-edge-coloring of graphs
Relating Minimal Models and Pre-Requisite-Free Normal Defaults
A polynomial time algorithm for the 2-Poset Cover Problem
Identification of Hammerstein systems with continuous nonlinearity
Groupies in random graphs
A Note on Two-Dimensional Finite Automata
Cryptanalysis of RSA with more than one decryption exponent
Proving that prBPP = prP is as hard as proving that "almost NP " is not contained in P /poly
A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology
A dichotomy for weighted efficient dominating sets with bounded degree vertices
A space- and time-efficient local-spin spin lock
Improving the running time of embedded upward planarity testing
The complexity of error metrics
3D Straight-Line Grid Drawing of 4-Colorable Graphs
Dynamic Suffix Tree and Two-Dimensional Texts Management
Is an Exit Statement Sufficient?
The Critical Value of the Basic Parameter of a Nonlinear Differential Equation
On the hardness of inclusion-wise minimal separators enumeration
Packing items into several bins facilitates approximating the separable assignment problem
An Optimal Algorithm for the Period of a Strongly Connected Digraph
Running ASCEND, DESCEND and PIPELINE Algorithms in Parallel Using Small Processors
A Special Case of the Dynamization Problem for Least Cost Paths
Clique problem, cutting plane proofs and communication complexity
Google Scholar makes it hard - the complexity of organizing one's publications
A PTAS for geometric 2-FTP
Simpler Proof of a Realizability Theorem on Delaunay Triangulations
The Complexity of Problems Involving Structurally Bounded and Conservative Petri Nets
Palindromic rich words and run-length encodings
Static and Dynamic Parallel Computation of Connected Components
Computing Kernels in Directed Bichromatic Graphs
A Note on a Multidimensional Searching Problem
Descriptional complexity of multi-parallel grammars
On the effective clustering of multidimensional data sequences
Acyclic colorings of products of trees
Folk theorems on the determinization and minimization of timed automata
A Parallel Algorithm for Finding a Blocking Flow in an Acyclic Network
Modelling Causality via Action Dependencies in Branching Time Semantics
A Simple Characterization of Database Dependency Implication
Deterministic finite automata with recursive calls and DPDAs
Three scheduling problems with deteriorating jobs to minimize the total completion time
Bounded regular path queries in view-based data integration
Resource bisimilarity and graded bisimilarity coincide
Finding Nearest Neighbors with Voronoi Tessellations
Outline of a Machine Without Branch Instructions
Dynamization of Decomposable Searching Problems
An Approximation Algorithm for Reducing Expected Head Movement in Linear Storage Devices
A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest
Query Processing for Multimedia Applications on Optical Media
A lower bound on the release of differentially private integer partitions
Comments on the All Nearest-Neighbor Problem for Convex Polygons
Characterization of simple edge-firing games
Finding cycles in hierarchical hypercube networks
A Note on 'Master Keys for Group Sharing'
Erratum: A Cascade Algorithm for the Logical Closure of a Set of Binary Relations
Computation of lucky number of planar graphs is NP-hard
A fast and practical bit-vector algorithm for the Longest Common Subsequence problem
Analysis of simple randomized buffer management for parallel I/O
Constructing Byzantine Quorum Systems from Combinatorial Designs
Pattern matching in the Hamming distance with thresholds
Separating Strings with Small Automata
Infinitary Tree Languages Recognized by omega-Automata
Acyclic coloring of graphs of maximum degree five: Nine colors are enough
On 3-colorable planar graphs without cycles of four lengths
A Lower Bound for Depth-3 Circuits with MOD m Gates
Safety and Liveness From a Methodological Point of View
Higher-order Voronoi diagrams on triangulated surfaces
Group-based collective keyword querying in road networks
Planar lower envelope of monotone polygonal chains
Corrigendum: Semi-Unification of Two Terms in Abelian Groups
3-coloring arrangements of line segments with 4 slopes is hard
Spatial joins based on NA-trees
Implicit Data Structures for Linear Hashing Schemes
Robust probabilistic temporal logics
A new method for constructing pair-wise covering designs for software testing
Considerations on the Similarity Measures Between Index Terms
Parallel Iterated Bucket Sort
Estimating network size from local information
Termination of { a a -> b c , b b -> a c , c c -> a b }
Binding Propagation Beyond the Reach of Rule/Goal Graphs
'Possible' Membership of a Multivalued Dependency in a Relational Database
Edge coloring total k-labeling of generalized Petersen graphs
The metric dimension for resolving several objects
Which Finite Monoids are Syntactic Monoids of Rational omega-Languages
On Computing Graph Closures
A study of fault tolerance in star graph
Secret Sets and Applications
A Very Simple Function that Requires Exponential Size Read-Once Branching Programs
Recursion and Stacks
Processing a multimedia join through the method of nearest neighbor search
A network-flow-based lower bound for the minimum weighted integer coloring problem
Genetic Algorithm for Feature Selection for Parallel Classifiers
A Parallel Algorithm for Eliminating Cycles in Undirected Graphs
On Random Reductions from Sparse Sets to Tally Sets
Discriminative learning can succeed where generative learning fails
On the Storage Space Requirement of Consecutive Retrieval with Redundancy
Cycle detection using a stack
Order of State Functions and Logic Functions
An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
Generating non-conspiratorial executions
A Compression Method for Clustered Bit-Vectors
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times
On the index of Simon's congruence for piecewise testability
Algorithms for Drawing Binary Trees in the Plane
Some Results on the Containment and Minimization of (in) Equality Queries
On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees
The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings
Byzantine quorum systems with maximum availability
L-Infinity Interdistance Selection by Parametric Search
Shortest paths in simple polygons with polygon-meet constraints
Circle formation of weak robots and Lyndon words
Optimal Coteries and Voting Schemes
Simplified proof of the Fourier Sampling Theorem
Enclosing weighted points with an almost-unit ball
Axiomatizing functional dependencies in the Higher-Order Entity-Relationship Model
A Shortest-Path Algorithm for Manhattan Graphs
Verifying Programs by Induction on Their Data Structure: General Format and Applications
Convex Hull Made Easy
The Working Set Algorithm has Competitive Ratio Less Than Two
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
Node-to-Node Cluster Fault Tolerant Routing in Star Graphs
Coverings that preserve sense of direction
Efficient domination in circulant graphs with two chord lengths
Extracting indexing information from XML DTDs
Limit-depth and DNR degrees
On handshakes in random graphs
Vertex vulnerability parameters of Kronecker products of complete graphs
Tetris and decidability
Efficient Dynamic Algorithms for Some Geometric Intersection Problems
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Binomial Coefficients with Non-Integral Lower Index
A 22k-approximation algorithm for minimum power k edge disjoint st-paths
Efficient Backward execution in and/or Process Model
The All-Pairs Quickest Path Problem
A Distributed k-Mutual Exclusion Algorithm Using k-Coterie
Edge-fault-tolerant node-pancyclicity of twisted cubes
The first Zagreb index, reciprocal degree distance and Hamiltonian-connectedness of graphs
Perfect Power Testing
Scalable generation of scale-free graphs
On Finding Solutions for Extended Horn Formulas
Stacking Without Really Stacking When Reducing Categorical Expressions
Minimizing the number of inputs while applying adaptive test cases
Complete Operator Precedence Conditions
Error Diagnosis and Recovery in One Pass Compilers
Simple and fast linear space computation of longest common subsequences
Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane
A Storage Scheme for Height-Balanced Trees
An O(n log n) Feasibility Algorithm for Preemptive Scheduling of n Independent Jobs on a Hypercube
Strategies for generating tree spanners: Algorithms, heuristics and optimal graph classes
A Metric for Traces
Remarks on Languages Acceptable in log n Space
Note on winning positions on pushdown games with [omega]-regular conditions
A Note on Randomized Mutual Search
On the Detection of a Common Intersection of k Convex Objects in the Plane
The Average Height of a Node in the BANG Abstract Directory Tree
An Encoding Scheme for the Efficient Representation of Hierarchical Structures
Topological formulation of termination properties of iterates of functions
Las Vegas RNC Algorithms for Unary Weighted Perfect Matching and T-Join Problems
Integer Sorting on a Mesh-Connected Array of Processors
Whole mirror duplication-random loss model and pattern avoiding permutations
On cryptographic anonymity and unpredictability in secret sharing
Red-black trees with relative node keys
Closure properties and decision problems of dag automata
Paths between colourings of graphs with bounded tree-width
Symmetric Min-Max Heap: A Simpler Data Structure for Double-Ended Priority Queue
The effective entropy of next/previous larger/smaller value queries
A Note on Two-Way Nondeterministic Pushdown Automata
Encoded pointers - An Interesting DataSstructure for Modern Sil's
A note on the expressibility problem for modal logics and star-free regular expressions
epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials
A Note on the Dynamic Storage Allocation Problem
O(1) Space Complexity Deletion for AVL Trees
On Decomposing Polygons into Uniformly Monotone Parts
Independent spanning trees in crossed cubes
The connection between two ways of reasoning about partial functions
An improved exact algorithm for the domatic number problem
Total variation distance for product distributions is #P-complete
On the two largest distance eigenvalues of graph powers
Strongly competitive algorithms for caching with pipelined prefetching
Uniform Generation of a Schröder Tree
Substring search and repeat search using factor oracles
Enclosing k Points in the Smallest Axis Parallel Rectangle
Embeddings and the Trace of Finite Sets
Factoring Numbers in O(log n) Arithmetic Steps
Init and Anf Operating on omega-Languages
Bit-Optimal Election in Synchronous Rings
Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource
Edge-coloring almost bipartite multigraphs
Varieties of Weakest Liberal Preconditions
Online delay management on a single train line with predictions
More restrictive Gray codes for necklaces and Lyndon words
On multi-head automata with restricted nondeterminism
Lower Bounds for Two Call Control Problems
The Emptiness of Complement Problem for Semi Extended Regular Expressions Requires c n Space
One conjecture of bubble-sort graphs
An Approximation Algorithm for Nonpreemptive Scheduling on Hypercube Parallel Task Systems
The Complexity of Preemptive Scheduling Given Interprocessor Communication Delays
Strict Combinators
Derivation of a Termination Detection Algorithm for Distributed Computations
A note on searching line arrangements and applications
A Branching Process Model for Genetic Algorithms
A New Competitive Algorithm for the Counterfeit Coin Problem
A simpler linear time 2/3-epsilon approximation for maximum weight matching
Two Attacks on Neuman-Stubblebine Authentication Protocols
An Iterative Pipelined Array Architecture for the Generalized Matrix Inversion
Lower bounds on treespan
A DP algorithm for minimizing makespan and total completion time on a series-batching machine
On Estimating Access Costs in Relational Databases
Revisiting reachability in Polynomial Interrupt Timed Automata
Graphs with maximum degree 6 are acyclically 11-colorable
On edge connectivity of direct products of graphs
On the efficiency of localized work stealing
On the orthographic dimension of definable sets
Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon
Systematic Debugging Method for Attribute Grammar Description
Fully polynomial-time computation of maximum likelihood trajectories in Markov chains
A Lower Bound for Area-Universal Graphs
On a Circle-Cover Minimization Problem
Sequence annotation with HMMs: New problems and their complexity
Efficient parameterized string matching
An O(n(logn) 2 /loglogn) algorithm for the single maximum coverage location or the (1, X p )-medianoid problem on trees
Linear Programming is Log-Space Hard for P
Reduced meet over labelling-based semantics in abstract argumentation
An Exercise in Proving Self-Stabilization with a Variant Function
Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
Randomized splay trees: Theoretical and experimental results
Aiding exploratory testing with pruned GUI models
Representations and Complete Semiring Morphisms
Finding Good Approximate Vertex and Edge Partitions is NP-Hard
Vertex angle and crossing angle resolution of leveled tree drawings
General Methods for 'All Elements' and 'All Pairs' Problems
Dynamic Deferred Data Structuring
Auxiliary Variables in Partial Correctness Programming Logics
Fan-type implicit-heavy subgraphs for hamiltonicity of implicit claw-heavy graphs
Address Calculation Algorithms for Ordered Sets of Combinations
Approximation algorithms for clique transversals on some graph classes
A Simple Lower Bound for Monotone Clique Using a Communication Game
Size-Depth Tradeoffs for Boolean Fomulae
A note on monotone real circuits
Computing the Relative Entropy Between Regular Tree Languages
On discretization methods for approximating optimal paths in regions with direction-dependent costs
On the Formal Specification of the Semantics of Processed Information
A Method for Determining Class Subspaces
A note on the oriented chromatic number of grids
A Study of Page Arrangements for Extendible Hashing
Searching for Segments with Largest Relative Overlap
Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem
Subsumption and Implication
An Algorithm for Drawing General Undirected Graphs
An efficient approach to cyclic reference counting based on a coarse-grained search
The quantum query complexity of the hidden subgroup problem is polynomial
The harmonious coloring game
Bounded cost algorithms for multivalued consensus using binary consensus instances
A Technique for Developing Loop Invariants
On the Classification of Binding Mechanisms
Fixed-Parameter Tractability of Graph Modification Problems for Hereditary Properties
An Optimization Technique for Protocol Conformance Testing Using Multiple Uio Sequences
On intersecting a set of parallel line segments with a convex polygon of minimum area
Corrigendum: Identifying Periodic Occurences of a Template with Applications to Protein Structure
The number of pessimistic guesses in Generalized Mastermind
On Linear-Time Algorithms for Five-Coloring Planar Graphs
Constrained Integer Approximation to Planar Line Intersection
ACO algorithms with guaranteed convergence to the optimal solution
Lower Bounds on Type Checking Overloading
An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs
A Scheme for Fault-Tolerant Virtual Memory
A Linear Expected-Time Algorithm for Computing Planar Relative Neighbourhood Graphs
Tight Bounds on Expected Time to Add Correctly and Add Mostly Correctly
On the hardness of finding subsets with equal average
Exploiting Logical Structures in Replicated Databases
Hardness and approximation of minimum distortion embeddings
Randomized and deterministic algorithms for network coding problems in wireless networks
A Class of Differential Equations for Testing Variable Step-Size Integration
A Self-Stabilizing Algorithm for Constructing Spanning Trees
Formality works
Reachability on prefix-recognizable graphs
Reconstruction of Polygons from Projections
Fast and Simple Nested Fixpoints
Low-interference networks in metric spaces of bounded doubling dimension
Oriented colorings of partial 2-trees
Clarifying the semantics of value in use cases through Jackson's Problem Frames
Determining rate monotonic schedulability of real-time periodic tasks using continued fractions
Analyzing variants of Shellsort
Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG
The Complexity of Vector-Products
Weighted broadcast in linear radio networks
Approximating maximum satisfiable subsystems of linear equations of bounded width
Simulation, Reduction and Preservation of Correctness Properties of Parallel Systems
Tutte type theorems for graphs having a perfect internal matching
A simple supercritical tradeoff between size and height in resolution
A Faster Algorithm for the Two-Center Decision Problem
All-pairs shortest-paths computation in the presence of negative cycles
A minimal property for characterizing deadlock-free programs
On a Problem in Real-Time Computing
Herbrand theorems in arbitrary institutions
On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
A Note on Isomorphic Chordal Rings
Improved neural dynamics for online Sylvester equations solving
A kernel of order 2 k-c log k for vertex cover
Grammatical Interface for Even Linear Languages Based on Control Sets
Smoothsort Revisited
Linear Speed-Up Does not Hold on Turing Machines with Tree Storages
Simple Bounds on the Convergence Rate of an Ergodic Markov Chain
More on Looping vs. Repeating in Dynamic Logic
An Algorithm for the Computation of the Hutchinson Distance
A hardness result and new algorithm for the longest common palindromic subsequence problem
Towards Optimal Distributed Election on Chordal Rings
Approximate Closest-Point Queries in High Dimensions
Formal Justification of Underspecification for S5
On classes of functions for which No Free Lunch results hold
Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n)
On approximation algorithms for the terminal Steiner tree problem
A Parallel Algorithm for Static Program Slicing
A Note on the Equivalence Problem of E-Patterns
On alpha-redundant vertices in P5-free graphs
On the preferred extensions of argumentation frameworks: Bijections with naive sets
Comments on "Distributed symmetric key management for mobile ad hoc networks"
Weak associativity and restricted rotation
Short Note on a Heuristic Search Strategy in Long-Term Memory Networks
On the Proof of a Distributed Algorithm
Minimum Node Disjoint Path Covering for Circular-Arc Graphs
A note on the non-NP-hardness of approximate lattice problems under general Cook reductions
A type system for the push-enter model
On Access and Alignment of Data in a Parallel Processor
Preimage and pseudo-collision attacks on step-reduced SM3 hash function
Optimal Incremental Simple Multi-Pass Attribute Evaluation
Simple FPTAS for the subset-sums ratio problem
Low complexity energy efficient very low bit-rate image compression scheme for wireless sensor network
Computing runs on a general alphabet
Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
Approximability of identifying codes and locating-dominating codes
An Algorithm for the Derivation of Codefinitions in Computer Programs
A new analysis of the false positive rate of a Bloom filter
A Dynamic Programming Solution to the n-Queens Problem
Location of Multiple Points in a Planar Subdivision
A New Algorithm for Parallel Solution of Linear Equations
An Algorithm for Fraternal Orientation of Graphs
Approximation Algorithms for Geometric Median Problems
On the Fault-Diameter of the Star Graph
Generalized measures of fault tolerance in exchanged hypercubes
Backtrack: An O(1) Expected Time Algorithm for the Graph Coloring Problem
Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case
Simulations Between Two Reconfigurable Mesh Models
Linear time self-stabilizing colorings
A Dual Algorithm for the Satisfiability Problem
Fair Mutual Exclusion with Unfair P and V Operations
Angle-constrained spanners with angle at least π/3
Quantum zero-error algorithms cannot be composed
An Elegant 1-Writer Multireader Multivalued Atomic Register
Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes
Monotone separations for constant degree polynomials
Completeness of hyper-resolution via the semantics of disjunctive logic programs
Conditional diagnosability of hypermeshes under the comparison model
Waypoint routing on bounded treewidth graphs