yusuke1997/dblp-id-title huggingface dataset:
L-Attributed LL(1)-Grammars are LR-Attributed
On 2-QBF Truth Testing in Parallel
A New Approach to Optimal Cache Scheduling
A note on cyclic-cubes
Generating connected acyclic digraphs uniformly at random
Edge-fault tolerance of hypercube-like networks
The computation of hitting sets: Review and new algorithms
Finding the Minimum Distance Between Two Convex Polygons
A Probabilistic Remark on Algebraic Program Testing
Safety Without Stuttering
Identity Assignment in Uniform Synchronous Rings
Fast Data Transmission and Maximal Dynamic Flow
A note on monotone complexity and the rank of matrices
On-Line Versus Off-Line Computation in Dynamic Text Compression
Searching with a Forbidden Lie Pattern in Responses
A new external sorting algorithm with no additional disk space
Reducing non-determinism of k-NN searching in non-ordered discrete data spaces
On-line scheduling with setup costs
Embedding Cycles in IEH Graphs
k-Fold Bitonic Sort on a Mesh-Connected Parallel Computer
An Efficient Transitive Closure Algorithm for Cyclic Digraphs
Bidirectional Coroutines
Width-restricted layering of acyclic digraphs with consideration of dummy nodes
Note on the connectivity of line graphs
The hardness of the Expected Decision Depth problem
A lower bound for testing juntas
Raiders of the lost equivalence: Probabilistic branching bisimilarity
Constrained Visibility Representations of Graphs
Multi-machine scheduling with general position-based deterioration to minimize total load revisited
On the complexity of market equilibria with maximum social welfare
The Performance of Interactive Information Retrieval
Optimal many-to-one routing on the mesh with constant queues
Proof system representations of degrees of disjoint NP-pairs
New common ancestor problems in trees and directed acyclic graphs
A Fast and Efficient NC Algorithm for Maximal Matching
A linear time algorithm for optimal k-hop dominating set of a tree
Performance Analysis of a Main Memory Multi-Directory Hashing Technique
A Remark on NP-Completeness of Picture Matching
An Algorithm for Modular Exponentiation
Eliminability of cut in hypersequent calculi for some modal logics of linear frames
A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image
Safety and Liveness of omega-Context-Free Languages
Realization of Petri Nets Without Conditional Statements
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Exact PPS sampling with bounded sample size
A simple approximation algorithm for the weighted matching problem
Five-step FFT algorithm with reduced computational complexity
Further results on the second relative greedy weight of 3-dimensional codes
Power and performance control of soft real-time web server clusters
Consistent Global Checkpoints Based on Direct Dependency Tracking
A Direct Routing Algorithm for the Bit-Reversal Permutation on a Shuffle-Exchange Network
An Assertional Proof of Rana's Algorithm
The Program Dependence Graph in Static Program Testing
CMAC, CCM and GCM/GMAC: Advanced modes of operation of symmetric block ciphers in wireless sensor networks
Synchronous Communication Between Asynchronous Components
A Special Purpose MIMD Parallel Processor
Optimal extraction of motif patterns in 2D
A technique for the concept-based detection of functional modules in an interaction network
On Starvation and Some Related Issues
An efficient and flexible algorithm for online mining of large itemsets
A note on the concrete hardness of the shortest independent vector in lattices
Analysis of Random Probing Hashing
Maximum Network Flow with Floating Point Arithmetic
On f -colorings of nearly bipartite graphs
Well-balanced orientations of mixed graphs
On the Difficulty of Manhattan Channel Routing
Non-cooperative capacitated facility location games
The 4-Star Graph is not a Subgraph of Any Hypercube
Self-stabilizing algorithm for two disjoint minimal dominating sets
A Note on Mod and Generalised Mod Classes
Point Location in Fat Subdivisions
A Note on the VLSI Counter
Efficient processing of subsequence matching with the Euclidean metric in time-series databases
Numerical Differentiation of Experimental Data
Multiserialization of Iterated Transactions
The frequent paucity of trivial strings
Parameterized Eulerian strong component arc deletion problem on tournaments
Some Nested Dissection Order is Nearly Optimal
An enumeration algorithm for all integers nonrepresentable by some positive integers
On the complexity of finding balanced oneway cuts
A Note on Equations for Commutative Regular Languages
Quadratic Programming is in NP
A simple algorithm for edge-coloring bipartite multigraphs
Parallel GF (3 m ) multiplier for trinomials
A Deep Convolutional Neural Network based Chinese Menu Recognition App
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
Clean the graph before you draw it!
Cause-Effect Structures
The All Nearest-Neighbor Problem for Convex Polygons
A Fast Voronoi-Diagram Algorithm With Quaternary Tree Bucketing
On multiset of factors of a word
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
A note on graph proper total colorings with many distinguishing constraints
Compositional and local livelock analysis for CSP
APX-hardness of maximizing Nash social welfare with indivisible items
Loop Unravelling: A Practical Tool in Proving Program Correctness
On the algorithmic complexity of the Mastermind game with black-peg results
A note on hardness of computing recursive teaching dimension
Computing small partial coverings
Lower Bounds for Robust Secret Sharing Schemes
The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space
Theil's Estimator
Fault diameter of product graphs
Protection in a single-address-space environment
Identity based blind signature scheme over NTRU lattices
A note on Unique Games
Optimal approximations made easy
Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs
An algorithm for partitioning trees augmented with sibling edges
An optimal algorithm to implement the Hanoi towers with parallel moves
Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree
Complexities of some interesting problems on spanning trees
On the average sensitivity of the weighted sum function
Absolute o(log m) error in approximating random set covering: an average case analysis
The rotation graph of k
Improved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids
A lower bound on the size of ε-free NFA corresponding to a regular expression
ECFSM-Based Probabilistic Protocol Verification
A Note on the Notation of Recursion in Process Algebras
Cryptanalysis of the Wu-Varadhrajan fair exchange protocol
A Note on the Size of a Multicast Tree in Hypercubes
The connectivity of exchanged crossed cube
Two-dimensional homing sort
Tight inapproximability of Nash equilibria in public goods games
Packing Items from a Triangular Distribution
A Note on Finding Convex Hulls Via Maximal Vectors
Revisiting the Counter Algorithms for List Update
Off-Line Algorithms for the List Update Problem
Remarks on String-Matching and One-Way Multihead Automata
On the Properties of Combination Set Operations
Cancellation is Exponentially Powerful for Computing the Determinant
Randomized algorithms for online bounded bidding
Approximation algorithms for a hierarchically structured bin packing problem
Counting Productions in Context-Free Derivations
New Lower Bounds for Element Distinctness on a On-Tape Turing Machine
Treatment of the initial value in Time-Memory-Data Tradeoff attacks on stream ciphers
A nearly tight lower bound for the d -dimensional cow-path problem
An Elementary Proof of Double Greibach Normal Form
Realizability of Delaunay Triangulations
Complexity of semi-stable and stage semantics in argumentation frameworks
Long paths in heterogeneous random subgraphs of graphs with large minimum degree
An Improved BL Lower Bound
Representation and Equality of Modes
Finding Extremal Sets in Less than Quadratic Time
Gossiping by processors prone to omission failures
Computing the Full Visibility Graph of a Set of Line Segments
A 3-Valued Wakeup Protocol
On the Complexity of Testing a Graph for N-Cube
Planar tree transformation: Results and counterexample
Hash challenges: Stretching the limits of compare-by-hash in distributed data deduplication
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
Transposition of an 1*1 Matrix Requires O(log 1) Reversals on Conservative Turing Machines
On T0L Languages over Terminals
A characterization of 3- γ -critical graphs which are not bicritical
Bounds and trade-offs for Double-Base Number Systems
On numerically decipherable codes and their homophonic partitions
Unity Properties and Sequences of States, Some Observations
A note on practical construction of maximum bandwidth paths
A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri Nets Using Linear Programming
3D depth information extraction with omni-directional camera
A Note on Lexicographic Breadt First Search for Chordal Graphs
A note on compressed sensing and the complexity of matrix multiplication
A Simple Linear-Time Algorithm for Computing the RNG and MST of Unimodal Polygons
Insecurity of Set Controls for Statistical Databases
Erratum: Recursiveness of Monotonic Array Grammars and a Hierarchy of Array Languages
Shortest-Path Problem is not Harder Than Matrix Multiplication
Certificateless signature scheme with security enhanced in the standard model
An O(1.84 k ) parameterized algorithm for the multiterminal cut problem
Decidability of well-connectedness for distributed synthesis
Connectivity and Edge-Disjoint Spanning Trees
Asymmetric k-center with minimum coverage
Efficient Token-Based Control in Rings
An improved lower bound on query complexity for quantum PAC learning
Hypothetical Reasoning in Logic Programming: A Semantic Approach
Minimum-link watchman tours
When is a Pair of Matrices Mortal?
Verifying minimum stable circuit values
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges
A Family of Rules for Recursion Removal
An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane
The diameter of Hanoi graphs
Maintaining Transitive Closure in First Order After Node-Set and Edge-Set Deletions
On the differential and linear efficiency of balanced Feistel networks
On Generating All Maximal Independent Sets
Upper bound for the number of closed and privileged words
Triangulating a Simple Polygon
An approximation algorithm for the cutting-sticks problem
Revisiting lower dimension lattice attacks on NTRU
A bandwidth latency tradeoff for broadcast and reduction
Deep learning algorithm with visual impression
Edge-chromatic sum of trees and bounded cyclicity graphs
A Note on P-Selective Sets and Closeness
Priority functions for the approximation of the metric TSP
Pancyclicity of recursive circulant graphs
On the Minimum Label Spanning Tree Problem
Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
Optimal Parallel Randomized Renaming
Rectilinear Short Path Queries Among Rectangular Obstacles
Uniform Inevitability is Tree Automaton Ineffable
Semi-online hierarchical scheduling problems with buffer or rearrangements
A Memory-Efficient and Fast Huffman Decoding Algorithm
Exponential lower bound for bounded depth circuits with few threshold gates
A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem
Some algorithmic results for [2]-sumset covers
Symbolic Verification Method for Definite Iteration over Data Structures
A Closure Property of Deterministic Context-Free Languages
Another Representation of Binary Tree Traversal
Complexity of universal access structures
Constructing Optimal Binary Decision Trees is NP-Complete
An ergodic theorem for read-once non-uniform deterministic finite automata
Infinity problems and countability problems for omega-automata
Computing Fibonacci Numbers (and Similarly Defined Functions) in Log Time
An Analytical Evidence for Kalé's Heuristic for the N Queens Problem
On the Synthesis of Fast Algorithms for Signal Processing
Security vulnerability in a non-interactive ID-based proxy re-encryption scheme
Another Application of Recursion Introduction
Recognizing and realizing cactus metrics
Ranking numbers of graphs
Mapping among the nodes of infinite trees: A variation of Kőnig's infinity lemma
A Distributed Index Sequential Access Method
Routing and path multicoloring
A variant of the Ford-Johnson algorithm that is more space efficient
Asymptotic Estimates for the Higher Moments of the Expected Behavior of Straight Insertion Sort
Generating Pseudo-Random Permutations and Maximum Flow Algorithms
Decomposing a Set of Points into Chains, with Applications to Permutation and Circle Graphs
Comments on: T. D. Bui "On an L-Stable Method for Stiff Differential Equations"
An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces
There is no Fast Single Hashing Algorithm
The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs
Two Dimensional Pattern Matching
A Note on Delaunay and Optimal Triangulations
On triangulation axes of polygons
On the size of the subset partial order
An Efficient Algorithm for the All Pairs Suffix-Prefix Problem
An Algorithm for Uniform Random Sampling of Points In and On a Hypersphere
Order Statistics on a Hypercube
A Note on Boolean Matrix Multiplication
An Improved Lower Bound for On-Line Bin Packing Algorithms
Programmed Simulation of Race Hazards in Sequential Circuits
A Note on the Kolmogorov Data Complexity and Nonuniform Logical Definitions
An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional Arrays
Purging in an Equality Data Base
A new binary code of length 16 and minimum distance 3
Slicing for modern program structures: a theory for eliminating irrelevant loops
Faster index for property matching
A Loopless Algorithm for Generating Binary Tree Sequences
Exhaustive approaches to 2D rectangular perfect packings
Lower Time Bounds for Integer Programming with Two Variables
Word automatic groups of nilpotency class 2
The Element Distinctness Problem on One-Tape Turing Machines
A new class of generalized almost perfect nonlinear monomial functions
Achievable High Scores of epsilon-Moves and Running Times in DPDA Computations
Robust edge detector based on anisotropic diffusion-driven process
On the Complexity of Test Case Generation for NP-Hard Problems
On Rotations in Fringe-Balanced Binary Trees
The Communication Complexity for Decentralized Evaluation of Functions
Optimum Extensions of Prefix Codes
Average Case Complexity Under the Universal Distribution Equals Worst-Case Complexity
Proportionate flowshops with general position-dependent processing times
Fast modular reduction and squaring in GF (2 m )
Approximate spanning cactus
Space as Time
Direction-reversing quasi-random rumor spreading with restarts
Abstract Computation Model Used for a Production Compiler
Simple Proof Techniques for Property Preservation via Simulation
Pancyclicity of OTIS (swapped) networks based on properties of the factor graph
Kleene's Three-Valued Logic and Process Algebra
Real-Time Leader Election
Red Blue Set Cover problem on axis-parallel hyperplanes and other objects
A Model of Reconfiguration in Communicating Sequential Processes with a Notion of Transactions
Extending Reduction Orderings to ACU-Compatible Reduction Orderings
Bipartite structure of all complex networks
Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
The effects of the omission of last round's MixColumns on AES
Recursive sum-product algorithm for generalized outer-planar graphs
An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane
A String-Matching Algorithm for the CREW PRAM
Deterministic small-world communication networks
A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality
On the Relationship Between Deterministic Time and Deterministic Reversal
Partitioning of trees for minimizing height and cardinality
Planar packing of trees and spider trees
Amplification of slight probabilistic advantage at absolutely no cost in space
A Linear Storage Space Algorithm for a Reference Structure Index
SLR(k) Covering for LR(k) Grammars
An O( n 3 ) Time Algorithm for Recognizing Threshold Dimension 2 Graphs
Erratum to "Pancyclicity of recursive circulant graphs": [Information Processing Letters 81 (2002) 187-190]
An O(log(n)/log(log(n))) upper bound on the price of stability for undirected Shapley network design games
Reply to the Comments by Martín Abadi et al
Dynamics of a mean-shift-like algorithm and its applications on clustering
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
Additive Weights of a Special Class of Nonuniformly Distributed Backtrack Trees
Sort and Search: Exact algorithms for generalized domination
Wireless network design via 3-decompositions
Analyzing Self-Adjusting Linear List Algorithms with Deletions and Unsuccessful Searches
Sequence retrieval from genomic databases
A Permanent Formula with Many Zero-Valued Terms
A Linear Algorithm of a Deadlock Avoidance for Nonpreemptible Resources
Secure multiplication of shared secrets in the exponent
Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations
A Simple Realization of LR-Parsers for Regular Right Part Grammars
Relativized Worlds with an Infinite Hierarchy
A new definition of the contrast of visual cryptography scheme
Comparison of various trees for nearest-point search with/without the Voronoi diagram
Parallel Algorithm for Generating Permutations on Linear Array
A note on the Cornaz-Jost transformation to solve the graph coloring problem
Veto is Impossible in Secret Sharing Schemes
Pancyclicity in switching classes
4/3 rectangle tiling lower bound
Post Correspondence Problem for short words
A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
The Membership Question for ET0L-Languages is Polynomially Complete
Comment on Kochol's Paper "Efficient Monotone Circuits for Threshold Functions"
A new fair scheduling algorithm for periodic tasks on multiprocessors
A note on hardness of diameter approximation
Description and analysis of a bottom-up DFA minimization algorithm
Some Properties of Deadlock Detection and Recovery in Readers and Writers Problems
Finding a Homomorphism Between Two Words is NP-Complete
Skolem and positivity completeness of ergodic Markov chains
The Schorr-Waite Marking Algorithm Revisited
Longest common substrings with k mismatches
On Multiset Orderings
Building Cartesian trees from free trees with k leaves
An Optimal Parallel Algorithm for Linear Programming in the Plane
Upper bounds for multi-level multi-server paging
On pancyclicity properties of OTIS-mesh
Single Character Searching Methods and the shift-or Pattern-Matching Algorithm
Deciding H 1 by resolution
Independent domination versus weighted independent domination
Feedback vertex set in hypercubes
Sorting Tree, Nestling Tree and Inverse Permutation
On the complexity of finding a Caristi's fixed point
On an Approach to Integrating Boundary Problems With a Non-Unique Solution
Kinetic heap-ordered trees: Tight analysis and improved algorithms
Using Overloading to Express Distinctions Between Evaluators
On structural properties of eta-expansions of identity
Routing in Times Square Mode
Fast String Searching by Finding Subkeys in Subtext
Representation of Binary Trees on Associative Memories
On minimal connectivity requirements for secure message transmission in directed networks
A Note on the Representation of Finite Tree Automata
On domination number of Cartesian product of directed cycles
An Algorithm for Local Compaction of Horizontal Microprograms
A note on RNS architectures for the implementation of the diagonal function
Verification and generation of unrefinable partitions
Online graph exploration on trees, unicyclic graphs and cactus graphs
Approximation algorithm for coloring of dotted interval graphs
An Efficient Algorithm for Some Tree Matching Problems
A 2-approximation algorithm for the zookeeper's problem
Counting inversions adaptively
Concurrency Control on Extendible Hashing
A Note on the Semantic Definition of Side Effects
On-Line Computation of Transitive Closures of Graphs
Impossible differential cryptanalysis of 7-round Advanced Encryption Standard (AES)
On Computing the Closest Boundary Point on the Convex Hull
A new approximation algorithm for labeling points with circle pairs
Solving the Shortest-Paths Problem on Bipartite Permutation Graphs Efficiently
On the Arrangement Graph
Generalized honeycomb torus
Relative Complexity of Checking and Evaluating
Finitary Logics for Some CCS Observational Bisimulations
Finding OR in a noisy broadcast network
Undecidability of Ground Reducibility for Word Rewriting Systems with Variables
The Formal Termination Problem for Programs with Finite ALGOL 68-Modes
Efficient algorithms for local ranking
Linear structures of symmetric functions over finite fields
A New 3D Representation of Trivalent Cayley Networks
Efficient Expansion of Factored Expressions
Predicate Transfer and Timeout in Message Passing Systems
Generalized Dominators
The quantum query complexity of the determinant
A 2.5-Factor Approximation Algorithm for the k -MST Problem
Characterizing the Regular Prefix Codes and Right Power-Bounded Languages
Characterizing the Shortest Path of an Object Among Obstacles
Differential approximation results for the traveling salesman and related problems
A Good Algorithm for Edge-Disjoint Branching
Finding a maximum-density path in a tree under the weight and length constraints
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Lower bounds for randomized algorithms for online chain partitioning
Solving the Single Step Graph Searching Problem by Solving the Maximum Two-Independent Set Problem
A 2-approximation NC algorithm for connected vertex cover and tree cover
On the complexity and approximability of budget-constrained minimum cost flows
Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic Space
Recovering highly-complex linear recurrences of integer sequences
A characterization of trees with equal independent domination and secure domination numbers
Fast and Compact Dispatching for Dynamic Object-Oriented Languages
Verifiable (t, n) threshold quantum secret sharing using d-dimensional Bell state
New Binary Sequences with Perfect Staircase Profile of Linear Complexity
On the Security of SPLICE/AS - The Authentication System in WIDE Internet
Matrix reduction in a combinatorial computation
Large Processors are Good in VLSI Chips
A note on a question of Peled and Wilke regarding stutter-invariant LTL
Structured Operating System Organization
A residualizing semantics for the partial evaluation of functional logic programs
Finding frequent items over sliding windows with constant update time
An exact exponential time algorithm for counting bipartite cliques
On the Complexity of Building an Interval Heap
Digital and Hilbert k-d Trees
An Upper Bound on the Number of Execution Nodes for a Distributed Join
On the complexity of digraph packings
Worst-Case Analysis of a Generalized Heapsort Algorithm
Dynamic Maintenance of Majority Information in Constant Time per Update
The super connectivity of shuffle-cubes
An efficient nearest neighbor search in high-dimensional data spaces
A note on balanced flows in equality networks
On the Divergence and the Joshi Dependence Measure in Feature Selection
Managing module dependencies to facilitate continuous testing
An Approach to the Problems of Routing Optimization in the Regions of Intricate Shape
Exact solution of a minimal recurrence
Turing degrees of reals of positive effective packing dimension
A two stage scheduling with transportation and batching
An efficient cache conscious multi-dimensional index structure