yusuke1997/dblp-id-title huggingface dataset:
An improved approximation ratio for the minimum linear arrangement problem
Efficient construction of vote-tags to allow open objection to the tally in electronic elections
Descriptional complexity of semi-conditional grammars
Algorithms for Deciding the Containment of Polygons
Complexity of a disjoint matching problem on bipartite graphs
Parameterized power domination complexity
On the computational complexity of Nash equilibria for (0, 1) bimatrix games
Approximation of min coloring by moderately exponential algorithms
Defining Database Dynamics with Attribute Grammars
Corrigendum: An Optimal Lower Bound for Nonregular Languages
On Transmitting Delay in a Distance-Transitive Strongly Antipodal Graph
Two Results on Process Logic
On Enclosing k Points by a Circle
A statement based parallelizing framework for processor-in-memory architectures
An Extension to Trees of the Sardinas and Patterson Algorithm
Multidimensional zero-correlation attacks on lightweight block cipher HIGHT: Improved cryptanalysis of an ISO standard
Notes on the Derivation of Asymptotic Expressions from Summations
Algorithms for multicast connection under multi-path routing model
Global Avalanche Characteristics and Nonlinearity of Balanced Boolean Functions
A Note on Minimum-Area Upward Drawing of Complete and Fibonacci Trees
On the Identification of the Convex Hull of a Finite Set of Points in the Plane
A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem
Expected Connectivity and Leader Election in Unreliable Networks
Refined algorithms for hitting many intervals
Paired Sequential Lists in a memory Interval
A categorical study on the finiteness of specifications
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators
A space-efficient algorithm for finding strongly connected components
A constructive count of rotation symmetric functions
An Algorithm for Determining an Opaque Minimal Forest of a Convex Polygon
Evading the Drift in Floating-Point Addition
An efficient IND-CCA2 secure Paillier-based cryptosystem
Minimum wirelength of hypercubes into n-dimensional grid networks
Novel bit-parallel multiplier for GF(2 m ) defined by all-one polynomial using generalized Karatsuba algorithm
Algebraic Approach to p-adic Conversion of Rational Numbers
Some properties of alternating group networks
Errata for "Faster index for property matching"
Online call control in cellular networks revisited
Two Decidability Problems for Infinite Words
Pattern expressions and pattern automata
Casop: A Fast Algorithm for Computing the n-Ary Composition of a Binary Associative Operator
Cyclic-cubes and wrap-around butterflies
Preserving Liveness: Comments on "Safety and Liveness from a Methodological Point of View"
Notes on Oriented Depth-First Search and Longest Paths
Lazy or eager dynamic matching may not be fast
A Self-Stabilizing Algorithm for Constructing Breadth-First Trees
On the probabilistic closure of the loose unambiguous hierarchy
An improved algorithm for finding a length-constrained maximum-density subtree in a tree
Dominating Sets for Split and Bipartite Graphs
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying
An Explanatory Presentation of Composition Rules for Assumption-Commitment Specifications
A Constructive Proof of Vizing's Theorem
Shape diameter for object analysis
The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network
Bounded Fan-Out m-Center Problem
Space complexity of exact discrete geodesic algorithms on regular triangulations
An Attribute Evaluation of Context-Free Languages
A Fully Distributed Termination Detection Scheme
An efficient algorithm for solving the homogeneous set sandwich problem
A spectral lower bound for the treewidth of a graph and its consequences
On the Power of a Threshold Gate at the Top
Decidability of the Star Problem in A* x {b}*
Variations on computing reciprocals of power series
Domination number of Cartesian products of directed cycles
An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Time
Weighted random sampling with a reservoir
Optimal Gray code for involutions
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
Cost-Oriented Program Optimisation
A Complement to Tarjan's Result about the Lower Bound on the Complexity of the Set Union Problem
Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
Balanced allocation through random walk
A Fast Algorithm for Finding all Shortest Paths
Systematic Choice of Initial Points in Local Search: Extensions and Application to Neural Networks
lambda c -Optimally half vertex transitive graphs with regularity k
A Fast VLSI Conversion Between Binary and Residue Systems
There is no Fully Abstract Fixpoint Semantics for Non-Deterministic Languages with Infinite Computations
A Systolic Array for the Longest Common Subsequence Problem
Surveying definitions of election verifiability
On a Stable Minimum Storage Merging Algorithm
Counting independent sets in cocomparability graphs
Near optimal Cholesky factorization on orthogonal multiprocessors
A characterization of complete bipartite RAC graphs
On the linear complexity of the Naor-Reingold sequence
Modular instantiation schemes
Notes on Avoiding "go to" Statements
The Relativized Relationship Between Probabilistically Chackable Debate Systems, IP and PSPACE
Sparse Dominance Queries for Many Points in Optimal Time and Space
Neural associative memory for brain modeling and information retrieval
Asynchronous bounded lifetime failure detectors
On Computability of the Mean Deviation
Parallel System Schemas and Their Relation to Automata
Parallel routing in regular networks with faults
Linear Congruence Equations for the Solutions of the N-Queens Problem
Hardness results and approximation algorithms of k-tuple domination in graphs
Structured Programs for Turing Machines
Ratio-balanced maximum flows
Minimum-width annulus with outliers: Circular, square, and rectangular cases
On Learning Multivariate Polynomials Under the Uniform Distribution
Machine scheduling with contiguous processing constraints
The complexity of changing colourings with bounded maximum degree
A Fast Algorithm for Constructing Trees from Distance Matrices
Horton-Strahler number, rooted pathwidth and upward drawings of trees
2-subcoloring is NP-complete for planar comparability graphs
A Classification of the Probabilistic Polynomial Time Hierarchy Under Fault Tolerant Access to Oracle Classes
Enumerating submultisets of multisets
Sufficient conditions for lambda ' -optimality of graphs with small conditional diameter
Square Time is Optimal for Simulation of One Pushdown Store or One Queue by an Oblivious One-Head Tape Unit
Set constraints and topology
On the Triangle Conjecture
Finding Paths and Deleting Edges in Directed Acyclic Graphs
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
Storage Requirements for Fair Scheduling
Cayley graphs as models of deterministic small-world networks
Unifying theories of time with generalised reactive processes
Efficient Allocation of Chain-Like Task on Chain-Like Network Computers
Program synthesis by model finding
The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors
Optimal Time Bounds for Some Proximity Problems in the Plane
Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings
A conditional access system with revocation for mobile pay-TV systems revisited
Scheduling a variable maintenance and linear deteriorating jobs on a single machine
Converting Lamport's Regular Register to Atomic Register
A Notation for Distributed Operations
Enumerating minimal dominating sets in chordal graphs
How to Cope with Faulty Processors in a Completely Connected Network of Communicating Processors
A Faster Approximation Algorithm for the Steiner Problem in Graphs
On the Editing Distance Between Unordered Labeled Trees
A Batching Method for Coloring Planar Graphs
Verifying safety properties of a nonlinear control by interactive theorem proving with the Prototype Verification System
Hamiltonian cycles of balanced hypercube with disjoint faulty edges
Fast multiplication of matrices over a finitely generated semiring
A Unifying Approach to Evaluating Block Accesses in Database Organizations
Weak containment for partial words is coNP-complete
Notes about the linear complexity of quaternary cyclotomic sequences of order four
A Note on Relation Schemes which are in 3NF but not in BCNF
Sorting signed permutations by reversals using link-cut trees
Performance improvement of self-adaptive evolutionary methods with a dynamic lower bound
Unidirectional Star Graphs
A Fast Parallel, Algorithm to Recognize, Partitionable Graphs
A self-adjusting quality of service control scheme
Probabilistic Analysis of a Heuristics for the Dual Bin Packing Problem
Fixed-Size Blocks Optimization
A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs
New differential approximation algorithm for k-customer vehicle routing problem
Revisiting a Result of Ko
Universal Types in Concurrent Pascal
Dynamic Programming on Two-Dimensional Systolic Arrays
On the bounds of feedback numbers of (n, k)-star graphs
Computing sparse permanents faster
The Pitfall Paradox and its Solution with Virtual Objects
The Strong Equivalence of ET0L Grammars
Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor
Partition-distance: A problem and class of perfect graphs arising in clustering
Phase Synchronization
Fractal dimension and vector quantization
Depth-First Search and the Vertex Cover Problem
Word prediction using a clustered optimal binary search tree
A note on local coloring of graphs
Yet Another Efficient Backward Execution Algorithm in the AND/OR Process Model
Improved artificial bee colony algorithm for global optimization
Exact and Approximate Computational Geometry Solutions of an Unrestricted Point Set Stereo Matching Problem
A constructive proof of a concentration bound for real-valued random variables
On the security of a modified Beth identity-based identification scheme
A Note on the Complete Problems for Complexity Classes
An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique
A Remark on the Regulation of k1ET0L Systems
Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems
(Δ+1)-total-colorability of plane graphs of maximum degree Δ≥6 with neither chordal 5-cycle nor chordal 6-cycle
New sharp lower bound for the quorum coloring number of trees
Efficient Computation of the Locally Least-Cost Insertion String for the LR Error Repair
More on random walks, electrical networks, and the harmonic k-server algorithm
Integer codes correcting single errors and burst asymmetric errors within a byte
A Proof of the Substitution Lemma in de Bruijn's Notation
Subexponential algorithms for partial cover problems
On Syntactic Nuclei of Rational Languages
The Self-Indexed Search Algorithm: A Bit-Level Approach to Minimal Perfect Hashing
Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs
Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics
A classification of tournaments having an acyclic tournament as a minimum feedback arc set
On algorithms for construction of all irreducible partial covers
About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm
Perfectly colorable graphs
Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication
On a Generalization of the p-Center Problem
The Viterbi algorithm for subsets of stochastic context-free languages
An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses
A Distributed Algorithm to Prevent Mutual Drift Between n Logical Clocks
Two Theorems About the Completeness of Hoare's Logic
Flipping the winner of a poset game
Scheduling Tree-Structured Tasks with Restricted Execution Times
The Logic of "Initially" and "Next": Complete Axiomatization and Complexity
Bounds on locating total domination number of the Cartesian product of cycles and paths
On Repeated Factors in C^\infty-Words
In-situ Inversion of a Cyclic Permutation
A Linear Space Translation of Functional Programs to Turner Combinators
On Finding All Unilaterally Connected Components of a Digraph
A Token Based k-Resilient Mutual Exclusion Algorithm for Distributed Systems
On a Recursive Ascent Parser
A Simple FORTRAN Support for Computer-Assisted Instruction
The indexing for one-dimensional proportionally-scaled strings
A Broadcasting Algorithm in Star Graph Interconnection Networks
Topological Properties of the Directional Hypercube
Corrigenda: SLR(k) Covering for LR(k) Grammars
Optimal prefix and suffix queries on texts
Complementing deterministic tree-walking automata
Leveraging parameterized Chernoff bounds for simplified algorithm analyses
The optimal PAC bound for intersection-closed concept classes
A note about k -DNF resolution
On the Generation of Compilers from Language Definitions
(EC)DSA lattice attacks based on Coppersmith's method
Deciding the Winner in Parity Games is in UP \cap co-Up
Faster multi-witnesses for Boolean matrix multiplication
Atomic Semantics of Nonatomic Programs
Area-Time Tradeoff for Rectangular Matrix Multiplication in VLSI Models
Maximum weight independent sets in ( P 6 , co-banner)-free graphs
On constructing an optimal consensus clustering from multiple clusterings
Minimum Separation for Single-Layer Channel Routing
Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems
Removing edge-node intersections in drawings of graphs
A Note on Finding the Bridges of a Graph
On packing arborescences in temporal networks
Execution time analysis of a top-down R-tree construction algorithm
On the Completeness of Modular Proof Systems
Stopping Times of Distributed Consensus Protocols: A Probabilistic Analysis
Performance Evaluation of Dystems of Cyclic Sequential Processes with Mutual Exclusion Using Petri Nets
Retrieving reusable components with variation points from software product lines
Efficient Algorithms for Common Transversals
Optimal Slope Selection via Expanders
Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees
On Full Utilization of Multi-Channel Capacity with Priority Protocol
Construction of high degree resilient S-boxes with improved nonlinearity
A Simple Randomized Parallel Algorithm for Maximal f-Matchings
Four-State Stabilizing Phase Clock for Unidirectional Rings of Odd Size
On Distributed Search
Comments on "Always-True is not Invariant": Assertional Reasoning About Invariance
Tight bounds for reachability problems on one-counter and pushdown systems
Multiple Stack Branch and Bound
A note on the Consecutive Ones Submatrix problem
Space Efficient Processor Identity Protocol
Sequential and Parallel Algorithms for the Maximum-Weight Independent Set Problem on Permutation Graphs
Space-Efficient Asynchronous Consensus Without Shared Memory Initialization
A Note on the Complexity of Algebraic Differentiation
Fast Algorithm for Sparse Matrix Multiplication
Differential-linear and related key cryptanalysis of round-reduced scream
A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut
The Generic Oracle Hypothesis is False
Local Calculation of Voronoi Diagrams
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Block-wise 2D kernel PCA/LDA for face recognition
An Extension of Khrapchenko's Theorem
A New Permutation Algorithm for Bubble Memories
Optimal 1-fair alternators
Efficient generation of the ideals of a poset in Gray code order
Comments on "A Synchronization Anomaly"
On One Class of Iterative Methods for Obtaining the Generalized Solution of Non-Consistent Systems of Linear Algebraic Equations
Efficient indexing of interval time sequences
Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05
Learning from positive and negative examples: New proof for binary alphabets
Method redefinition--ensuring alternative behaviors
Improved lower bound on the Shannon capacity of C7
An Improvement of Rabin's Probabilistic Algorithm for Generating Irreducible Polynomials over GF(p)
On the Connectivity of the De Bruijn Graph
Wait-free Byzantine consensus
Authenticated Encryption Schemes with Linkage Between Message Blocks
Online coloring of hypergraphs
Semantics-Based Transaction Management for Multidatabase Systems
The Implementation of a Distributed Model for Logic Programming Based on Multiple-Headed Clauses
Particle swarm optimization-based algorithms for TSP and generalized TSP
Homogeneous grammars with a reduced number of non-context-free productions
An efficient algorithm for hyperspherical range query processing in high-dimensional data space
A Dynamic Fault-Tolerant Message Routing Algorithm for Double-Loop Networks
A Parallel Median Algorithm
Monochromatic partitioning of colored points by lines
On the complexity of exchanging
A Better Lower Bound For Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors
Bounding the Attractor of an IFS
When does a correct mutual exclusion algorithm guarantee mutual exclusion?
Once More on Storage for Consecutive Retrieval
Binary jumbled string matching for highly run-length compressible texts
Optimal Parallel Time Bounds for the Maximum Clique Problem on Intervals
A faster parameterized algorithm for set packing
On Las Vegas approximations for metric 1-median selection
An Application of Pattern Matching to a Problem in Geometrical Complexity
The Area-Time Complexity of the VLSI Counter
Deadlock-Free Absorption of Barrier Synchronisations
Well-separated pair decomposition in linear time?
De Bruijn sequences and De Bruijn graphs for a general language
A Note on Deflection Worm Routing on Meshes
One Unary Function Says Less Than Two in Existential Second Order Logic
Improving the performance of Invertible Bloom Lookup Tables
Choosing Task Periods to Minimise System Utilisation in Time Triggered Systems
On the semantics of nested datatypes
Regular D-length: A tool for improved prefix-stable forward Ramsey factorisations
Edit distance of run-length encoded strings
Time Complexity of Loop-Free Two-Way Pushdown Automata
Fast Correlation Attacks on Nonlinear Filter Generators
A note on non-splitting Z-bent functions
The pessimistic diagnosability of alternating group graphs under the PMC model
Long directed ( s , t )-path: FPT algorithm
A Note on the Number of Leftist Trees
Maximum Weight Independent Sets in hole- and co-chair-free graphs
Sparse weighted voting classifier selection and its linear programming relaxations
Time- and Space-Optimal Contour Computation for a Set of Rectangles
A new adaptive network-based fuzzy inference system with adaptive adjustment rules for stock market volatility forecasting
An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph
Enumerating longest increasing subsequences and patience sorting
Addendum to "A Fully Parallel Algorithm for Residue to Binary Conversion"
Storage Allocation is NP-Hard
Flaw and modification of the iKP electronic payment protocols
Flush Primitives for Asynchronous Distributed Systems
On Kolmogorov Complexity in the Real Turing Machine Setting
Application of distributed semi-quantum computing model in phase estimation
A Note on PCP vs. MIP
Corrigenda: Corrections to a Distributed Depth-First Search Algorithm
Single Jog Minimum Area Joining of Compacted Cells
A note on the satisfactory partition problem: Constant size requirement
Online Matching with Blocked Input
Storage for Consecutive Retrieval
A note on Thue games
The Towers of Hanoi Problem with Cyclic Parallel Moves
A note on the terminal Steiner tree problem
Complexity of the Repeaters Allocating Problem
Parallel prefix computation on extended multi-mesh network
On-Line Construction of the Convex Hull of a Simple Polyline
The direct sum of universal relations
Two-dimensional range successor in optimal time and almost linear space
Broadcasting in Complete Networks with Faulty Nodes Using Unreliable Calls
A Note on Approximating Graph Genus
Computing the update of the repeated median regression line in linear time
The largest matching root of unicyclic graphs
Counting the number of crossings in geometric graphs
On the greedy algorithm for the Shortest Common Superstring problem with reversals
An improved algorithm for computing a shortest watchman route for lines
Low Exponent Attack Against Elliptic Curve RSA
The language preservation problem is undecidable for parametric event-recording automata
A probabilistic cryptanalytic method for a time-variant permutation generator
Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes
Simple Deterministic NTS Languages
Minimal sensor integrity: Measuring the vulnerability of sensor grids
Comments on the ' m out of n oblivious transfer'
Algorithms for induced biclique optimization problems
An efficient minimum and maximum global snapshot algorithm
On Zigzag Permutations and Comparisons of Adjacent Elements
Q-ary search with one lie and bi-interval queries
The Lower Bounds on Distributed Shortest Paths
The Most Vital Edges in the Minimum Spanning Tree Problem
On Gallery Watchmen in Grids
Agreement in the Presence of Faults, on Networks of Bounded Degree
Finding a Shortest Hamiltonian Path Inside a Simple Polygon
On insecurity of Naor-Pinkas' distributed oblivious transfer
A Note on Cyclic Closure Operations
Longest distance of a non-uniform dispersion process on the infinite line
Efficient generation of plane trees
"Algorithms for On-the-Fly Garbage Collection" Revisited
Visibility testing and counting
A decoding algorithm for triple-error-correcting binary BCH codes
Path multicoloring in spider graphs with even color multiplicity
Posets with seven linear extensions sortable by three comparisons
Multiple serial episodes matching
Fast 2D discrete cosine transform on compressed image in restricted quadtree and shading format
One-Way Globally Deterministic Synchronized Alternating Finite Automata Recognize Exactly Deterministic Context-Sensitive Languages
LL-Regular Grammars
Minimizing total weighted completion time approximately for the parallel machine problem with a single server
A scalable model for building context-aware applications for noncommunicable diseases prevention
Concise: Compressed 'n' Composable Integer Set
Threshold behaviors of a random constraint satisfaction problem with exact phase transitions
On the super connectivity of Kronecker products of graphs
On the Graceful Numbering of Spanning Trees
Satisfiability of the Smallest Binary Program
Tight Chip Area Lower Bounds for String Matching
Myths About the Mutual Exclusion Problem
Remarks on BioHash and its mathematical foundation
The Complexity of Strict Serializability Revisited
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem
An encoding of partial algebras as total algebras
Relaxed leverage sampling for low-rank matrix completion
Hamming Weights of Correlation Immune Boolean Functions
Expected-Time Complexity Results for Hierarchic Clustering Algorithms Which Use Cluster Centres
Bounds on 2-query Locally Testable Codes with affine tests
A note on improving the performance of approximation algorithms for radiation therapy
An entropy-based uncertainty measure of process models
Data flow analysis from capability lists, with application to RBAC
A Characterization of the Leaf Language Classes
Structural Tolerance and Delaunay Triangulation
Approximating low-congestion routing and column-restricted packing problems
Experiments in Multi-Lingual Information Retrieval
A note on total colorings of 1-planar graphs
A Probabilistic Algorithm for Vertex Connectivity of Graphs
A Fast Algorithm for Renaming a Set of Clauses as a Horn Set
Hausdorff approximation of 3D convex polytopes
On the freedom of decryption
Antimagic labeling graphs with a regular dominating subgraph