yusuke1997/dblp-id-title huggingface dataset:
Online uniformity of integer points on a line
Optimal online pricing with network externalities
An NL Hierarchy
Errata: Notes on Avoiding "go to" Statements
Computer Generation of Vertex Graphs
Four Types of Noise in Data for PAC Learning
Smoothsort's Behavior on Presorted Sequences
An improved upper bound of edge-vertex domination number of a tree
Parameterized algorithm for eternal vertex cover
On the Modularization Theorem for Logical Specifications
Forward Checking and Intelligent Backtracking
A Note on Specifying and Verifying Concurrent Processes
Locally exchanged twisted cubes: Connectivity and super connectivity
Generation of all the Balanced Parenthesis Strings in Lexicographical Order
Weakly-non-overlapping non-collapsing shallow term rewriting systems are confluent
Hamiltonicity in connected regular graphs
Problem of Optimizing the Number of Block Accesses in Performing Relational Join is NP-Hard
Commutation Relations of Slices Characterize Some Synchronization Primitives
Average Complexity of Divide-and-Conquer Algorithms
Blocking Versus Nonblocking Interprocess Communication: A Note on the Effect on Concurrency
Operational termination of conditional term rewriting systems
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
Two Pyramid Machine Algorithms for Sdge Detection in Noisy Binary Images
Practical Variations of Shellsort
Merging almost sorted sequences yields a 24-sorter
Probabilistic single obnoxious facility location with fixed budget
A note on on-line broadcast scheduling with deadlines
On disjunction of literals in triggers of statecharts transitions
Games and Winning Strategies
A constructive proof for FLP
Linear kernelizations for restricted 3-Hitting Set problems
Honeycomb toroidal graphs are Cayley graphs
PROCOL: A Protocol-Constrained Concurrent Object-Oriented Language
Toward a System's Environment for Computer Assisted Programming
Multiprocessor Simulation Strategies with Optimal Speed-up
Leakage-resilient CCA2-secure certificateless public-key encryption scheme without bilinear pairing
Extending the Quadrangle Inequality to Speed-Up Dynamic Programming
Reaching a target in the plane with no information
MMH ⁎ with arbitrary modulus is always almost-universal
The Trade-Off Between the Additive Complexity and the Asynchronicity of Linear and Bilinear Algorithms
Erratum to: "Digital signature algorithm for securing digital identities": [Information Processing Letters 82 (2002) 247-252]
On the complexity of exact algorithm for L(2, 1)-labeling of graphs
A quadratic-time DBM-based successor algorithm for checking timed automata
A conceptual model for negotiating in service-oriented environments
A further result on fault-free cycles in faulty folded hypercubes
Flexible coloring
A lower bound on the edge l infinitely radius of Saitou and Nei's method for phylogenetic reconstruction
On the Efficient Use of Semaphore Primitives
Optimal Lower Bounds on the Depth of Polynomial-Size Threshold Circuits for Some Arithmetic Functions
LR(k)-Coupled-Context-Free Grammars
A Distance Metric on Binary Trees Using Lattice-Theoretic Measures
Comparative performance evaluation of Java threads for embedded applications: Linux Thread vs. Green Thread
Learning parities in the mistake-bound model
Mapping a Chain Task to Chained Processors
Generating t-ary Trees in A-Order
A comment on pure-strategy Nash equilibria in competitive diffusion games
On public-coin zero-error randomized communication complexity
A Distributed Join Algorithm
A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs
Bundle event structures: A revised cpo approach
Isolated word recognition with the Liquid State Machine : a case study
Determining asynchronous test equivalence for probabilistic processes
LL(1) Grammars Supporting an Efficient Error Handling
An Axiom System for Database Transactions
A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
A Note on the Horton-Strahler Number for Random Binary Search Trees
A Practical Algorithm for Boolean Matrix Multiplication
Another Compacting Garbage Collector
A restriction of the elastic time algorithm
A Processor Efficient MIS Algorithm on Random Graphs
Parallel Algorithms on Circular-Arc Graphs
Efficient algorithms for the longest common subsequence in k-length substrings
Parallel Strong Orientation of an Undirected Graph
Knuth-Bendix completion of theories of commuting group endomorphisms
Join During Merge: An Improved Sort Based Algorithm
A Linear-Time Recognition Algorithm for Interval Dags
Improved balanced flow computation using parametric flow
Graphs which Locally Mirror the Hypercube Structure
Monotone circuits for monotone weighted threshold functions
Equivalence of recursive specifications in process algebra
A Self-Optimizing Prolog Program and the Underlying Statistical Model
Minimal on-line labelling
Order Independent NCE Grammars Recognized in Polynomial Time
For completeness, sublogarithmic space is no space
Computing Dominances in E^n
Area-universal drawings of biconnected outerplane graphs
Universal hash functions for an infinite universe and hash trees
LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation
Endmarkers can Make a Difference
Minimum cost flows with minimum quantities
UPS- k : a set partitioning problem with applications in UPS pickup-delivery system
Right-arm rotation distance between binary trees
RNS architectures for the implementation of the 'diagonal function'
Distributed Algorithms for Multiple Entries to a Critical Section with Priority
Packing Steiner trees with identical terminal sets
On Equivalence of Relational and Network Database Models
Almost all monotone Boolean functions are polynomially learnable using membership queries
A Counterexample to the Generalized Aanderaa-Rosenberg Conjecture
Integer Linear Programming for Microprograms Register Allocation
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n)
Assessment of Data Redundancy in Fuzzy Relational Databases Based on Semantic Inclusion Degree
Improved Performance of the Greedy Algorithm for Partial Cover
A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins
A Heuristic Method for Generating Large Random Expressions
A P-Complete Language Describable with Iterated Shuffle
A Note on "An improved upper bound on the queuenumber of the hypercube"
Effective Use of Memory in Iterative Deepening Search
On the chromatic numbers of signed triangular and hexagonal grids
Optimal Alphabetic Search Trees With Restricted Maximal Height
Shortest zookeeper's routes in simple polygons
4-edge-coloring graphs of maximum degree 3 in linear time
Approximation algorithms for a virtual machine allocation problem with finite types
Garbage Collecting a Heap Which Includes a Scatter Table
Optimal Chain Partitions of Trees
A note on predecessor searching in the pointer machine model
Estimating Block Transfers When Record Access Probabilities are Non-Uniform
Multi-designated verifiers signatures: anonymity without encryption
Scheduling imprecise computation tasks on uniform processors
On the complexity of detecting hazards
Colored Cause-Effect Structures
Storing information with extractors
Note on the Homogeneous Set Sandwich Problem
Motion Estimation Based on Modified Fourier Spectrum
Burrows-Wheeler transform and Sturmian words
The dissecting power of regular languages
Seek Distances in Two-Headed Disk Systems
Logic Program Semantics and Circumscription of Autoepistemic Theories
Details of Distortions in the Computed Fourier Transforms of Signals - Part I: Short Periodic Signals
Comments on "On the Proof of a Distributed Algorithm": Always-Tru is not Invariant
Closure Property of Principal Cones Under Substitution
Clouds over a public key cryptosystem based on Lyndon words
NP-completeness of local colorings of graphs
Finding augmenting chains in extensions of claw-free graphs
On fully orientability of 2-degenerate graphs
A note on window tau -NAF algorithm
Efficient indexing algorithms for one-dimensional discretely-scaled strings
Optimal direct sum results for deterministic and randomized decision tree complexity
Ready, Set, Go! The Voronoi diagram of moving points that start from a line
Delta -List vertex coloring in linear time
An Optimal Algorithm to Compute all the Covers of a String
An improvement on Vizing's conjecture
A limit characterization for the number of spanning trees of graphs
The Lazy Z-Buffer
The Homogeneous Set Sandwich Problem
Efficient Simulation of Circuits by Erew Prams
A simple algorithm for in-place merging
A Family of Codes Commutatively Equivalent to Prefix Codes
A characterization of partial blocks in weighted graphs
Efficient Management of Dynamic Tables
A note on approximating Max-Bisection on regular graphs
An improved uniform convergence bound with fat-shattering dimension
Ear Decomposition with Bounds on Ear Length
On the security of cryptosystem using automorphism groups
Hardness and tractability of the γ -Complete Subgraph problem
Optimal search for rationals
On Distributed Snapshots
A practical information coverage approach in wireless sensor network
Expected Time Analysis of Interpolation Merge - A Simple New Merging Algorithm
Weighted nearest neighbor algorithms for the graph exploration problem on cycles
Transitive Term Graph Rewriting
Parameterized matching on non-linear structures
An Optimal Algorithm for the Maximum Alignment of Terminals
A Rationale for the Numerical Differentiation of Experimental Data
Minterm-transitive functions with asymptotically smallest block sensitivity
An adjustable linear time parallel algorithm for maximum weight bipartite matching
Visibility-preserving convexifications using single-vertex moves
A simple combinatorial proof for the small model property of two-variable logic
Tight lower bounds for the longest common extension problem
A Note on the Effect of Preemptive Policies on the Stability of a Priority Queue
P_4-laden Graphs: A New Class of Brittle Graphs
A Linear Time Equivalene Test for Read-Twice DNF Formulas
The Influence of Graph Structure on Generalized Dimension Exchange
Complete Operator Precedence
Approximating geodesic tree distance
Computing fibonacci numbers quickly
On the Complexity of Topological Sorting
Borderedness-preserving homomorphisms
Where-Oblivious is not Sufficient
Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings
3-extra connectivity of 3-ary n-cube networks
On representing a simple polygon perceivable to a blind person
Formal Syntax Methods for Natural Language
Self-Adjusting and Split Sequence Hash Tables
A Note on Fine Covers and Iterable Factors of VAS Languages
Computational complexity of queries based on itemsets
A notion of cross-perfect bipartite graphs
Success probability of the Hellman trade-off
On-line exploration of rectangular cellular environments with a rectangular hole
A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence
PDL with Data Constants
Finding all the Palindromes in a Binary Tree in Linear Time and Space
A note on commutative multivariate rational series
The complexity of the certification of properties of Stable Marriage
On scheduling send-graphs and receive-graphs under the LogP-model
Minimum feedback vertex sets in shuffle-based interconnection networks
Space Measures for Storage Modification Machines
Reductions in PPP
Linear Bounds for On-Line Steiner Problems
An Attack on a Recursive Authentication Protocol. A Cautionary Tale
Genome rearrangements: a correct algorithm for optimal capping
A Structural Test Selection Criterion
On Budget-Constrained Flow Improvement
Approximation algorithms for the Bipartite Multicut problem
An ENA algorithm to enhance the performance of TCP over satellite links
Utility of Pathmax in Partial Order Heuristic Search
Faster string matching based on hashing and bit-parallelism
A Memory-Management Unit for the Optimal Exploitation of a Small Address Space
Propositional dynamic logic of context-free programs and fixpoint logic with chop
On Process Assignment in Parallel Computing
Estimating the number of connected components in sublinear time
A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals
An Upper Bound on the Number of Functions Satisfying the Strict Avalanche Criterion
Formulas for cube roots in F 3 m using shifted polynomial basis
Diagnosability of star graphs under the comparison diagnosis model
Prefix Grammars: An Alternative Characterization of the Regular Languages
Fast primal-dual update against local weight update in linear assignment problem and its application
An "Art Gallery Theorem" for pyramids
On the Intersection of the Class of Linear Context-Free Languages and the Class of Single-Reset Languages
A Remark on Middle Space Bounded Alternating Turing Machines
Computing Longest Previous non-overlapping Factors
An Optimal Parallel Algorithm for Generating Combinations
Approximating the optimal sequence of acquisitions and sales with a capped budget
Implementing unreliable failure detectors with unknown membership
Enumeration of balanced finite group valued functions on directed graphs
A Calculational Derivation of the Casop Algorithm
The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure
Enhance fuzzy vault security using nonrandom chaff point generator
Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon
Note on a Modification of the Fundamental Cycles Finding Algorithm
Finding Nearest Neighbors
An Unintentional Omission from ALGOL 68
Top-k Manhattan spatial skyline queries
Characterization of minimally (2, l )-connected graphs
Modelling and verification of delay-insensitive circuits using CCS and the Concurrency Workbench
A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas
On the performance of the approximate parametrization algorithm for curves
A Technique for Reducing Comparison Times in Certain Applications of the Merging Method of Sorting
Hexagonal Three-Layer Channel Routing
Programming by Induction
General Algorithms for the Address Calculation of Lexicographically Ordered Tuples
A relation between edit distance for ordered trees and edit distance for Euler strings
Sensitivity and specificity based multiobjective approach for feature selection: Application to cancer diagnosis
Embedding a family of meshes into twisted cubes
Generating Permutations of a Bag by Interchanges
On the Relative Complexity of Some Languages in NC
A Counter Example to a Monotonicity Property of k-d Trees
Exact algorithms for problems related to the densest k-set problem
On a simple randomized algorithm for finding a 2-factor in sparse graphs
A note on graph balancing problems with restrictions
Partitioning Multiple-Chain-Like Task Across a Host-Satellite System
A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach
On a word avoiding near repeats
A simple 3-edge connected component algorithm revisited
A zero-one SUBEXP-dimension law for BPP
Cryptographic Implementation of a Tree Hierarchy for Access Control
On Termination of Confluent One-Rule String-Rewriting Systems
Routing with Critical Paths
On the Power of Built-In Relations in Certain Classes of Program Schemes
Normal eulerian clique-covering and hamiltonicity
Grammatical Unification
A general result for selecting balanced unequal probability samples from a stream
Bad Cases for Shaker-Sort
A fast addition algorithm for elliptic curve arithmetic in GF(2 n ) using projective coordinates
Some Results on Addition/Subtraction Chains
Deriving Global Virtual Time Algorithms from Conservative Simulation Protocols
A faster algorithm for matching a set of patterns with variable length don't cares
Detecting and extracting natural snow from videos
On Cyclotomic Generator of Order r
Transversal of disjoint convex polygons
The Recognition of Geodetically Connected Graphs
Inductive Inference from all Positive and Some Negative Data
Distributed algorithms for finding and maintaining a k-tree core in a dynamic network
On the Use of Complete Subgraphs in Cluster Analysis
The Dynamic Simulation of Recursive and Stack Manipulation Programs
Stutter-Invariant Temporal Properties are Expressible Without the Next-Time Operator
Workload Scheduling for Multiple Query Processing
The corruption bound, log-rank, and communication complexity
A concise proof for total coloring subcubic graphs
Embedding Rectilinear Graphs in Linear Time
How Many Polynomials can be Approximated Faster Than They can be Evaluated?
Axiomatic Semantics for "Escape" Statements
Towards optimal kernel for edge-disjoint triangle packing
New quantum codes constructed from some self-dual additive F4-codes
HCPO: an efficient insertion order for incremental Delaunay triangulation
Extremal problems on weak Roman domination number
Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations
Horn Functions and Their DNFs
Topological Properties of Supercube
Worst case analysis of a greedy algorithm for graph thickness
Discrete and mixed two-center problems for line segments
A constructive approach to sequential Nash equilibria
Wee LCP
Weighted Search in the Plane
Two Characterization Theorems of Locally Catenative Developmental Systems
Some results on topological properties of folded hypercubes
On rewrite constraints and context unification
Stratified institutions and elementary homomorphisms
Computing suffix links for suffix trees and arrays
A space-efficient self-stabilizing algorithm for measuring the size of ring networks
Obtaining Lower Bounds Using Artificial Components
Optimal energy-efficient placement of virtual machines with divisible sizes
Efficient dominating sets in circulant graphs with domination number prime
The Space Complexity of the Unique Decipherability Problem
Mapping a Functional Notation for Parallel Programs Onto Hypercubes
A Frame for General Divide-and-Conquer Recurrences
The equitable vertex arboricity of complete tripartite graphs
Application of a stochastic name-passing calculus to representation and simulation of molecular processes
A Dynamic Scheduling Algorithm for Large Scale Multimedia Servers
A linear time algorithm for max-min length triangulation of a convex polygon
Monotone Boolean dualization is in co-NP[log 2 n]
A Refinement Procedure for Pure Random Search
On the Time and Tape Complexity of Weak Unification
A heuristic to accelerate in-situ permutation algorithms
Reachability and confluence are undecidable for flat term rewriting systems
Acceptors for Isometric Parallel Context-Free Array Languages
Degrees of Constancy in Programming Languages
On checking skeptical and ideal admissibility in abstract argumentation frameworks
New Linear Time Algorithms for Generating Perfect Elimination Orderings of Chordal Graphs
Approximation algorithms for the TSP with sharpened triangle inequality
On the Point-to-Point Connection Problem
Enumeration of balanced symmetric functions over GF(p)
An Implementation of a Nonlinear Skewing Scheme
A note on the PageRank of undirected graphs
A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula
A solution representation of genetic algorithm for neural network weights and structure
Computing rank-width exactly
Analysis of false-reject probability in distance bounding protocols with mixed challenges over RFID noisy communication channel
A note on integral generalized flows in directed partial 2-trees
Spanning trees with minimum weighted degrees
On Fast Computation of Distance Between Line Segments
Lazy Variable-Renumbering Makes Substitution Cheap
Optimal strategies for the list update problem under the MRM alternative cost model
Dynamic Cycle Detection
An industrial study on the importance of software component documentation: A system integratorʼs perspective
On Universal Computer-Constructors
An Implementation of P and V
Residuation for bipolar preferences in soft constraints
Heuristical top-k: fast estimation of centralities in complex networks
A Faster Approximation Algorithm for the Steiner Tree Problem in Graphs
A faster fixed parameter algorithm for two-layer crossing minimization
A Tight Lower Bound for the Complexity of Path-Planning for a Disc
Virginity: A Contribution to the Specification of Object-Oriented Software
On edge colorings of 1-planar graphs
Fault-tolerant cycle-embedding of crossed cubes
Lower bounds on the rotation distance of binary trees
On 3-choosability of planar graphs without certain cycles
On the number of Go positions on lattice graphs
Problems Complete for \oplus L
Modeling time criticality of information
Rainbow 2-Connection Numbers of Cayley Graphs
An Improvement in the Iterative Data Flow Analysis Algorithm
Walks in phylogenetic treespace
Some Upper Bounds for Minimal Trees
Generating Binary Trees at Random
Widest Empty L-Shaped Corridor
Protocols for Group Oriented Secret Sharing
On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications
A Parallel Approach to Direct Analog-to-Residue Conversion
Forward looking Nash equilibrium for keyword auction
The Competitiveness of Randomized Algorithms for On-Line Steiner Tree and On-Line Spanning Tree Problems
Finite-state concurrent programs can be expressed succinctly in triple normal form
How much precision is needed to compare two sums of square roots of integers?
On the hardness of finding the geodetic number of a subcubic graph
Personalized cache management for mobile computing environments
Random Generation of Words in an Algebraic Language in Linear Binary Space
There exist oriented planar graphs with oriented chromatic number at least sixteen
Invisible runners in finite fields
Trackless online algorithms for the server problem
Decidability for Some Problems of Linear Cellular Automata Over Finite Commutative Rings
An Efficient Algorithm for Concurrent Priority Queue Heaps
Proving Properties of a Ring of Finite-State Machines
An improved upper bound on the queuenumber of the hypercube
On the Rotation Distance in the Lattice of Binary Trees
Classifying k -edge colouring for H -free graphs
CPL+: An improved approach for evaluating the local completeness of event logs
A note on the x-coordinate of points on an elliptic curve in characteristic two
Enhancing the B + -tree by dynamic node popularity caching
Approximation algorithms for time-dependent orienteering
Lot scheduling on a single machine
Super connectivity of line graphs
On learning formulas in the limit and with assurance
Exact VC-Dimension of Boolean Monomials
A concept-based query evaluation with indefinite fuzzy triples
Real-Time Functional Queue Operations Using the Logical Variable
Routing on Trees
Looping LR Parsers
The NP-completeness of (1, r)-subcolorability of cubic graphs
Differential and linear cryptanalysis for 2-round SPNs
The Maximum k-Colorable Subgraph Problem for Chordal Graphs
The FC-rank of a context-free language
Morpion Solitaire 5D: A new upper bound of 121 on the maximum score
The Complexity of Recognizing 3NF Relation Schemes
Generation of Convex Polygons with Individual Angular Constraints
Approximating chi n Efficiently
An Undecidable Problem About Rational Sets and Contour Words of Polyominoes
k-tuple domination in graphs
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation
Annotating problem diagrams with architectural tactics for reasoning on quality requirements
On Expected Costs of Deadlock Detection
On the Multiplication of Reduced Biquaternions and Applications
LTL is closed under topological closure
A Recursion Theorem for Predicate Transformers on Inductive Data Types
New characterization for live and reversible augmented marked graphs
On the Serializability Theorem for Nested Transactions
A ground-complete axiomatization of stateless bisimilarity over Linda
Sorting a sequence of strong kings in a tournament
A div(n) Depth Bollean Circuit for Smooth Modular Inverse
Finding and counting small induced subgraphs efficiently
An approach to optimizing software development team size
Self and Selftype
Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems