yusuke1997/dblp-id-title huggingface dataset:
A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs
Some characterizations of Parikh matrix equivalent binary words
On the Factors of the Thue-Morse Word on Three Symbols
Sensitivity vs. Block Sensitivity (an Average-Case Study)
Negative results on learning multivalued dependencies with queries
On finding medians of weighted discrete points
Corrigenda: Complexity of the Closest Vector Problem in a Lattice Generated by (0, 1)-Matrix
Lower bounds for context-free grammars
The Liveness Property of On-the-Fly Garbage Collector - A Proof
Extending Bachmair's Method for Proof by Consistency to the Final Algebra
Automata Networks and Optimization
Regular patterns, regular languages and context-free languages
Fair Derivations in E0L Systems
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs
Polynomial Time Schedulability Test for Periodic Non-Preemptive 2-Task System
Andrei P. Ershov (1931-1988)
Graph compression and the zeros of polynomials
A Note on the 'Parallel Computation Thesis'
Boundary properties of the satisfiability problems
Finding a Target Subnetwork in Sparse Networks with Random Faults
Defying gravity and gadget numerosity: The complexity of the Hanano Puzzle and beyond
On the Routing Problem in Faulty Supercubes
An Efficient Permutation-Based Parallel Range-Join Algorithm on N-Dimensional Torus Computers
An Efficient Computation of Right Context for LR-Based Error Repair
Test Sequence Generation from the Protocol Data Portion Based on the Selecting Chinese Postman Algorithm
A Note on Diameter of Acyclic Directed Hypercubes
Test suite oscillations
Why is it hard to beat O ( n 2 ) for Longest Common Weakly Increasing Subsequence?
A filtering algorithm for k-mismatch with don't cares
Optimal Parameters for Load Balancing Using the Diffusion Method in k-Ary n-Cube Networks
Sorting Numbers Using Limited Systolic Coprocessors
Parametric runtime verification is NP-complete and coNP-complete
A note on nonexistence of vectorial bent functions with binomial trace representation in the PS - class
An Optimal Bound for Path Weights in Huffman Trees
A 4n-Lower Bound on the Monotone Network Complexity of a One-Output Boolean Function
NP-Completeness of k-Connected Hyperedge-Replacement Languages of Order k
The Robber Route Problem
Three Efficient Algorithms for Counting Problems
Shifts and Loopless Generation of k -Ary Trees
Folding of the Plane and the Design of Systolic Arrays
A note on competitive diffusion through social networks
Faster approximation for maximum independent set on unit disk graph
An implicit degree condition for k -connected 2-heavy graphs to be hamiltonian
Graphs without a partition into two proportionally dense subgraphs
An Efficient Algorithm for Multiple Simultaneous Broadcasts in the Hypercube
Smaller kernels for two vertex deletion problems
Desynchronization attack on RAPP ultralightweight authentication protocol
Memoryless determinacy of finite parity games: Another simple proof
On Uniform Learnability of Language Families
Monte Carlo Estimation of Numerical Stability in Fast Algorithms for Systems of Bilinear Forms
A note on minimum-sum coverage by aligned disks
A Starvation-Free Solution to the Mutual Exclusion Problem
A Measure in Which Boolean Negation is Exponentially Powerful
The Synchronization Problem in Protocol Testing and its Complexity
An NC 2 Algorithm for Testing Similarity of Matrices
The quantum query complexity of learning multilinear polynomials
The Bandwidth Allocation Problem in the ATM Network Model is NP-Complete
Uncertain Voronoi diagram
A fast modular multiplication algorithm for calculating the product AB modulo N
CuCoTrack: Cuckoo filter based connection tracking
A Note on the Construction of Marked Graphs
Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph
Scattered context grammars generate any recursively enumerable language with two nonterminals
The RS-tree: An efficient data structure for distance browsing queries
Strong chromatic index of K 4 -minor free graphs
A real polynomial for bipartite graph minimum weight perfect matchings
Corrigenda: Dynamic Programming on Linear Pipelines
A Parallel Algorithm for Constructing Projection Polyhedra
Prespecification in Data Refinement
A Note on the Commutative Closure of Star-Free Languages
Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
Polynomial time algorithms for some minimum latency problems
Merging by the Parallel Jump Searching Algorithm
The analysis of packet loss prediction for Gilbert-model with loss rate uplink
On the Additive Complexity of 2 x 2 Matrix Multiplication
Biclique cryptanalysis of LBlock and TWINE
An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem
Lindenmayer Grammars and Symbolic Testing
Bit-parallel string matching under Hamming distance in O(n[m/w]) worst case time
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm
Approximating Functions by Their Poisson Transform
A synchronization algorithm for processes with dynamic priorities in computer networks with node failures
Languages Represented by Boolean Formulas
Syntactic Error Repair Using Repair Patterns
On Temporal Aggregate Processing Based on Time Points
Range mode and range median queries in constant time and sub-quadratic space
Improved bounds on the average distance to the Fermat-Weber center of a convex object
Non-Deterministic Expressions and Predicate Transformers
A faster off-line algorithm for the TCP acknowledgement problem
Computing simple-path convex hulls in hypergraphs
A Decomposition Rule for the Hoare Logic
A Linear Time Algorithm for Longest (s,t)-Paths in Weighted Outer Planar Graphs
Deadlock-freeness of hexagonal systolic arrays
Maximizing the throughput of parallel jobs on hypercubes
Vertex degrees and 2-cuts in graphs with many hamiltonian vertex-deleted subgraphs
The Complexity of Some Complementation Problems
On the longest increasing subsequence of a circular list
On Termination and Phase Changes in the Presence of Unreliable Communication
Updating <=, <-chains
A General Implementation of Relational Recursion with Speedup Techniques for Programmers
An output sensitive algorithm for computing a maximum independent set of a circle graph
Learning unions of high-dimensional boxes over the reals
Recursion-free modular arithmetic in the lambda-calculus
Communication-efficient failure detection and consensus in omission environments
Applying adaptive test cases to nondeterministic implementations
A Note on Natural Selection
On Fault-Tolerant Fixed Routing in Hypercubes
Dynamic programming solution for multiple query optimization problem
10-Gabriel graphs are Hamiltonian
Embedding a family of disjoint multi-dimensional meshes into a crossed cube
Two Normal Form Theorems for CSP Programs
On packing shortest cycles in graphs
Sub-Regular Grammar Forms
A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphs
Jump Interpolation Search Trees and Symmetric Binary Numbers
An optimal lower bound for 2-query locally decodable linear codes
On the hamiltonicity of the cartesian product
On Efficient Implementation of LR-Attributed Grammars
Remark on the Hsu-Du New Algorithm for the Longest Common Subsequence Problem
On Immunity Against Biham and Shamir's "Differential Cryptanalysis"
Complexity Bounds for Equivalence and Isomorphism of Latin Squares
The multiple domination and limited packing problems in graphs
Determining Connected Components in Linear Time by a linear Number of Processors
The Floyd-Warshall algorithm on graphs with negative cycles
The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case
Improved approximation bounds for the minimum rainbow subgraph problem
An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees
A framework for pursuit evasion games in R n
The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols
The on-line first-fit algorithm for radio frequency assignment problems
Performance Analysis of Greedy Heuristic to Find a Minimum Total-Jogs Layout for River Routing
Triangulations without minimum-weight drawing
Paired many-to-many disjoint path covers of hypercubes with faulty edges
Resource efficient implementation of T-Boxes in AES on Virtex-5 FPGA
A Probabilistic Algorithm for Verifying Matrix Products Using O(n²) Time and log_2 n + O(1) Random Bits
The class of HDT0L sequences is closed with respect to rational functions
Short proofs for online multiclass prediction on graphs
Extendible Hashing with Overflow
An Efficient Deadlock Avoidance Algorithm
New Algorithms for the LCA Problem and the Binary Tree Reconstruction Problem
The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
Super restricted edge connected Cartesian product graphs
The Convergence Span of Greedy Load Balancing
Immediate Error Detection in Strong LL(1) Parsers
Training Digraphs
Consecutive Retrieval Property-Revisited
The generic approximation lemma
Fault Tolerant Routing in the Star and Pancake Interconnection Networks
Yet Another Distributed Depth-First-Search Algorithm
Online chasing problems for regular polygons
Unfold/fold Transformations for Disjunctive Logic Programs
Robot localization in a grid
A Parallel Algorithm for Recognizing Unordered Depth-First Search
Scaling multiple addition and prefix sums on the reconfigurable mesh
On the Number of ANDs Versus the Number of ORs in Monotone Boolean Circuits
An Application of the Planar Separator Theorem to Counting Problems
Reduction of stochastic parity to stochastic mean-payoff games
A strong lower bound for approximate nearest neighbor searching
On Independent Spanning Trees
Cores of random r-partite hypergraphs
(2, 1)-Total number of trees with maximum degree three
Exact complexity of Exact-Four-Colorability
Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs
On the graph turnpike problem
Proof System for Weakest Prespecification
New multi-stage secret sharing in the standard model
A Note on Optimal Scheduling for Two-Processor Systems
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
On the fixed-parameter tractability of parameterized model-checking problems
Internal state recovery of keystream generator LILI-128 based on a novel weakness of the employed Boolean function
Scheduling of Unit-Length Independent Tasks with Execution Constraints
Coloring Algorithms for K_5-Minor Free Graphs
A Highly Safe Self-Stabilizing Mutual Exclusion Algorithm
Elastic threshold-based admission control for QoS satisfaction with reward optimization for servicing multiple priority classes in wireless networks
A note on maximum independent sets in rectangle intersection graphs
Optimal Policy for Database Backup and Recovery
The Completeness of GP-Resolution for Annotated Logics
Robust Vector Space Secret Sharing Schemes
Improved cube-attack-like cryptanalysis of reduced-round Ketje-Jr and Keccak-MAC
Author's Reply to Warren Burton's Comments on Distributive Partitioning Sorting
Checking in polynomial time whether or not a regular tree language is deterministic top-down
Tree pattern matching with a more general notion of occurrence of the pattern
An Optimal Algorithm for Realizing a Delaunay Triangulation
Parallel Algorithms for Connectivity Problems on Interval Graphs
Rate-adaptive weighted fair queueing for energy-aware scheduling
Super-Exponentials Nonprimitive Recursive, but Rudimentary
The Balanced Binary Tree Technique on Mesh-Connected Computers
Multiprocessor Automata
Completeness Issues for Join Dependencies Derived from the Universal Relation Join Dependency
The Equivalence Problem for Deterministic T0L-Systems is Undecidable
A note on optimal metering schemes
Approximating a planar convex set using a sparse grid
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
Dynamic threshold secret reconstruction and its application to the threshold cryptography
On approximating metric 1-median in sublinear time
On Derivation Preservation
A note on the complexity of computing the number of reachable vertices in a digraph
L-visibility drawings of IC-planar graphs
Distinguisher on full-round compression function of GOST R
Minimum cycle bases of direct products of complete graphs
Approximation schemes for the parametric knapsack problem
Greedy algorithms for generalized k-rankings of paths
Prefix transpositions on binary and ternary strings
On special families of morphisms related to [delta]-matching and don't care symbols
Restricted arc-connectivity of digraphs
A constant-time sampling algorithm for binary Gaussian distribution over the integers
A generalization of the Blind Rotating Table game
A new self-stabilizing algorithm for maximal p-star decomposition of general graphs
On minimal arbitrarily partitionable graphs
Structured Implementation of Symbolic Execution: A First Part in a Program Verifier
The constrained longest common subsequence problem
Efficient Address Generation in a Parallel Processor
A mutual exclusion algorithm with optimally bounded bypasses
Constant runtime complexity of term rewriting is semi-decidable
Distortion lower bounds for line embeddings
Modelling and Animating Information Systems Dynamics
The Unicity Distance: An Upper Bound on the Probability of an Eavesdropper Successfully Estimating the Secret Key
An implicit degree sum condition for cycles through specified vertices
Batch Scheduling from Short Lists
Optimal Availability Quorum Systems: Theory and Practice
Geodesic spanners for points in R3 amid axis-parallel boxes
Optimal correlation attack on the multiplexer generator
The NPO-Completeness of the Longest Hamiltonian Cycle Problem
A Parallel View of Stable Marriages
On the query complexity of finding a local maximum point
Optimal (D-J)-monotonic priority assignment
On the Complexity of Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs
Selftype is a Special Case
Regular resolution effectively simulates resolution
Finding ( s , d )-hypernetworks in F-hypergraphs is NP-hard
A new fast heuristic for labeling points
An identity-based society oriented signature scheme with anonymous signers
An O(n) Algorithm for Finding an Optimal Position with Relative Distances in an Evolutionary Tree
Height Balance Distribution of Search Trees
Uniformly inserting points on square grid
Methodical Solution of the Problem of Ascending Subsequences of Maximum Length Within a Given Sequence
Failure-Equivalent Transformation of Transition Systems to Avoid Internal Actions
PACS, simple-PAC and query learning
On Hamiltonian cycles and Hamiltonian paths
Rating prediction using review texts with underlying sentiments
Some Remarks on the Possibility of Extending Resolution Proof Procedures to Intuitionistic Logic
Pathwidth of cubic graphs and exact algorithms
In-Place Sorting with Fewer Moves
An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems
On a Generalization of Binary Search
A (3 + ϵ ) k -vertex kernel for edge-disjoint triangle packing
Minimal Storage Representations for Binary Relations
1, 2 Conjecture - the multiplicative version
Evolutionary computing
The Clique Problem for Planar Graphs
Security of permutation-based compression function Ip231
Linear space adaptive data structures for planar range reporting
Approximating partition functions of the two-state spin system
A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
A Note on Inferring Uniquely Terminating Code Languages
Efficient generation of restricted growth words
Deciding the Immutability of Regular Codes and Languages Under Finite Transductions
Compact Hilbert indices: Space-filling curves for domains with unequal side lengths
Variables and scopes considered formally
Checker for Data Structures which Sort Elements
A Note on Array Grammars
The odd chromatic number of a toroidal graph is at most 9
An Ordered Minimal Perfect Hashing Scheme with Single Parameter
On Chen and Chen's new tree inclusion algorithm
Perception-Based Configuration Design of Computer Systems
A Note on Minimizing Submodular Functions
A Note on Lower Bounds for the Maximum Area and Maximum Perimeter (kappa)k-gon Problems
On the analysis of Bloom filters
Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces
Greedy domination on biclique-free graphs
Analysis of the Hilbert Curve for Representing Two-Dimensional Space
Inductive Data Types for Predicate Transformers
An Inproved Upper Bound on the Non-3-Colourability Threshold
Two Design Patterns for Data-Parallel Computation Based on Master-Slave Model
Reachability in graphs having linear 2-arboricity two is NL-hard
Using Synthetic Perturbations and Statistical Screening to Assay Shared-Memory Programs
Alternating Real-Time Computations
Static Analysis for Optimizing Reference Counting
Honeycomb tori are Hamiltonian
Automatic proving or disproving equality loop invariants based on finite difference techniques
A Note on Rabin's Nearest-Neighbor Algorithm
An Optimal Demand Prepaging Algorithm
Random 2-SAT and unsatisfiability
The Causal Ordering Abstraction and a Simple Way to Implement it
A D0L-T0L Public Key Cryptosystem
Minimum cost source location problem with vertex-connectivity requirements in digraphs
More on Master Keys for Group Sharing
The number of spanning trees of a class of self-similar fractal models
Greedy rankings and arank numbers
Sorting a Linked List with Equal Keys
An Improved Parallel Processor Bound in Fast Matrix Inversion
Optimal Fault-Tolerant Routings for Connected Graphs
Paths in Möbius cubes and crossed cubes
Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard
Lower and Upper Bounds of the Sizes of Domains: Estimates and Experiments
Effective definability of the reachability relation in timed automata
On Representation and Querying Incomplete Information in Databases with Bags
Nonadaptive quantum query complexity
Average Performance of a Greedy Algorithm for the On-Line Minimum Matching Problem on Euclidean Space
Two-Machine Flowshop Scheduling with Consecutive Availability Constraints
Cycles passing through a prescribed path in a hypercube with faulty edges
On Hardness of One-Way Functions
An Improved Fixed-Parameter Algorithm for Vertex Cover
A fast algorithm for order-preserving pattern matching
Lazy Update: An Efficient Implementation of LRU Stacks
The Hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks
Testing String Superprimitivity in Parallel
Strong edge-colorings of sparse graphs with 3Δ - 1 colors
A Proof Rule for Multiple Coroutine Systems
On path bipancyclicity of hypercubes
Thin trees in 8-edge-connected planar graphs
An Extension of Savitch's Theorem to Small Space Bounds
Impact of Intel's new instruction sets on software implementation of GF(2)[x] multiplication
On the Depth Complexity of the Counting Functions
The Lexicographically First Topological Order Problem is NLOG-Complete
Width and Depth of Combinational Logic Circuits
Symbolic tree automata
Fault-tolerant hamiltonian laceability of hypercubes
Easy intruder deduction problems with homomorphisms
The Optimum Execution Order of Queries in Linear Storage
Counterexamples to Termination for the Direct Sum of Term Rewriting Systems
A variant of Reiter's hitting-set algorithm
A Note on Bounded-Reversal Multipushdown Machines
Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
On the efficient construction of quasi-reversible automata for reversible languages
A Note on Scattered Context Grammars
Quantum lower bounds for the Goldreich-Levin problem
Low-complex dynamic programming algorithm for hardware/software partitioning
The symmetry number problem for trees
Complexity of problem TF 2|v=1, c=2|C max
Flow equivalent trees in undirected node-edge-capacitated planar graphs
A note on BDD problems with λ 2 -gap
On the terminal Steiner tree problem
Some techniques for faster scalar multiplication on GLS curves
Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links
Tight Lower Bounds on the Length of Word Chains
On maximum induced matchings in bipartite graphs
Generalized Division for Relational Algebraic Language
Set-based access conflict analysis of concurrent workflow definition
On the Computational Complexity of Cardinality Constraints in Relational Databases
Parallel Circle-Cover Algorithms
Extended Impossibility Results for Asynchronous Complete Networks
Efficient automatic discovery of 'hot' itemsets
Denotational Linear Time Semantics and Sequential Composition
Hiding resources that can fail: An axiomatic perspective
Modelling a Fast Parallel Thinning Algorithm for Shared Memory SIMD Computers
Haskell Overloading is DEXPTIME-Complete
Worst-case analysis of Weber's GCD algorithm
An Efficient, Strongly Polynomial, epsilon-Approximation Schemes
The minimum bandwidth required at each time slot of the fast broadcasting scheme
A simple approach to nondecreasing paths
An Efficient One-Side Height Minimization Algorithm for Routing Around a Rectangle
Sensitivity versus block sensitivity of Boolean functions
On Two Theorems of Lenstra
Formal Derivation of a List Processing Program
A Simple Algorithm for Learning O (log n)-Term DNF
Optimal L ( δ 1 , δ 2 , 1)-labeling of eight-regular grids
On Path Equivalence of Nondeterministic Finite Automata
Revisiting AES related-key differential attacks with constraint programming
A Note on Neural Sorting Networks with O(1) Time Complexity
Dividing Strategies for the Optimization of a Test Suite
On Decision Trees for Orthants
Context exhumation after the Burrows-Wheeler transform
A Linear Selection Algorithm for Sets of Elements with Weights
A new multiple classifier system for the prediction of protein's contacts map
Compror: On-line lossless data compression with a factor oracle
On a Recursion Connected with Tree Balancing Algorithms
A note on makespan minimization in proportionate flow shops
New bounds on a hypercube coloring problem
On Methods for Safe Introduction of Operations
On the spectrum of projective norm-graphs
The Logic-Termal Equivalence is Polynomial-Time Decidable
On a Simple Deadlock Recovery Problem
Batch scheduling of identical jobs on parallel identical machines
Program Development: From Enumeration to Backtracking
On inferring linear single-tree languages
A Simple Fixed Point Characterization of Three-Valued Stable Model Semantics
The complexity of pure equilibria in mix-weighted congestion games on parallel links
Semantic Data Modelling Using Linear Logic
Denotational Semantics of Communicating Sequential Programs
Quantum symmetrically-private information retrieval
On the security of two identity-based signature schemes based on pairings
On Separation of the Emptiness and Equivalence Problems for Program Schemes
On colouring (2 P 2 , H )-free and ( P 5 , H )-free graphs
Longest bordered and periodic subsequences
A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph
On the Non-Compactness of the Class of Program Schemas
Should the Stable Rounding Rule be Radix-Dependent?
Probabilistic Polynomial Time is Closed under Parity Reductions
Incremental deployment of network monitors based on Group Betweenness Centrality
Routing automorphisms of the hypercube
The Number of Minimal Word Chains Computing the Thue-Morse Word
A note on 3-D simple points and simple-equivalence
A Linear-Time Algorithm for the Weighted Feedback Vertex Problem on Interval Graphs
Fault-diameter of Cartesian graph bundles
On a connection between small set expansions and modularity clustering
On Fault-Tolerant Embedding of Hamiltonian Circuits in Line Digraph Interconnection Networks
Rank and select operations on a word
Trajectory Planning in H-Space
An impossibility about failure detectors in the iterated immediate snapshot model
A strict strong coloring of trees
Approximating maximum weight K-colorable subgraphs in chordal graphs
On the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces
Communication Errors in the pi-Calculus are Undecidable
Algorithm and hardness results on hop domination in graphs