yusuke1997/dblp-id-title huggingface dataset:
A Simple Parallel Algorithm for Computing the Diameters of all Vertices in a Tree and its Application
Confluence of Indirection Reductions in Graph Rewrite Systems
Genetic Order and Compactifying Garbage Collectors
Nash Equilibria for competitive information diffusion on trees
Zone theorem for arrangements in dimension three
An efficient approximation for the Generalized Assignment Problem
An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation
Using variable automata for querying data graphs
A tighter bound for the self-stabilization time in Herman's algorithm
Farthest line segment Voronoi diagrams
Testing whether the uniform distribution is a stationary distribution
Modified subset sum heuristics for bin packing
Producing Optimised Code for Coercions
Improved approximation of the largest common subtree of two unordered trees of bounded height
Construction of Natural Cycletrees
A note on the Kenyon-Remila strip-packing algorithm
A note on approximations of directed edge dominating set
A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
On Codes, omega-Codes and omega-Generators
Efficient inclusion testing for simple classes of unambiguous ω-automata
A Bounded-Space Tree Traversal Algorithm
Approximation algorithms for minimizing segments in radiation therapy
On the Positive-Negative Partial Set Cover problem
A characterization of tree-like Resolution size
Efficient multi-party concurrent signature from lattices
A Lower Bound for Permutation Routing on Two-Dimensional Bused Meshes
Iterative Deepening Multiobjective A
Stack Implementation of Shallow Binding in Languages with Mixed Scoping
Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree
Throughput Concavity and Response Time Convexity
Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency
On maximum bipartite matching with separation
On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle
Highly Resilient Correctors for Polynomials
Minimum neighborhood in a generalized cube
Packing batches of items into a single bin
A Linear Time Two Tape Merge
A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
A New Optimal Distributed Algorithm for the Set Intersection Problem
Finding bipartite subgraphs efficiently
Efficient quantum key distribution using Fibonacci-number coding with a biased basis choice
A Description of Dynamic Behavior for Compilers Based on Object Oriented Modeling
Master Keys for Group Sharing
A general method to speed up fixed-parameter-tractable algorithms
A Note on Symmetrical Cellular Spaces
Finding the Vertices Nearest to a Point in a Hypercube
Minimum size of a graph or digraph of given radius
Collisions for variants of the BLAKE hash function
Fault-free cycles in folded hypercubes with more faulty elements
Probabilistic weak bisimulation and axiomatization for probabilistic models
Equivariant algorithms for constraint satisfaction problems over coset templates
An Efficient Solution to the Mutual Exclusion Problem Using Weak Semaphores
On the hardness of approximating label-cover
A MAX{m, n} Algorithm for Determining the Graph H from Its Line Graph C
Cyclic reference counting
A Combined BIT and TIMESTAMP Algorithm for the List Update Problem
On Computing Approximate Convex Hulls
A Fuzzy Clustering Algorithm for Graph Bisection
The Complexity of Incremental Convex Hull Algorithms in R d
A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons
Bounds for the Element Distinctness Problem on one-tape Turing machines
On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
Magic Semi-Joins
A linear time deterministic algorithm to find a small subset that approximates the centroid
Worst-case analysis of the Iterated Longest Fragment algorithm
A Note on the Power of Majority Gates and Modular Gates
A Randomized Algorithm for Checking Equivalence of Circular Lists
Enforcing non-hierarchical access policies by hierarchical key assignment schemes
Sequential construction of a circular consecutive-2 system
Oriented vertex and arc colorings of outerplanar graphs
A visual word weighting scheme based on emerging itemsets for video annotation
Efficient Algorithms for the Maximum Weight Clique and Maximum Weight Independent Set Problems on Permutation Graphs
Transformational Semantics for Concurrent Programs
A relaxation of Havel's 3-color problem
Comments on the hierarchically structured bin packing problem
A note on parameterized polynomial identity testing using hitting set generators
Hardness results on the man-exchange stable marriage problem with short preference lists
Bunch Theory: A Simple Set Theory for Computer Science
Linear Algorithm for Optimal Path Cover Problem on Interval Graphs
Every Iterated Morphism Yields a co-CFL
On the complexity of the Monte Carlo method for incremental PageRank
Partial Functions and Logics: A Warning
A Separation of Two Randomness Concepts
Efficient Access Methods for Image Databases
On the stability number of the edge intersection of two graphs
On Dynamic Threshold Schemes
Convergence of Inconsistency Algorithms for the Pairwise Comparisons
Medians and Centres of Polyominoes
Finite satisfiability for guarded fixpoint logic
Security issues in Sarkar's e-cash protocol
A Fast Search Algorithm for the Quorumcast Routing Problem
Approximation algorithms for the arc orienteering problem
A generalized linear time algorithm for an optimal k -distance dominating set of a weighted tree
Synchronizing words under LTL constraints
Optimal reservation policy for two queues in tandem
Erratum to "Nondominated k-coteries for Multiple Mutual Exclusion"
Inevitability in Concurrent Systems
An Improvement on El-Yaniv-Fiat-Karp-Turpin's Money-Making Bi-Directional Trading Strategy
Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
Compact representations of automata for regular expression matching
Universal Traversal Sequences for Expander Graphs
Anti Tai mapping for unordered labeled trees
A combinatorial characterization of treelike resolution space
An Efficient Parallel Algorithm for Finding Minimum Weight Matching for Points on a Convex Polygon
A Dual Link Data Structure for Random File Organization
New length bounds for cycle bases
A Note on Raymond's Tree Based Algorithm for Distributed Mutual Exclusion
Structure and stability number of chair-, co-P- and gem-free graphs revisited
Fairness and Partial Order Semantics
Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
Null Values in a Relational Data Base
The Average-Case Parallel Complexity of Sorting
Linear threshold functions in decision lists, decision trees, and depth-2 circuits
Batched Search of Index Sequential Files
An efficient algorithm to test square-freeness of strings compressed by straight-line programs
Why software writing is difficult and will remain so
On the cost of searching signature trees
Information measures based on fractional calculus
Deques with Heap Order
Single-machine scheduling with a nonlinear deterioration function
An Applicative Random-Access Stack
The Minimization Method for Some Permutation Functionals
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
An optimal result on fault-tolerant cycle-embedding in alternating group graphs
Stability bounds in networks with dynamic link capacities
The bondage number in complete t-partite digraphs
Upper bound for the approximation ratio of a class of hypercube segmentation algorithms
Secure Information Storage and Retrieval Using New Results in Cryptography
Drawing a rooted tree as a rooted y -monotone minimum spanning tree
On Inclusion Problem for Deterministic Multitape Automata
Recording Distributed Snapshots Based on Causal Order of Message Delivery
An Improved Parallel Algorithm for Maximal Matching
Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
Fault tolerance analysis of mesh networks with uniform versus nonuniform node failure probability
Understanding the Complexity of Interpolation Search
Comments on Two Group Signatures
On computational complexity of impossible differential cryptanalysis
Top-k document retrieval in optimal space
Fuzzy Role-Based Access Control
Improved Approximation Algorithms for Embedding Hyperedges in a Cycle
All-pairs suffix/prefix in optimal time using Aho-Corasick space
Crash-tolerant causal broadcast in O ( n ) messages
The Planar Realization of Boolean Functions
A simple algorithm to find Hamiltonian cycles in proper interval graphs
k-Restricted rotation distance between binary trees
The upper and lower bounds of R g -conditional diagnosability of networks
Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with Δ = 9, 10, or 11
Worst case examples for operations on OBDDs
The repeater tree construction problem
A 2.5 Times Optimal Algorithm for Packing in Two Dimensions
Minimal Sense of Direction in Regular Networks
Entropy lower bounds for quantum decision tree complexity
Triangle strings: Structures for augmentation of vertex-disjoint triangle sets
Improving the nonlinearity of certain balanced Boolean functions with good local and global avalanche characteristics
Digitizing the Plane with Cells of Nonuniform Size
Distributed approximation for maximum weight matching on bounded degree bounded integer weight graphs
Generalized 1.5 Sequential Machine Maps
Inverting a Vandermonde Matrix in Minimum Parallel Time
A Conference Key Distribution System for the Star Configuration Based on the Discrete Logarithm Problem
Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems
Free-gram phrase identification for modeling Chinese text
Determining the Majority
Interpretation of Non-Deterministic Algorithms in Higher-Level Languages
A fast algorithm for the alpha-connected two-center decision problem
A Note on the Graph Isomorphism counting Problem
Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
Some reduction operations to pairwise compatibility graphs
The forall-exists 2 fragment of the first-order theory of atomic set constraints is Pi 0 1 -hard
Variants of the Software Solution to Mutual Exclusion
A Unified Approach to Parallel Depth-First Traversals of General Trees
Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length
An Improved Lower Bound for Load Balancing of Tasks with Unknown Duration
A Simple Semi On-Line Algorithm for P2//C_{max} with a Buffer
On the Optimality of the Counter Scheme for Dynamic Linear Lists
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
Fast exact string matching algorithms
Topological ordering algorithm for LDAG
The Critical Complexity of Graph Properties
Personalized app recommendation using spatio-temporal app usage log
I-Serializability: Generalized Correctness for Transaction-Based Environments
Survivable network design: the capacitated minimum spanning network problem
An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs
Decomposition of sparse graphs into two forests, one having bounded maximum degree
Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms
A note on t-complementing permutations for graphs
Recognizable Subsets of the Two Letter Plactic Monoid
Priority Processes Used for Scheduling Within a Tree Structured Operating System
A Distributed Solution of the Distributed Termination Problem
Determinancy of Sinking Automata on Infinite Trees and Inequalities Between Various Rabin's Pair Indices
On Determining the On-Line Minimax Linear Fit to a Discrete Point Set in the Plane
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words
Implementing Dictionaries Using Binary Trees of Very Small Height
Partially Specified Nearest Neighbor Searches Using k-d Trees
Acyclic Directed Hypercubes may have Exponential Diameter
On the complexity of {k}-domination and k-tuple domination in graphs
Total Domination in Interval Graphs
An Optimal EREW Parallel Algorithm for Computing Breadth-First Search Trees on Permutation Graphs
Random Permutations on Distributed, External and Hierarchical Memory
Minimal proper interval completions
Testing gap k -planarity is NP-complete
Efficient linear-time ranking and unranking of derangements
The difference between game chromatic number and chromatic number of graphs
Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
A Note on Shared List Structure in LISP
A Note on Approximate Convex Hulls
Algorithms for maximum weight induced paths
Computing the Minimum Hausdorff Distance Between Two Point Sets on a Line Under Translation
Minimum degree triangulation for rectangular domains
Discrete load balancing on complete bipartite graphs
Multiplexer implementation of low-complexity polynomial basis multiplier in GF(m 2 ) using all one polynomial
List edge and list total colorings of planar graphs without short cycles
A novel edge based image steganography with 2 k correction and Huffman encoding
Verbs are not Cases: Applying Case Grammar to Document Retrieval
Cryptanalysis of an involutional block cipher using cellular automata
A Note on the Proof of a Concurrent Program
Projections of Languages Recognizable by Probabilistic and Alternating Finite Multitape Automata
Some Results on Selectivity and Self-Reducibility
Total Domination and Transformation
On commutativity of Discrete Fourier Transform
On module assignment in two-processor distributed systems: a modified algorithm
An optimal parallel algorithm for c-vertex-ranking of trees
On rainbow-k-connectivity of random graphs
Synthesis of a Discrete-Time Optimal Filter Algorithm with Reduced Sensitivity to Deviations of a Priori Statistics
On the size of (generalized) OBDDs for threshold functions
Size/lookahead tradeoff for LL(k)-grammars
Toughness and (a, b, k)-critical graphs
An improved linear kernel for the cycle contraction problem
A Generalization of Chvátal's Star-Cutset Lemma
Weakness in a RSA-based password authenticated key exchange protocol
A Note on Set Union with Arbitrary Deunions
A Note on Colored Petri Nets
Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games
A Parallel Algorithm for Finding a Maximum Clique of a Set of Circular Arcs of a Circle
On Compromising Statistical Data-Bases with a few Known Elements
Lossy trapdoor functions from homomorphic reproducible encryption
A well-equalized 3-CIST partition of alternating group graphs
Faster pairing computation on genus 2 hyperelliptic curves
Randomized OBDDs for the most significant bit of multiplication need exponential space
Vertex fault tolerance of optimal-kappa graphs and super-kappa graphs
Group path covering and distance two labeling of graphs
Differential analysis of the Extended Generalized Feistel Networks
Probabilistic integer sorting
Enhanced string factoring from alphabet orderings
A Note on a Fast Algorithm for Sparse Matrix Multiplication
A Note on K-Iteration Grammars
Scheduling with Time-Dependent Execution Times
Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super Sparse Sets
Maximum Flow in (s, t) Planar Networks
NP-Hard Sets are Superterse Unless NP is Small
Some Topological Properties of Star Connected Cycles
A note on general epidemic region for infinite regular graphs
Distributed testing without encountering controllability and observability problems
Signed coloring of 2-dimensional grids
Periodicity in rectangular arrays
On the approximability of two tree drawing conventions
A Space-Saving Technique for Assigning Algol 68 Multiple Values
The Practical Significance of Distributive Partitioning Sort
On the security of TrCBC
A new bound for map labeling with uniform circle pairs
On the Maximum Length of Huffman Codes
A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph
Consecutive block minimization is 1.5-approximable
New Results on MWT Subgraphs
Universal forgery on a group signature scheme using self-certified public keys
Covering a set of points in a plane using two parallel rectangles
Performance evaluation of a Java-based networking Application Programming Interface (API)
Divide and Conquer for Linear Expected Time
Sequential iteration of the Erlang fixed-point equations
A Note on Pure Grammars
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
On the Dtructure of Delta p 2
The Latency-of-Data-Access Model for Analyzing Parallel Computation
Matrix Multiplication by Diagonals on a Vector/Parallel Processor
Kinetic hanger
Improving adaptivity and fairness of processing real-time tasks with QoS requirements on clusters through dynamic scheduling
The Complexity of Testing Whether a Graph is a Superconcentrator
Faster algorithms for cograph edge modification problems
An upper bound for the equational specification of finite state services
A closer look at constraints as processes
A Shared-Memory Scheme for Coalesced Hashing
A Pattern Representation of Indexed Languages
Scheduling Periodic and Sporadic Tasks in a Real-Time System
Efficient algorithms for finding interleaving relationship between sequences
An efficient automata approach to some problems on context-free grammars
On the reachability of a version of graph-rewriting system
Time-Optimal Short-Circuit Evaluation of Boolean Expressions
Using Hirschberg's Algorithm to Generate Random Alignments of Strings
Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata
A Note on the Pumping Lemma for Regular Languages
Timed Automata and Recognizability
Estimating the result size of a query to velocity skewed moving objects
A Note on Fairness in I/O Automata
Improved generalized Atkin algorithm for computing square roots in finite fields
Automorphism groups of the Pancake graphs
A Note on Optimal Preemptive Scheduling for Two-Processor Systems
Holographic algorithms on bases of rank 2
A necessary condition for Byzantine k-set agreement
Applications of spiking neural networks
Attacks on statistical databases: The highly noisy case
Minimum Number of Steps for Permutation in a Bubble Memory
A completed hierarchy of true concurrent equivalences
Complexity results for the horizontal bar packing problem
Checkpoint scheduling model for optimality
Fast algorithms for some dominating induced matching problems
Equational Propositional Logic
Scanning List Structures Without Stacks or Tag Bits
Optimal Block Size for Set-Valued Attributes
Parallel approximation algorithms for maximum weighted matching in general graphs
The reachability problem for branching vector addition systems requires doubly-exponential space
On a Notational Device for the Description of Pointer-Free Operations on Structured Data
Fast parallel recognition of LR language suffixes
Comments on Convex Hull of a Finite Set of Points in Two Dimensions
Finding the longest common nonsuperstring in linear time
(2, 1)-Total labelling of trees with sparse vertices of maximum degree
A Noncommutative Algorithm for Multiplying 5*5 Matrices Using 103 Multiplications
Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys
On a Geometric Problem of Zigzags
Growing Nearly Optimal Binary Search Trees
Unbiased estimation of inner product via higher order count sketch
Polynomial-time algorithm for weighted efficient domination problem on diameter three planar graphs
A Simple Variant of the Boundary-Tag Algorithm for the Allocation of Coroutine Environments
Constant ratio fixed-parameter approximation of the edge multicut problem
A PTAS for k-hop MST on the Euclidean plane: Improving dependency on k
Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs
A Direct Version of Shamir and Snir's Lower Bounds on Monotone Circuit Depth
New observations on invariant subspace attack
Communication Algorithms in k-Ary n-Cube Interconnection Networks
New results on the coarseness of bicolored point sets
A simple but effective improvement to the plumb-line algorithm
A note on approximation algorithms of the clustered traveling salesman problem
Prediction from partial information and hindsight, an alternative proof
An empirical study on classification methods for alarms from a bug-finding static C analyzer
Detecting monomials with k distinct variables
Packing triangles in bounded degree graphs
Approximation algorithms for general parallel task scheduling
Edit distance for a run-length-encoded string and an uncompressed string
Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration
On the existence and construction of non-extreme (a, b)-trees
The Decision-Tree Complexity of Element Distinctness
Determining Uni-Connectivity in Directed Graphs
Relating planar graph drawings to planar satisfiability problems
A Note on the Equivalence of a Set of Egds to a Set of FDs
Corrigendum on Convex Hull Algorithms
Characterization of layer-2 unique topologies
Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree
An optimal storage format for sparse matrices
Performance Evaluation of Concurrent Systems Using Petri Nets
Non-Partitionable Point Sets
Parikhʼs theorem: A simple and direct automaton construction
Optimal register allocation for SSA-form programs in polynomial time
Optimal Algorithms for Finding the Symmetries of a Planar Point Set
Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees
Dynamic threshold based information leaker identification scheme
On Secure Domination in Graphs
Generating all the Acyclic Orientations of an Undirected Graph
plapackJava: Towards an efficient Java interface for high performance parallel linear algebra
A Transformation of Marked Graphs
Full Table Search by Polynomial Functions
Intuitionistic fuzzy shortest hyperpath in a network
Gödelization in the lambda calculus
An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs
Drawing Outerplanar Minimum Weight Triangulations
Security of self-certified signatures
Approximating the Minimum Chain Completion problem
Modularity of Confluence: A Simplified Proof
Decision problems for Turing machines
On the Complexity of the Maximum Satisfiability Problem for Horn Formulas
On a Cyclic String-To-String Correction Problem
Enhancing customer relationships by semantic consumer support systems
Linear-Time Optimal Augmentation for Componentwise Bipartite-Completeness of Graphs
Rogue-key attacks on the multi-designated verifiers signature scheme
About blockchain interoperability
The Time Required to Evaluate Division-Free Arithmetic Expressions
A note on degree vs gap of Min-Rep Label Cover and improved inapproximability for connectivity problems
A Note on Dynamic Threshold Schemes
A note on efficient domination in a superclass of P 5 -free graphs
Commutativity of quantum weakest preconditions
A simple analysis of the harmonic algorithm for two servers
Attribute estimation and testing quasi-symmetry
Enhanced algorithms for Local Search
Fast brief practical DFA minimization
The Two Headed Disk: Stochastic Dominance of the Greedy Policy
Reducing the Overhead of the AESA Metric-Space Nearest Neighbour Searching Algorithm
Scheduling Real-Time Computations with Separation Constraints
On the Degree of Synchronization of kl TOL and k1 ETOL Systems
Time Complexity of Languages Recognized by One-Way Multihead Pushdown Automata
A Probabilistic Lower Bound for Checking Disjointness of Sets
Robust, Centralized Certifier Based Concurrency Control for Distributed Databases
Uniform Generation of Forests of Restricted Height
A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable