yusuke1997/dblp-id-title huggingface dataset:
Interconnections between classes of sequentially compositional temporal formulas
An Exercise in Fault-Containment: Self-Stabilizing Leader Election
Estimating the Range of a Function in an Online Setting
A Simple Optimal Parallel Algorithm for the Minimum Coloring Problem on Interval Graphs
A faster FPT algorithm for Bipartite Contraction
Hidden Line Elimination for Isooriented Rectangels
A new 3-CNF transformation by parallel-serial graphs
Binary Search Networks: A New Method for Key Searching
On the smallest enclosing information disk
An accurate and practical buffer allocation model for the buffer cache based on marginal gains
Double Roman domination in trees
Some Remarks on the Kronecker Product of Graphs
Rigidity of a simple extended lower triangular matrix
Fair cost-sharing methods for the minimum spanning tree game
An Experiment in Formal Definition of Operating System Facilities
On testing substitutability
Global roundings of sequences
Bounds on Sample Space Size for Matrix Product Verification
Competitive analysis of online revenue management with hierarchical resources
A Pumping Lemma for Deterministic Context-Free Languages
On the number of broadcast schemes in networks
Speeding up CRC32C computations with Intel CRC32 instruction
On the Average Height of Trees in Digital Search and Dynamic Hashing
Optimum Domination in Weighted Trees
Cryptanalysis of a pay-as-you-watch system
Corrigendum to: "A counterexample for the proof of implication conjecture on independent spanning trees" [Information Processing Letters 113 (14-16) (2013) 522-526]
Repeated detection of conjunctive predicates in distributed executions
A New Hierarchy of Two-Dimensional Array Languages
O(log n) Numerical Algorithms on a Mesh with Wormhole Routing
Computing K-terminal reliability of d-trapezoid graphs
A Modified Version of the Rao-Nam Algebraic-Code Encryption Scheme
An improved preimage attack against HAVAL-3
Finding next-to-shortest paths in a graph
Modified quadratic residue constructions and new extremal binary self-dual codes of lengths 64, 66 and 68
From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems
Upper and Lower Bounds for Stochastic Marked Graphs
A note on the hardness of sparse approximation
Approximation error of single hidden layer neural networks with fixed weights
The D0L-ness for Context-Free Languages is Decidable
Counting Closed Walks in Generalized de Bruijn Graphs
Sequence Matching with Binary Codes
Fault-tolerant analysis of a class of networks
Embedding the incomplete hypercube in books
Distance Measures on Intersecting Objects and Their Applications
A fixed-parameter algorithm for the vertex cover P 3 problem
Packing plane spanning trees and paths in complete geometric graphs
A More Efficient Generalization of Petersons's Mutual Exclusion Algorithm
Node-pancyclicity and edge-pancyclicity of hypercube variants
A Robust Multi-Priority Topology-Independent Transmission Schedule for Packet Radio Networks
Computing polynomial program invariants
A note on the size of prenex normal forms
On Attribute Grammars Without Atribute Synthesis
Attacks on Threshold Signature Schemes with Traceable Signers
On the Time to Traverse all Edges of a Graph
On shape Delaunay tessellations
Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths
A Note on Undercover Relation
A Note on Lossless Database Decompositions
On the longest path algorithm for reconstructing trees from distance matrices
Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space
Finding smooth maps is NP-complete
Modal Logics in the Theory of Relational Databases
Space-time trade-offs for some ranking and searching queries
Uniform Partitioning of Relations Using Histogram Equalization Framework: An Efficient Parallel Hash-Based Join
Are unique subgraphs not easier to find?
A Study of a Page-on-Demand System
A Note on Weak Operator Precedence Grammars
Phased RGSS: An improved disk array scheduling for continuous media retrieval
Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof
An improved kernel for the flip distance problem on simple convex polygons
A new parameter for a broadcast algorithm with locally bounded Byzantine faults
Online search for a hyperplane in high-dimensional Euclidean space
Hamilton Cycles in Trivalent Cayley Graphs
Parallel Algorithms for Finding Hamilton Cycles in Random Graphs
Weak bases of Boolean co-clones
Seeding strategies and recombination operators for solving the DNA fragment assembly problem
Term Rewriting and Hoare Logic- Coded Rewriting
Comments on "Ring Based Termination Detection Algorithm for Distributed Computations"
Completeness of context-sensitive rewriting
The music of streams
A Lower Bound for Randomized On-Line Multiprocessor Scheduling
The Edge Hamiltonian Path Problem is NP-Complete
Some Properties of Sets Tractable Under Every Polynomial-Time Computable Distribution
A greedy topology design to accelerate consensus in broadcast wireless sensor networks
The Algorithmic Complexity of Colour Switching
On the Size of a Square-Free Morphism on a Three Letter Alphabet
A note on the k-restriction problem
Regular set of representatives for time-constrained MSC graphs
Separability of rational relations in A* × N m by recognizable relations is decidable
Non-approximability of weighted multiple sequence alignment for arbitrary metrics
Computing Euclidean bottleneck matchings in higher dimensions
On constant-round concurrent non-malleable proof systems
The simplified weighted sum function and its average sensitivity
An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs
Integrity Aspects of Quasi Serializability
On a traitor tracing scheme from ACISP 2003
Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees
An Optimal Algorithm for Constructing Oriented Voronoi Diagrams and Geographic Neighborhood Graphs
Recursive Descent Parsing Using Implementation Languages Requiring Definition Before Use
The cost of probabilistic agreement in oblivious robot networks
Computing a Median Point of a Simple Rectilinear Polygon
Formal Derivation of an Algorithm for Distributed Phase Synchronization
Constant Time Sorting on a Processor Array with a Reconfigurable Bus System
Constructing Simply Recursive Programs from a Finite Set of Good Examples
Functional Grammars
Stability of Desynchronized 0L Systems
A Note on "A Simplified Account of Polymorphic References"
A Gap Theorem for the Anonymous Torus
A modular weighted sparse representation based on Fisher discriminant and sparse residual for face recognition with occlusion
An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
A one-time signature using run-length encoding
The Problem of Absolute Privacy
On the Security of Image Encryption Method
Linear Complexity of the x 2 Mod p Orbits
An approximation algorithm for sequential rectangle placement
Security protocols: from linear to classical logic by abstract interpretation
Linear Expected Time of a Simple Union-Find Algorithm
Ring Based Termination Detection Algorithm for Distributed Computations
Scheme for Secure Digital Mobile Communications Based on Symmetric Key Cryptography
On Estimating the Complexity of Logarithmic Decompositions
Some Comments on Building Heaps in Parallel
Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept
On the Size of Projections: I
Mixed Transitivity for Functional and Multivalued Dependencies in Database Relations
Even Initial Feedback Vertex Set Problem is NP-Complete
Mutual witness proximity graphs
On the additive constant of the k-server Work Function Algorithm
Polynomial invariants for cactuses
Another Note on Recursive Ascent
Sweeping simple polygons with the minimum number of chain guards
A two-level temporal logic for evolving specifications
Optimal Parallel Selection in Sorted Matrices
Performance analysis for (X, S)-bottleneck cell in large-scale wireless networks
On the fixed-parameter tractability of the equivalence test of monotone normal forms
An Extension to Linear Resolution with Selection Function
A Note on Removing Loops from Table-Driven Code Generators
On edge covering colorings of graphs
Shift-or string matching with super-alphabets
Derivation of a parallel string matching algorithm
Graph 2-Isomorphism is NP-Complete
Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements
A fast deterministic smallest enclosing disk approximation algorithm
Vertex coloring edge-weighted digraphs
P systems without multiplicities of symbol-objects
Labelled packing functions in graphs
Clique-heavy subgraphs and pancyclicity of 2-connected graphs
Upper bounds on the queuenumber of k-ary n-cubes
A Parallelizable Lexicographically First Maximal Edge-Induced Subgraph Problem
Some results on the inverse sum indeg index of a graph
Lower bounds for testing Euclidean Minimum Spanning Trees
Suppression distance computation for hierarchical clusterings
Reconstructing hv-Convex Polyominoes from Orthogonal Projections
Two models of two-dimensional bandwidth problems
A Fan-type result on k-ordered graphs
A Note on Redundant Disk Modulo Allocation
A Fast and Effective Heuristic for the Feedback Arc Set Problem
Approximately n-secting an angle
An Infinite Word Language Which is Not co-CFL
Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
A Lower Bound for Randomized On-Line Scheduling Algorithms
Developing fault-tolerant distributed loops
Vertex rankings of chordal graphs and weighted trees
A more efficient algorithm for perfect sorting by reversals
Stable Unmerging in Linear Time and Constant Space
Minimizing center key storage in hybrid one-way function based group key management with communication constraints
A Note on Preemptive Scheduling of Periodic, Real-Time Tasks
Corrigendum to "The path-partition problem in block graphs"
On deterministic weighted automata
A note on the strong matching preclusion problem for data center networks
An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification
Theorem-proving anonymity of infinite-state systems
On induced-universal graphs for the class of bounded-degree graphs
Constant-space quantum interactive proofs against multiple provers
A Fast Method for Interpolation Using Preconditioning
Improving practical exact string matching
Fault-Tolerant Routing in Unique-Path Multistage Omega Network
Scheduling with job release dates, delivery times and preemption penalties
How to detect a counterfeit coin: Adaptive versus non-adaptive solutions
On the Complexity of Quality of Service Routing
Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
Linear-time algorithm for finding a maximum-density segment of a sequence
Large Sets in AC 0 have Many Strings with Low Kolmogorov Complexity
Algorithms for Parsimonious Complete Sets in Directed Graphs
Shortest Path Under Rational Constraint
Note on covering monotone orthogonal polygons with star-shaped polygons
Searching for nonlinear feedback shift registers with parallel computing
On the computational complexity of length- and neighborhood-constrained path problems
Cryptanalysis of a CP-ABE scheme with policy in normal forms
Welsh-Powell Opposition Graphs
On (Greek D)D_P²-Immunity
A Note on Computational Indistinguishability
A PTIME-complete matching problem for SLP-compressed words
The Towers of Hanoi Problem with Parallel Moves
Congruent Weak Bisimulation with Dense Real-Time
Security weaknesses of authenticated key agreement protocols
Achromatic Number is NP-Complete for Cographs and Interval Graphs
An Efficient Distributed Depth-First-Search Algorithm
A Data Structure for Dynamic Range Queries
A Note on the Formula Size of the "mod k" Functions
On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees
Fast equality test for straight-line compressed strings
Covering a Set of Points in Multidimensional Space
A Characterization of the Information Content of a Classification
A note on the verification of automata specifications of probabilistic real-time systems
A self-stabilizing (Delta+4)-edge-coloring algorithm for planar graphs in anonymous uniform systems
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
Traversing Binary Trees Simply and Cheaply
Comment on "Efficient Huffman Decoding" and "An Efficient Finite-State Machine Implementation of Huffman Decoders"
A Linear Time Algorithm for a Matching Problem on the Circle
How to safely close a discussion
A logical characterization of data languages
Analysis of improved signcryption scheme with key privacy
Computing Dominators in Parallel
Succinct data structures for nearest colored node in a tree
Optimum sweeps of simple polygons with two guards
Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms
Compile Time Type Checking of Structure Field Accessing
A Nonapproximability Result for Finite Function Generation
Queue-Mergesort
On the Emptiness of the Intersection of Two D0S Languages Problem
Analysis of Boyer and Moore's MJRTY algorithm
A comment on "Independent spanning trees in crossed cubes"
Algorithms for Adaptive Huffman Codes
Online version of the theorem of Thue
Enumerating the Kernels of a Directed Graph with no Odd Circuits
Time Complexity of Unambiguous Path Systems
Optimal-size problem kernels for d -Hitting Set in linear time and space
On the linear complexity profile of explicit nonlinear pseudorandom numbers
On Reductions to Sets that Avoid EXPSPACE
On the parameterized complexity of d-dimensional point set pattern matching
A faster parameterized algorithm for temporal matching
An approximative solution to the Zookeeper's Problem
On approximate reconfigurability of label cover
On the Equity of Mutual Exclusion Algorithms in Distributed Systems
Linearity and nondeletion on monadic context-free tree grammars
Testing for Equality Between Maximum Matching and Minimum Node Covering
Ranking and unranking bordered and unbordered words
Symmetric Matrix-Vector Product on a Ring of Processors
Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems
Can I find a partner? Undecidability of partner existence for open nets
A Distributed Synchronization Scheme for Fair Multi-Process Handshakes
A note on Girault's self-certified model
Expressive completeness by separation for discrete time interval temporal logic with expanding modalities
An improved exact algorithm for minimum dominating set in chordal graphs
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
Ideal contrast visual cryptography schemes with reversing
L(p, q)-labelling of K 4 -minor free graphs
Square-free partial words
A simple local 3-approximation algorithm for vertex cover
Scalable Bloom Filters
Garbage Collection can be Faster than Stack Allocation
A note on secret sharing schemes with three homogeneous access structure
Certain Problems of the Theory of Structured Program Schemes
An O(n log n) Algorithm for Finding Dissimilar Strings
More on BPP and the Polynomial-Time Hierarchy
Efficient Searching Using Partial Ordering
Counting maximal independent sets in directed path graphs
An Eades-McKay Algorithm for Well-Formed Parentheses Strings
A note on emptiness for alternating finite automata with a one-letter alphabet
Circulant graphs and GCD and LCM of subsets
Cyclically repetition-free words on small alphabets
On a generalized modularization theorem
On an L-Stable Method for Stiff Differential Equations
Gaussian Elimination is Optimal for Solving Linear Equations in Dimension Two
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
A Result Relating Disjunctive Self-Reducibility to P-Immunity
Kernelization lower bound for Permutation Pattern Matching
Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-Like Cutting Planes
On the relative power of reduction notions in arithmetic circuit complexity
On transitive orientations with restricted covering graphs
Updating Timestamp Interval for Dynamic Adjustment of Serialization Order in Optimistic Concurrency Control-Time Interval (OCCTI) Protocol
On the combinatorics of suffix arrays
Communication Problems on MIMD Parallel Computers
An ID-based cryptographic mechanisms based on GDLP and IFP
Dominations in Trapezoid Graphs
Bounds for the expected duration of the monopolist game
Reduction of Network Cost and Wiring in Ranade's Butterfly Routing
Shortest Paths in the Plane with Convex Polygonal Obstacles
The complexity of computing (almost) orthogonal matrices with ε -copies of the Fourier transform
The maximum f-depth spanning tree problem
A Note on External Sorting Using Almost Single Input Buffering
Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs
Improving compressed matrix multiplication using control variate method
Algorithms counting monotone Boolean functions
Proving Open Properties by Induction
Two-string consensus problem under non-overlapping inversion and transposition distance
The forwarding indices of augmented cubes
A Tight Bound for Approximating the Square Root
An Optimal Algorithm for Generating Minimal Perfect Hash Functions
Parallelism and the Maximal Path Problem
An efficient algorithm for cyclic reference counting
Application of Exponential Hetero-Associative Memory on Frequency Classifier
Locating a tree in a phylogenetic network
On a Correspondence Between Binary Trees and a Certain Type of Permutation
Existence of home states in Petri nets is decidable
Incorporating cardinality constraints and synonym rules into conditional functional dependencies
Comments on Morris's Starvation-Free Solution to the Mutual Exclusion Problem
An Incompleteness Result in Process Algebra
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
Scaled and permuted string matching
Convergence analysis of a self-adaptive multi-objective evolutionary algorithm based on grids
On the effectiveness of the genetic paradigm for polygonization
An Adaptive Time Advancement Algorithm for Discrete Simulation
Star coloring of cubic graphs
A note on finding all homogeneous set sandwiches
The General Steiner Tree-Star problem
An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem
There are no p-Complete Families of Symmetric Boolean Functions
Calculating the Hausdorff Distance Between Curves
Load Imbalance in DASD Dynamic Reconnection
Scheduling Complete Intrees on Two Uniform Processors with Communication Delays
A Note on the Best-Case Complexity
Perfect quantum teleportation by four-particle cluster state
A note on SAT algorithms and proof complexity
Strong diagnosability of regular networks under the comparison model
Improving multikey Quicksort for sorting strings with many equal elements
Linear Complexity Profiles and Jump Complexity
Distributed User Identification by Zero-Knowledge Access Rights Proving
Oriented Balanced Trees and Equivalence Relations
Bidirectional Heuristic Search with Limited Resources
Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP
Functions Computable with Limited Access to NP
Public key signatures in the multi-user setting
Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves
A Simple Solution to the Two Paths Problem in Planar Graphs
Computing the Number of Mergings with Constraints
A New Privacy Homomorphism and Applications
Computing the subset partial order for dense families of sets
On Accelerating Newton's Method Based on a Conic Model
Exploiting the Optimal Paging Algorithms
The complexity of the zero-sum 3-flows
Mutual exclusion in fully anonymous shared memory systems
Stabbing C-Oriented Polygons
On semi-transitive orientability of split graphs
On the performance of the first-fit coloring algorithm on permutation graphs
Heavy and light paths and Hamilton cycles
Parallel evolutionary algorithms can achieve super-linear performance
A Model for k -Nearest Neighbor Query Processing Cost in Multidimensional Data Space
The average number of block interchanges needed to sort a permutation and a recent result of Stanley
The Widest k -Dense Corridor Problems
Efficient Search for Rationals
Testing the irreducibility of nonsquare Perron-Frobenius systems
A Fast Backtrack Algorithm for Graph Isomorphism
Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements
Parallel distance transforms on a linear array architecture
A local decision test for sparse polynomials
Creation and Reflexive Rights in Grammatical Protection Systems
History Sensitive String for Multiple Alphabets
Differential attack on nine rounds of the SEED block cipher
Finding a dominating set on bipartite graphs
Are There Interactive Protocols for CO-NP Languages?
Finding paths of length k in O * (2 k ) time
Embedding a long fault-free cycle in a crossed cube with more faulty nodes
Parallel Evaluation of the Determinant and of the Inverse of a Matrix
Finding multiple induced disjoint paths in general graphs
Bounds on List Scheduling of UET Tasks with Restricted Resource Constraints
A 1.235 lower bound on the number of points needed to draw all n -vertex planar graphs
An exponential gap with the removal of one negation gate
Increasing Search Efficiency Using Multiple Heuristics
A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation
Single-machine scheduling with past-sequence-dependent delivery times and release times
A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries
The parameterized complexity of probability amplification
2D Hash Chain robust Random Key Distribution scheme
Fast algorithm for multicast and data gathering in wireless networks
Translation among CNFs, characteristic models and ordered binary decision diagrams
The learning effect: Getting to the core of the problem
A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound
Decycling with a matching
Responsive text summarization
Runtime feasibility check for non-preemptive real-time periodic tasks
Exact Computation of Steiner Minimal Trees in the Plane
Geometric Two-Server Algorithms
A Note on the Construction of Data Structure "DEAP"
Analysis of Queuing Networks in Which Processes Exhibit Locality-Transition Behaviour
An Improved Parallel Algorithm for Computing the Generalized Inverse A+
Abstract Derivation of Transitive Closure Algorithms
A Topological Approach to Dynamic Graph Connectivity
A Framework to Animate String Algorithms
Grundy coloring in some subclasses of bipartite graphs and their complements
Key regression from constrained pseudorandom functions
General Programs for Management Systems
An efficient location-based compromise-tolerant key management scheme for sensor networks
Online single-machine scheduling to minimize the linear combination of makespans of two agents
When Do Non-Conflict-Free Multivalued Dependency Dets Appear?
Multidimensional heaps and complementary range searching
Multiplicative vertex-colouring weightings of graphs
A note on optimal floodlight illumination of stages
A Short Proof of the Lexical Addressing Algorithm
A Time and Space Efficient Data Structure for String Searching on Large Texts
Data Sufficiency for Queries on Cache
Determination of the topology of a directed network
Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems
Finit Automata-Models for the Investigation of Dynamical Systems
Algorithmic aspect of stratified domination in graphs
An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
Modifying YCN key assignment scheme to resist the attack from Hwang
On Efficient Parallel Strong Orientation
Integral distinguishers for reduced-round Stribog
A novel disparity transformation algorithm for road segmentation