yusuke1997/dblp-id-title huggingface dataset:
On the Implementation of Constants
A Three-Restricted Normal Form Theorem for ET0L Languages
Pushdown reachability with constant treewidth
Axiomatic Proofs of Fotal Correctness of Programs
Fault-containing self-stabilization using priority scheduling
A Note on Error-Correcting Codes for Authentication and Subliminal Channels
A Linear Time Algorithm for the Bottleneck Traveling Salesman Problem on a Halin Graph
Census Techniques Collapse Space Classes
Palindromic trees for a sliding window and its applications
A Linear Algorithm for the Cutting Center of a Tree
Efficient Determination of the Transitive Closure of a Directed Graph
Comments on: G. Manacher, An Application of Pattern Matching to a Problem in Geometrical Complexity
Salembier's Min-tree algorithm turned into breadth first search
A note on a Maximum k-Subset Intersection problem
Randomized load balancing by joining and splitting bins
Efficient ID-Based Key Distribution with Tamperfree Devices
Finitely Representable Nested Relations
The Numerical Instability of Bini's Algorithm
Fixed-Radius Near Neighbors Search
Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
Interpreting Logics of Knowledge in Propositional Dynamic Logic with Converse
Seek Distances in Disks with Two Independent Heads Per Surface
A Self-Stabilizing Algorithm for Maximal Matching
Recognizing i-triangulated graphs in O(mn) time
Identity-based proxy re-signatures from lattices
Fast Nondeterministic Recognition of Context-Free Languages Using two Queues
Real estate of names
On the Problem of Approximating the Number of Bases of a Matroid
On the partition dimension of a class of circulant graphs
Source-wise round-trip spanners
Parallelizing Mallat Algorithm for 2-D Wavelet Transforms
Vector Domination in split-indifference graphs
2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines
Randomly coloring simple hypergraphs
Series-parallel orientations preserving the cycle-radius
A Short Proof of the Dilation of a Toroidal Mesh in a Path
The Complexity of a VLSI Adder
Finding Succinct Ordered Minimal Perfect Hash Functions
Proving Correctness of Strategies in the AL1 Assertional Language
Parity OBDDs Cannot be Handled Efficiently Enough
New upper bound for the #3-SAT problem
Extensions to Grid Selector Composition and Compilation in APL
Compiling and securing cryptographic protocols
A kind of conditional fault tolerance of (n, k)-star graphs
Flying over a polyhedral terrain
An Optimal Parallel Algorithm for Merging Using Multiselection
Fast leader election in anonymous rings with bounded expected delay
The Space Complexity of Pebble Games on Trees
Tree Precedence in Scheduling: The Strong-Weak Distinction
A Modification of the Greedy Algorithm for Vertex Cover
Optimization of Store Size for Garbage Collection
Common knowledge does not have the Beth property
Choosability on H-free graphs
A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph
Supporting early pruning in top-k query processing on massive data
Improved undecidability results on weighted timed automata
Reduction of Page Swaps on the Two Dimensional Transforms in a Paging Environment
Approximating decision trees with value dependent testing costs
On bounded occurrence constraint satisfaction
Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
Low-level dichotomy for quantified constraint satisfaction problems
There are no pure relational width 2 constraint satisfaction problems
Signed digit data hiding scheme
A Note on Two-Way Probabilistic Automata
A Probably Optimal Embedding of Hyper-Rings in Hypercubes
Time Efficient Deadlock Resolution Algorithms
Two-Dimensional Dictionary Matching
Disjoint Hamilton cycles in the star graph
Deciding Whether Graph G has Page Number One is in NC
Loopless Generation of Gray Codes for k -Ary Trees
A Variation on the Zero-One Law
Monotone Real Circuits are More Powerful than Monotone Boolean Circuits
Garbage Collection in shared-environment Closure Reducers: Space-Efficient Depth First Copying Using a Tailored Approach
Ranking, unranking and random generation of extensional acyclic digraphs
Evaluating Expressions with a Queue
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
An Efficient Selection Algorithm on the Pyramid
Faster counting empty convex polygons in a planar point set
A Simple Function that Requires Exponential Size Read-Once Branching Programs
A Graph Transformation Algorithm for Concurrency Control in a Partitioned Database
Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game
Average Competitive Ratios of On-Line Spanning Trees
Cycles embedding in exchanged hypercubes
Finding Optimal Parallel Prefix Circuits with Fan-Out 2 in Constant Time
Physarum can compute shortest paths: A short proof
Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
A Finite-Difference Sieve to Count Paths and Cycles by Length
New network entropy: The domination entropy of graphs
Finding Hamiltonian Cycles in Certain Planar Graphs
A Remark on Two-Dimensional Finite Automata
Transforming plane triangulations by simultaneous diagonal flips
Security weakness of a certificate-based proxy signature scheme for IIoT environments
Automatic Proofs and Counterexamples for Some Ortholattice Identities
Guarding galleries and terrains
A Note on the Number of States of the DeRemer's Recognizer
On-line two-machine job shop scheduling with time lags
On the Generative Capacity of Simple Matrix Grammars of Finite Index
An improved algorithm for the jump number problem
Asserting the Optimality of Serial SJRPs in Processing Simple Queries in Chain Networks
On pattern matching with k mismatches and few don't cares
Constructing Sorting Networks from k-Sorters
Density of distinct squares in non-primitive words
Efficient implementation of algorithms for approximate exponentiation
Serial batch scheduling on uniform parallel machines to minimize total completion time
A Negative Answer to a Question of Wilke on Varieties of \omega-Languages
A Tool for the Analysis of Manipulation
Linear Time Algorithms on Circular-Arc Graphs
On finding an ear decomposition of an undirected graph distributively
Capacity and delay analysis in delay tolerant network with multiple communities
Self-stabilizing algorithms for efficient sets of graphs and trees
Generalized Closed World Assumptions is Pi^0_2-Complete
An Efficient Strategy for Robot Navigation in Unknown Environment
Hybrid Join: An Improved Sort-Based Join Algorithm
On Voronoi visibility maps of 1.5D terrains with multiple viewpoints
Generation and Ranking of k-ary Trees
Evolving choice structures for genetic programming
Effects of broadcast errors on concurrency control in wireless broadcasting environments
A new upper bound on the parameters of quasi-symmetric designs
On the security of one-round meeting location determination protocol
A generalization of extension complexity that captures P
A Case for a Forward Predicate Transformer
On Helping by Parity-Like Languages
An Ore-type condition for the existence of two disjoint cycles
Universal point sets for 2-coloured trees
A note on harmonic subgraphs in labelled geometric graphs
An O(1)-approximation algorithm for the 2-dimensional geometric freeze-tag problem
The Complexity of the Reliable Connectivity Problem
On the Use of Random Numbers in Asynchronous Simulation via Rollback
On the Covering of Vertices for Fault Diagnosis in Hypercubes
Shifting Timestamps for Concurrency Control in an Information Hierarchy
Inscribing a Symmetric Body in an Ellipse
Hard problems in max-algebra, control theory, hypergraphs and other areas
An elementary proof of a generalization of double Greibach normal form
A proof method for the correctness of modularized 0CFA
A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata
Splicing Systems with Targets are Computationally Universal
Minimizing the sum of the k largest functions in linear time
Murg term rewrite systems
(Non-)existence of polynomial kernels for the Test Cover problem
Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes
A General Method for Avoiding Cycling in a Network
Unification of Kinded Infinite Trees
List Scheduling of Parallel Tasks
Optimal Parallel Algorithms for Finding Cut Vertices and Bridges of Interval Graphs
QUIXO is EXPTIME-complete
A Simple Linear-Time Algorithm for in Situ Merging
Extending de Bruijn sequences to larger alphabets
Solving the learning parity with noise's open question
An Improved Parallel Algorithm that Computes the BFS Numbering of a Directed Graph
A Canonical Simplifier for Trigonometric Expressions in the Kinematic Equation
Priority algorithms for makespan minimization in the subset model
A Note on Simplification Orderings
A Coloring Problem for Weighted Graphs
A note on the greedy algorithm for the unsplittable flow problem
Coordination mechanism for selfish scheduling under a grade of service provision
rDAN : Toward robust demand-aware network designs
Structure and linear time recognition of 3-leaf powers
An Optimal Parallel Processor Bound in Strong Orientation of an Undirected Graph
Relaxed Barrier Synchronization for the BSP Model of Computation on Message-Passing Architectures
Parallel Hashing Algorithms
An Approach to the Transportation of Computer Software
Computing balanced islands in two colored point sets in the plane
Two Shortest Path Metrics on Well-Formed Parentheses Strings
A Distributed Algorithm for Multiple Entries to a Critical Section
Pattern Matching Machine Implementation of a Fast Test for Unique Decipherability
Resolution Deduction to Detect Satisfiability For Another Class Including Non-Horn Sentences In Propositional Logic
Analysis of a Periodically Inspected Buffer
A Note on Minimal Visibility Graphs
Extension of the edge tracing algorithm to disconnected Voronoi skeletons
Low rate cloud DDoS attack defense method based on power spectral density analysis
Nonisomorphic Trees with the Same T-Polynomial
An Approximate Binary Search Algorithm for the Multiple-Choice Knapsack Problem
A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes
On semi-supervised active clustering of stable instances with oracles
Transforming pseudo-triangulations
Satisfying General Proximity/Similarity Queries with Metric Trees
Path Integral Evaluation of Aloha Network Transients
Assertions About Past and Future in Highways: Global Flush Broadcast and Flush-Vector-Time (Erratum)
The Undecidability of Self-Embedding for Term Rewriting Systems
Improved algorithm for all pairs shortest paths
Parallel Boolean Operations for Information Retrieval
A Fault-Tolerant Broadcasting Algorithm for Hypercubes
A Homomorphism Theorem for Data Base Mappings
Deadline Scheduling of Tasks with Ready Times and Resource Constraints
Functions that have read-once branching programs of quadratic size are not necessarily testable
Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems
Triangulating input-constrained planar point sets
A New Additive Pseudorandom Number Generator for Extremely Short Word-Lengths
The Domatic Number Problem on Some Perfect Graph Families
A polynomial algorithm for lot-size scheduling of two type tasks
On secret set schemes
A multi-cycle checkpointing protocol that ensures strict 1-rollback
Comments on "A secure anti-collusion data sharing scheme for dynamic groups in the cloud"
Exploiting re-voting in the Helios election system
Comparison of two code scalability tests
A Kolmogorov complexity characterization of constructive Hausdorff dimension
Minimizing Completion Time for a Class of Scheduling Problems
How to Estimate the Sizes of Domains
The computation of approximate competitive equilibrium is PPAD-hard
The Complexity of Data Flow Criteria for Test Data Selection
Programs as Proofs: A Synopsis
Optimality of Wait-Free Atomic Multiwriter Variables
On the false-positive rate of Bloom filters
Bitcoin private key locked transactions
A faster algorithm for finding shortest substring matches of a regular expression
Real-Time Scheduling Algorithm for Minimizing Maximum Weighted Error with O( N log N + cN ) Complexity
A Note on the Completeness of Resolution with Self-Resolution
Some results on acyclic edge coloring of plane graphs
A note on the fine-grained complexity of MIS on regular graphs
A simple and fast algorithm for computing exponentials of power series
The Full Quotient and its Closure Property for Regular Languages
Breaking Symmetry in Complete Graphs by Orienting Edges: Asymptotic Bounds
An Efficient Semantic Evaluator for Warped LC(1) Attributed Grammars
Strong local diagnosability of ( n , k )(n, k)-star graphs and Cayley graphs generated by 2-trees with missing edges
Corrigendum: Separating Collections of Points in Euclidean Spaces
An observation on NORX, BLAKE2, and ChaCha
The 4-choosability of toroidal graphs without intersecting triangles
Perona-Malik model with self-adjusting shape-defining constant
Parallelization of entanglement-resistant multi-prover interactive proofs
Preemptive Scheduling of Multiprocessor Tasks on the Dedicated Processor System Subject to Minimal Lateness
On Finding Test Data Sets for Loop Free Programs
Inversion of a Recursive Tree Traversal
A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
Logic VS. Complexity Theoretic Properties of the Graph Accessibility Problem for Directed Graphs of Bounded Degree
Digital signature algorithm for securing digital identities
A Faster Alternative to SSS* with Extension to Variable Memory
On clustering with discounts
A Rewriting Strategy to Verify Observational Congruence
Disjunctive partial deduction of a right-to-left string-matching algorithm
A risk-reward model with compound interest rate for non-additive two-option ski rental
Graphs with Small Chromatic Numbers are Easy to Color
Dominance made simple
Weighted automata are compact and actively learnable
Declustering signature files based on a dynamic measure
An interpretation of [lambda][mu]-calculus in [lambda]-calculus
Liveness, Fairness, and Recurrence in Petri Nets
Infinite Words and Biprefix Codes
A tighter analysis of Piterman's Büchi determinization
On Renaming a Set of Clauses as a Horn Set
Automatic Generation of Lexical Analyzers in a Compiler-Compiler
A note on unscrambling address lines
A polylogarithmic approximation algorithm for 2-edge-connected dominating set
Sooner is Safer Than Later
Software evolution - Background, theory, practice
A polynomial algorithm for the strong Helly property
Computing the K-terminal reliability of directed path graphs
A Note on the Space Complexity of Some Decision Problems for Finite Automata
Computing nine new best-so-far solutions for Capacitated VRP with a cellular Genetic Algorithm
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete
An Attack on the Needham-Schroeder Public-Key Authentication Protocol
Single machine lot scheduling to minimize the total weighted (discounted) completion time
K-M-P String Matching Revisited
On the Space Complexity of Recursive Algorithms
The imprecisions of precision measures in process mining
A self-stabilizing algorithm to maximal 2-packing with improved complexity
Fault-tolerant distributed trigger counting
Analysis of the false-positive error rate of tagged fragment marking scheme
A simple proof of the necessity of the failure detector Sigma to implement an atomic register in asynchronous message-passing systems
Derivation of Logic Programs by Functional Methods
Speedup of Vidyasankar's algorithm for the group
A polynomial algorithm for deciding the validity of an electrical distribution tree
Folded Hasse diagrams of combined traces
Settling the bound on the rectilinear link radius of a simple rectilinear polygon
An O(n) Time Algorithm for Maximum Matching in P 4 -Tidy Graphs
A randomized approximation algorithm for computing bucket orders
An efficient protocol for anonymous multicast and reception
Computing OR on a Randomized Fixed Adversary CRCW PRAM
A note on cooperating distributed grammar systems working in combined modes
Verifying Nonrigidity
Comparison of LZ77-type parsings
Mining association rules using inverted hashing and pruning
A simple power analysis attack against the key schedule of the Camellia block cipher
Evolutionary local search for the edge-biconnectivity augmentation problem
Statistics-preserving bijections between classical and cyclic permutations
Online leasing strategy for depreciable equipment considering opportunity cost
Approximation algorithms for terrain guarding
Preface: Process Algebra
Degree sum conditions on two disjoint cycles in graphs
Effective data reduction for strongly stable matching in very sparse graphs
Complexity of minimum corridor guarding problems
On the parameterized complexity of the Maximum Exposure Problem
Permutations on the Block PRAM
Rate monotonic scheduling re-analysed
Some MAX SNP-Hard Results Concerning Unordered Labeled Trees
Partially Dynamic bin Packing can be Solved Within 1 + \varepsilon in (Amortized) Polylogarithmic Time
Simplified Linear-Time Jordan Sorting and Polygon Clipping
Characterization of Idempotent Transformation Monoids
Computing the Minimum Cover of Functional Dependencies
Resource-bounded measure on probabilistic classes
A note on 2-facial coloring of plane graphs
Approximating the Maximally Balanced Connected Partition Problem in Graphs
Super connectivity of Kronecker products of graphs
Root-Neededness and Approximations of Neededness
A new statistical strategy for pooling: ELI
On Two-Way Tree Automata
An in Situ Distributive Sort
Scheduling Chains to Minimize Mean Flow Time
Designing Algorithms by Expectations
Adaptive Control Using Switched Capacitor Filters
The Ford-Johnson algorithm still unbeaten for less than 47 elements
Spiking neural nets with symbolic internal state
Almost all Boolean Functions Have no Linear Symmetries
Factorial Languages Whose Growth Function is Quadratically Upper Bounded
Binary Merging by Partitioning
A note on quadratic residuosity and UP
The equational theory of prebisimilarity over basic CCS with divergence
A Note on a Theorem of Barrington, Straubing and Thérien
Storage-Efficient Data Structure for Large Lookup Dictionaries
Distributed Disassembly of Mosaics
On the expressibility of priority
The Weakest Deadlock-Preserving Congruence
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds
On Hypergraph Acyclicity and Graph Chordality
On spanning trees with restricted degrees
The 0-1 law fails for monadic existential second-order logic on undirected graphs
Total coloring of planar graphs with maximum degree 7
Enumeration of Articulation Pairs of a Planar Graph
The 2-dipath chromatic number of Halin graphs
Optimal Networks for Distributing Nonsequential Programs
On Generating B-Trees with Constant Average Delay and in Lexicographic Order
HORSIC: An efficient one-time signature scheme for wireless sensor networks
Solvability of the Asynchronous Ranking Problem
The Denotational Semantics of Sequential Machines
Improved approximation for Fractionally Subadditive Network Design
Fast monotone summation over disjoint sets
Towards automatic binary runtime loop de-parallelization using on-stack replacement
Another Look at the Degree Constrained Subgraph Problem
On the Minimal Number of * Operators to Model Regularity in Fair SCCS
A New Generalization of Dekker's Algorithm for Mutual Exclusion
Worst-Case Choice for the Stable Marriage Problem
Author's Reply to S. Moran's Note on the Shortest Path Problem
Fast and Read-Only Algorithms for Traversing Trees Without an Auxiliary Stack
Limited bookmark randomized online algorithms for the paging problem
Tight lower bound for average number of terms in optimal double-base number system using information-theoretic tools
A compact execution history for dynamic slicing
On the counting complexity of propositional circumscription
A Note on a Signature System Based on Probabilistic Logic
Covering symmetric supermodular functions with graph edges: A short proof of a theorem of Benczúr and Frank
More on ET0L Systems versus Random Context Grammars
Cryptanalysis and improvements of an efficient certificate-based proxy signature scheme for IIoT environments
Properties of uniformly hard languages
Sets of binary sequences with small total Hamming distances
A Predecessor Algorithm for Ordered Lists
On shuffle products, acyclic automata and piecewise-testable languages
Detecting patterns in finite regular and context-free languages
The shortest kinship description problem
A lower bound for the Quickhull convex hull algorithm that disproves the Quickhull precision conjecture
On a Semaphore Anomaly
Finding Shortest Paths in Distributed Loop Networks
On Linear Search Heuristics
Some Pursuit-Evasion Problems on Grids
A Theta(logn
An Efficient Algorithm for Computing Least Cost Paths with Turn Constraints
Privacy risks ensuing from cross-matching among databases: A case study for soft biometrics
Pseudorandomness analysis of the (extended) Lai-Massey scheme
Embedding of hypercubes into necklace, windmill and snake graphs
Minimum weight feedback vertex sets in circle graphs
Corrigendum to "A note on nonexistence of vectorial bent functions with binomial trace representation in the PS - class" [Information Processing Letters 115 (2) (2015) 139-140]
Hardness of peeling with stashes
On NC algorithms for problems on bounded rank-width graphs
On the Power of Real-Time Two-Way Multihead Finite Automata With Jumps
A Note on Graham's Convex Hull Algorithm
Approximate Triclique Coloring for Register Allocation
Towards an energy complexity of computation
On edge colorings of 1-planar graphs without adjacent triangles
A combinatorial algorithm for MAX CSP
Analysis of a heuristic for acyclic edge colouring
Finding the k Quickset Simple Paths in a Network
Tight Analysis of a Self-Approaching Strategy for the Online Kernel-Search Problem
A Syntax-Free Semantics for the APL Operators
Analysis of Parallel Uniform Hashing
Surveying global verifiability
Event Trace Independence of active behavior
K_1, 3-Free and W_4-Free Graphs
Simple Algorithms for Traversing a Tree Without an Auxiliary Stack
Relativized collapsing between BPP and PH under stringent oracle access
Parametricity and Variants of Girard's J Operator
Revisit of Erdős-Gallai's theorem on the circumference of a graph
A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
Better approximations for max TSP
Approximate hotlink assignment
An Improved Algorithm for Traversing Binary Trees Without Auxiliary Stack
An Optimal Parallel Algorithm for the Euclidean Distance Maps of 2-D Binary Images
On the profile of the corona of two graphs
The equidistribution of some length-three vincular patterns on S n (132)
A Class of Grammar Generating Non-Counting Languages
Scheduling on two identical machines with a speed-up resource
Reply to the Paper "The Numerical Instability of Bini's Algorithm"
The Decidability of the F0L-D0L Equivalence Problem
A Parallel Algorithm for Finding a Triconnected Component Separator with an Application
The Hamiltonian Circuit Problem for Circle Graphs is NP-Complete
VNP=VP in the multilinear world
Using Duality to Compute the Pair of Matrix Products QY and Y T Q Over a Commutative Ring
Indexing permutations for binary strings
A closed-form solution to video matting of natural snow
Embedding a mesh of trees in the crossed cube
Faithful 1-Edge Fault Tolerant Graphs
Termination Detection for Distributed Computations
Bounding component sizes of two-connected Steiner networks
Code migration and program maintainability A categorical perspective
The regularized least squares algorithm and the problem of learning halfspaces
String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automation
On the Non-Existence of Maximal Inference Degrees for Language Identification
Inferring Uniquely Terminating Regular Languages from Positive Data
A Context-Free Syntax of ALGOL 68
Colorful triangle counting and a MapReduce implementation