yusuke1997/dblp-id-title huggingface dataset:
Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques
Permutations Are Not Context-Free: An Application of the Interchange Lemma
An O(n) Time Algorithm for Maximum Matching on Cographs
Lower Bounds for Rectilinear Steiner Trees in Bounded Space
Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power
Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems
The Total Interval Number of a Tree and the Hamiltonian Completion Number of its Line Graph
Optimal Location of Facilities on a Network with an Unreliable Node or Link
Auxiliary Variables in Data Refinement
Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
Alternators in read/write atomicity
Improved batch exponentiation
On hypercube packings, blocking sets and a covering problem
Reducing Omega to Diamond W
A Note on Degree-Constrained Star Subgraphs of Bipartite Graphs
Towards Optimal Two-Dimensional Indexing for Constraint Databases
A Note on Optical Routing on Trees
Binary search with delayed and missing answers
Analysis of Fuzzy Operators for High Quality Information Retrieval
The 2-valued case of makespan minimization with assignment constraints
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
The restricted arc connectivity of Cartesian product digraphs
On Legal Path Problems in Digraphs
A note about weak epsilon-nets for axis-parallel boxes in d-space
Further Comments on Bykat's Convex Hull Algorithm
A simple proof that finding a maximal independent set in a graph is in NC
An Optimal Parallel Circle-Cover Algorithm
Arbitrary sequence RAMs
The provable constructive effect of diffusion switching mechanism in CLEFIA-type block ciphers
Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs
The labeled perfect matching in bipartite graphs
The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs
A note on a QPTAS for maximum weight triangulation of planar point sets
A Special Case of the n-Vertex Traveling-Salesman Problem that can be Solved in O(n) Time
The Intersection Searching Problem for c-Oriented Polygons
Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement
A Complete Axiomatization of Full Acyclic Join Dependencies
Generating binary trees by Glivenko classes on Tamari lattices
A Unified Approach to Domination Problems on Interval Graphs
Parallel Algorithm for Finding a Core of a Tree Network
A new key recovery attack on a code-based signature from the Lyubashevsky framework
A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems
Square-Free Words on Partially Commutative Free Monoids
An Approximation Algorithm for the TSP
An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads
Optimal bounded disorder
Polynomial Division with a Remainder by Means of Evaluation and Interpolation
Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement
Representing Matrices as Quadtrees for Parallel Processors
A Canonical Form Algorithm for Proving Equivalence of Conditional Forms
Voronoi Diagrams of Rigidly Moving Sets of Points
An extension of TYT inversion algorithm in polynomial basis
Mod (2p+1)-orientations in line graphs
Deterministic improved round-trip spanners
Implementing Functional Programs Using Mutable Abstract Data Types
An LC Branch-and-Branch Algorithm for the Module Assignment Problem
Online algorithms for the general k-search problem
Another proof of Wright's inequalities
Farmer's Theorem revisited
An Approximation Algorithm for the Maximum Traveling Salesman Problem
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
Padded Lists: Set Operations in Expected Theta(log log N) Time
On the security of public key cryptosystems with a double decryption mechanism
Abstract processes of place/transition systems
Explicit Solution of Block Tridiagonal Systems of Linear Equations
Faster parameterized algorithm for Bicluster Editing
Approximate Center Points in Dense Point Sets
Unification for Infinite Sets of Equations Between Finite Terms
On the Time Complexity of Minimum and Maximum Global Snapshot Problems
Benign Side Effects
Order-preserving pattern matching with scaling
A Structured Program to Generate all Topological Sorting Arrangements
Erratum: A Structured Program to Generate all Topological Sorting Arrangements
Another disjoint compression algorithm for odd cycle transversal
An Algorithm for Coalescing Operations with Precedence Constraints in Real-Time Systems
A note on the inapproximability of correlation clustering
A Linear Time Algorithm for Graph Partition Problems
Domains of partial attributed tree transducers
An Almost Optimal Algorithm for Unbounded Searching
On Pattern Occurrences in a Random Text
Coordinator: A Modification to the Monitor Concept
Eccentric counts, connectivity and chordality
Shelf Algorithms for On-Line Strip Packing
A Note on a Special One-Rule Semi-Thue System
Multisymbol Majority Vote and Hard Core
Sequence-to-Sequence Recursiveness
Some Properties of a Centroid of a Free Tree
Deterministic second-order patterns
Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
Computing all subtree repeats in ordered trees
A note on approximation measures for multi-valued dependencies in relational databases
Input-Driven Languages are in log n Depth
Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions
A Reevaluation of an Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
The Reflected Tree Hierarchy for Protection and Sharing
L (2, 1)-labeling of strong products of cycles
On a Question of Nearly Minimal Identification of Functions
Relaxing monotonicity for innermost termination
Computing a minimum outer-connected dominating set for the class of chordal graphs
Optimization of Argument Evaluation Order
Efficient computation of approximate isomorphisms between Boolean functions
Small cycles, generalized prisms and Hamiltonian cycles in the Bubble-sort graph
On the complexity of partial order trace model checking
The longest common subsequence problem for small alphabets in the word RAM model
A Series Expansion Involving the Harmonic Numbers
On Probability of Forest of Quadtrees Reducing to Quadtrees
Broadcast Scheduling in Packet Radio Networks by Hopfield Neural networks
Improved approximation algorithms for the robust fault-tolerant facility location problem
On the additive chromatic number of several families of graphs
A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms
Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete
#P-completeness of counting roots of a sparse polynomial
Erratum: Exact VC-Dimension of Boolean Monomials
A topological characterization of random sequences
Comments on a Lower Bound for Convex Hull Determination
A Priority Queue for the All Pairs Shortest Path Problem
Efficient Selection on a Binary Tree
Counting k-Subsets and Convex k-gons in the Plane
An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples
Contiguous Segmentation with Limited Compacting
Fast Algorithms for Approximately Counting Mismatches
The complexity of computing the period and the exponent of a digraph
Distributed Consensus Revisited
On simultaneous straight-line grid embedding of a planar graph and its dual
Realization of Graceful Permutation by a Shuffle-Exchange Network
Strong normalization proofs by CPS-translations
IV-matching is strongly NP-hard
An Algorithm for Horizontal Decompositions
Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph
Structural properties of oracle classes
Using Total Monotonicity for Two Optimization Problems on the Plane
An improved algorithm for approximating the chromatic number of G n, p
Speeding Lamport's Fast Mutual Exclusion Algorithm
Cryptographic key assignment schemes for any access control policy
The game chromatic number and the game colouring number of cactuses
New Bounds for the Clique Number of a Graph
On generating k-ary trees in computer representation
Complexity classes and fragments of C
A counterexample to a conjecture concerning concatenation hierarchies
Extending the geometric build-up algorithm for the molecular distance geometry problem
Optimal Choice of Discriminators in a Balanced k-d Binary Search Tree
On Verification of Programs With Goto Statements
A Note on Enumarative Counting
Amortized rotation cost in AVL trees
Toward a Definition of Fault Analysis for Petri Nets Models
List update with probabilistic locality of reference
Balancedness of MSO transductions in polynomial time
Weighted automata with discounting
EvenPath in directed single-crossing graphs
On Solving Hard Problems by Polynomial-Size Circuits
A note on cycle embedding in hypercubes with faulty vertices
Manipulation of Data Structures Without Pointers
The Identification of Parallel Micro-Operations
Optimal Routing in Toroidal Networks
PSPACE-completeness of an escape problem
Annotation inference for modular checkers
On the average cost of order-preserving encryption based on hypergeometric distribution
Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques
On the hardness of deciding the equality of the induced and the uniquely restricted matching number
Comments on: Sorting by Distributive Partitioning
Indexed Extendible Hashing
A Tight Amortized Bound for Path Reversal
Bounding restricted rotation distance
Tighter constant-factor time hierarchies
An Improved Upper Bound on the Number of Intersections Between Two Rectangular Paths
Fooling sets and the Spanning Tree polytope
Acknowledged broadcasting in ad hoc radio networks
Hamilton-connectivity and cycle-embedding of the Möbius cubes
On the Complexity of Some Extended Word Problems Defined by Cancellation Rules
Binary equality implication constraints, normal forms and data redundancy
A vector space approach to tag cloud similarity ranking
On the Decomposition of Sequences into Ascending Subsequences
Precise Typing and Filters
QT Logic: Simpler and More Expressive Than Predicate Calculus
On an Algorithm of Zemlyachenko for Subtree Isomorphism
Response time behavior of distributed voting algorithms for managing replicated data
Linear Lower Bounds on Unbounded Fan-In Boolean Circuits
On Non-Smooth Convex Distance Functions
Deterministic SkipNet
Attack on an ID-based authenticated group key agreement scheme from PKC 2004
On the Vector Representation of the Reachability in Planar Directed Graphs
On the CLUMPS Model of Parallel Computation
Evolutionary induced decision trees for dangerous software modules prediction
A Better Lower Bound for On-Line Scheduling
Concerning the Size of Logical Clocks in Distributed Systems
Labeling points with given rectangles
Oracle separations between quantum and non-interactive zero-knowledge classes
Closures of may-, should- and must-convergences for contextual equivalence
Pseudo-Average Block Sensitivity Equals Average Sensitivity
On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph
Instability results for Euclidean distance, nearest neighbor search on high dimensional Gaussian data
On the Internal S-Stability of Rosenbrock Methods
A Hashing Method for Fast Set Operations
Recognition of Perfect Elimination Bipartite Graphs
Model checking probabilistic systems against pushdown specifications
Eliminating Disjunctions of Leads-to Properties
An efficient external sorting algorithm
Centering a Spanning Tree of a Biconnected Graph
On the structure of certain intersection graphs
Analysis of 3-line generalized Feistel networks with double SD-functions
Improved kernels for tracking paths
Randomized Optimal Algorithm for Slope Selection
Alternative Developments of Cyclic-Permutation Algorithms
A linear-time algorithm for the center problem in weighted cycle graphs
On Undecidability of Propositional Temporal Logics on Trace Systems
A moment-based nonlocal-means algorithm for image denoising
Cryptanalysis of an optimized protocol for mobile network authentication and security
A Hierarchy of Tractable Satisfiability Problems
A secure time-bound hierarchical key assignment scheme based on RSA public key cryptosystem
A Versatile Divide and Conquer Technique for Optimal String Alignment
Models of Programs and Processes
Resource-bounded strong dimension versus resource-bounded category
A simple proof of the uniform consensus synchronous lower bound
A Unified Linear-Time Algorithm for Computing Distance Maps
Tuning Architecture via Microprogramming
Enhanced utilization bound of Rate-Monotonic scheduling in Controller Area Networks
Optimal strategy of coupon subset collection when each package contains half of the coupons
Resolving error propagation in distributed systems
An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points
Note on Node-Rewriting Graph Grammars
Optimal Superprimitivity Testing for Strings
A Distributet Self-Stabilizing Solution to the Dining Philosophers Problem
An FPTAS for the parametric knapsack problem
Computing Sums of Order-k Fibonacci Numbers in Log Time
The (nested) word problem
Top-down complementation of automata on finite trees
On the Length of Word Chains
Visual cryptography for grey level images
Simple DFS on the complement of a graph and on partially complemented digraphs
On the coordinator's rule for Fast Paxos
Untiming Timed Languages
An Optimal Algorithm for Finding Compact Sets
Directed hypergraphs and Horn minimization
Parameterized algorithms for load coloring problem
Computing Roman domatic number of graphs
Edge-fault-tolerant edge-bipancyclicity of hypercubes
How to Produce All Sentences From a Two-Level Grammar
Classification between natural and graphics images based on generalized Gaussian distributions
Using Random Context Structure Grammars to Represent Chemical Structures
Variants of k-regular nearest neighbor graph and their construction
Eavesdropping in semiquantum key distribution protocol
Partial Occam's Razor and its Applications
On a new formal proof model for RFID location privacy
The game total domination problem is log-complete in PSPACE
On the distinctness of modular reductions of primitive sequences modulo square-free odd integers
An Efficient Probabilistic Encryption Scheme
Available stabilizing heaps
Weighted sampling without replacement from data streams
Path-based depth-first search for strong and biconnected components
Constructor Equivalent Term Rewriting Systems
A Method for Proving Programming Languages non Context-Free
On the system of two all_different predicates
Hyperspherical Neighbourhoods and Pattern Recognition Using Neural Networks
Corrigendum to "An algorithm for computing the restriction Scaffold assignment problem in computational biology" [Inform Process Lett 95 (4) (2005) 466-471]
A Parallel Reference Counting Algorithm
Fast intra prediction method by adaptive number of candidate modes for RDO in HEVC
Impossible differential attack on 13-round Camellia-192
Complexity of k -tuple total and total { k }-dominations for some subclasses of bipartite graphs
A Representation of Disjoint Sets with Fast Initialization
Optimal online algorithm for scheduling on two identical machines with machine availability constraints
The Parallel Computation of Minimum Cost Paths in Graphs by Stream Contraction
Characterizations of Some Rescaling Functions
Multi-subsequence searching
On the language equivalence of NE star-patterns
Edge-pancyclicity of recursive circulants
An Undecidable Fragment of the Theory of Set Constraints
The complexity of the Kth largest subset problem and related problems
Approximate Map Labeling is in Omega (n log n)
Resolving all Deadlocks in Distributed Systems
Cryptanalysis of an authentication scheme using truncated polynomials
Optimal preemptive semi-online scheduling on two uniform processors
Optimal 2-constraint satisfaction via sum-product algorithms
Computing the Longest Diagonal of a Simple Polygon
Kleene's Logic with Equality
Epsilon-transitions in Concurrent Timed Automata
Some Observations on Random 2-3 Trees
Optimal Total Exchange for a 3-D Torus of Processors
Optimal strong primes
Dominance constraints in stratified context unification
The Shortest Watchtower and Related Problems for Polyhedral Terrains
Issuer-free oblivious transfer with access control revisited
A global parallel algorithm for the hypergraph transversal problem
Doubly Lexical Ordering of Dense 0 - 1 Matrices
WORM-2DPDAs: An Extension to 2DPDAs that can be Simulated in Linear Time
Counting Convex k-Gons in Planar Point Sets
Buffer overflow management with class segregation
On Different Approximation Criteria for Subset Product Problems
Soft Precedence
Minimum-perimeter enclosures
Distributed Termination Detection with Counters
Round-Optimal Perfect Zero-Knowledge Proofs
Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata
An information theoretic proof of the Chernoff-Hoeffding inequality
Bifaithful Starry Transductions
The L 1 Travelling Salesman Problem
Tight binding number bound for P ≥3 -factor uniform graphs
Conditional connectivity of Cayley graphs generated by transposition trees
An Incremental LL(1) Parsing Algorithm
A Linear Algorithm for Bipartition of Biconnected Graphs
The secure domination problem in cographs
Approximating k-hop minimum spanning trees in Euclidean metrics
Hierarchical Broadcast Networks
A Combinatorial Property of the Fibonacci Words
Functional Dependencies in Relations with Null Values
An Approximate Model of Processor Communication Rings Under Heavy Load
Representations of stably continuous semi-lattices by information systems and abstract bases
Semantics in Problem Representation and Search
Pancyclicity of ternary n-cube networks under the conditional fault model
Polynomial kernels for tracking shortest paths
The cones and foci proof technique for timed transition systems
Consensus Under Unreliable Transmission
Efficient approximation algorithms for shortest cycles in undirected graphs
Generating Polynomial Orderings
A Non-Hamiltonian, Nondegenerate Delaunay Triangulation
Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces
Hamilton cycles in implicit claw-heavy graphs
Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
On Saving Space in Parallel Computation (Note)
Efficient Stream Distribution Algorithm for Heterogeneous Multimedia Multicast with Link Capacity Constraint
The oriented chromatic number of Halin graphs
Perfect Staircase Profile of Linear Complexity for Finite Sequences
A Straightforward Iterative Algorithm for the Planar Voronoi Diagram
A pseudorandom bit generator based on new multi-delayed Chebyshev map
Computing hypergraph width measures exactly
Rectilinear Decompositions with Low Stabbing Number
A generalized grid quorum strategy for k-mutual exclusion in distributed systems
Horizontally and Vertically Bounded Propagation of Privileges
On computing minimum ( s, t )-cuts in digraphs
A Model of Concurrency Control in Distributed Database Systems
The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria
On identifying codes in the hexagonal mesh
Weak coin flipping with small bias
A New one Pass Algorithm for Estimating Stochastic Context-Free Grammars
On the Clark-Jacob Version of SPLICE/AS
Parallel p-adic Computation
Combined supervised information with PCA via discriminative component selection
Squeeziness: An information theoretic measure for avoiding fault masking
A simple proof of QBF hardness
On Handling Vertex Deletion in Updating Spanning Trees
Errata: The Equivalence Problem for Deterministic T0L-Systems is Undecidable
A Note on the all Nearest-Neighbor Problem for Convex Polygons
A note about some properties of BC graphs
A Recursive Ascent Earley Parser
Absence of Individual Starvation Using Weak Semaphores
Polynomial algorithms for protein similarity search for restricted mRNA structures
Optimal Vertex Ordering of Graphs
A new approach for approximating node deletion problems
A Decidability Theorem for a Class of Vector-Addition Systems
A Type Soundness Proof for Variables in LCF ML
On semantic cutting planes with very small coefficients
Minimum Vertex Distance Between Separable Convex Polygons
Constructing the Galois Adjoint
On the Rotation Distance of Binary Trees
Generalized MitM attacks on full TWINE
An improved algorithm for the red-blue hitting set problem with the consecutive ones property
A Fuzzy Petri Net for Knowledge Representation and Reasoning
Almost k-wise independence versus k-wise independence
Lower and upper bounds on graph communicabilities
Increasing the Rate of Output of m-Sequences
On what exactly goes on when software is developed step-by-step, II: The sequel
On Minimizing the Sum of k Tardinesses
Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs
An efficient algorithm for the Fourier transform on a compressed image in restricted quadtree and shading format
An Efficient Finite-State Machine Implementation of Huffman Decoders
Approximation algorithms for the Fault-Tolerant Facility Placement problem
On the expressive power of semijoin queries
A linear time 5/3-approximation for the minimum strongly-connected spanning subgraph problem
The Depth of Monotone Functions in Multivalued Logic
A note on the k-Canadian Traveller Problem
An improved algorithm for sorting by block-interchanges based on permutation groups
Covering graphs with convex sets and partitioning graphs into convex sets
Optimal Three-Dimensional Layouts of Complete Binary Trees
Approximating the Minimum Maximal Independence Number
Counter Machines
Nonserial Dynamic Programming Formulations of Satisfiability
Second order collision for the 42-step reduced DHA-256 hash function
On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
Greedily computing associative aggregations on sliding windows
The Bit Complexity of the Predecessor Problem
An O(|V|2) algorithm for single connectedness
Online scheduling on unbounded parallel-batch machines to minimize the makespan
Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms
New lower bound on the Shannon capacity of C 7 from circular graphs
Twenty Questions to a P-Selector
Weighted Coloring: further complexity and approximability results
A note on "An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs"
Generalized Huffman coding for binary trees with choosable edge lengths
A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph
Improved analysis of D 2 -sampling based PTAS for k-means and other clustering problems
On graphs with the third largest number of maximal independent sets
Halfspace Learning, Linear Programming, and Nonmalicious Distributions
A Note on Leftmost Restricted Random Context Grammars
Some Variants of the Take-Grant Protection Model
A Note on Linear Time Simulation of Deterministic Two-Way Pushdown Automata
Efficient Parallel Algorithms for Linear Recurrence Computation
Recursive hiding of biometrics-based secret sharing scheme using adversary structure
A Communication-Privacy Tradeoff for Modular Addition
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
Dynamic Behaviour in Updating Process Over BST of Size Two with Probabilistic Deletion Algorithms
Remarks on Sorting and One-Way Multihead Finite Automata
A Parallel Algorithm for the Minimum Weighted Vertex Cover Problem
The Decision Problem for Database Dependencies
The communication complexity of the Hamming distance problem
Note on maximal bisection above tight lower bound
Lie group impression for deep learning
NP-Completeness of Some Generalizations of the Maximum Matching Problem