yusuke1997/dblp-id-title huggingface dataset:
Recognition and dualization of disguised bidual Horn functions
On the Detection of Unstructuredness in Flowgraphs
On testing single connectedness in directed graphs and some related problems
Recognizing Union-Find trees is NP-complete
Minimum Broadcast Time is NP-Complete for 3-Regular Planar Graphs and Deadline 2
Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees
Pair Algebras and Galois Connections
Distributed algorithm to detect strong conjunctive predicates
On the Number of Small Cuts in a Graph
On the oriented chromatic number of grids
Improved Algorithms for Group Testing with Inhibitors
Attack on a concast signature scheme
Free products of semigroups and monoids with a deterministic context-free word problem
Sharing many secrets with computational provable security
Logic Programming with External Procedures: Introducing S-Unification
A General Framework for Minimax Search in Game Trees
Message Complexity of Hierarchical Quorum Consensus Algorithm
Errata: A New Additive Pseudorandom Number Generator for Extremely Short Word-Lengths
A General Conservation Law for Queueing Disciplines
Strong equivalence of logic programs under the infinite-valued semantics
A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems
An O(sqrt(n)) Time Algorithm for the ECDF Searching Problem for Arbitrary Dimensions on a Mesh-of-Processors
Broadcasting in the Butterfly Network
Trinity Algebra and its Application to Machine Decompositions
Minimal k
Weakest preconditioned goto axiom
A Note on the Approximation of the MAX CLIQUE Problem
Optimal 1-Hamiltonian Graphs
A tree-covering problem arising in integrity of tree-structured data
Two Types of Properties for Complexity Measures
Generating anomalous elliptic curves
On the context-freeness of the set of words containing overlaps
An Improved Bisection Algorithm
Combinatorial Properties of Generalized Hypercube Graphs
Exact output rate of Peres's algorithm for random number generation
On the bit security of the weak Diffie-Hellman problem
An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems
A note on the attractor-property of infinite-state Markov chains
A Practical Method for Finding the Optimum Postponement Transformation for LR(k) Parsers
Probabilistic Self-Stabilization
Numerical Solution of Integral Equations for Potential Problems by a Variational Principle
Testing a Simple Polygon for Monotonicity
On the Minimization of Control Memories
BPP and the Polynomial Hierarchy
A note on the Dwork-Naor timed deniable authentication
Smoothness and Factoring Polynomials Over Finite Fields
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
The Speed of Copying on One-Tape Off-Line Turing Machines
Some digraphs arising from number theory and remarks on the zero-divisor graph of the ring Z
The complexity of comparing optimal solutions
Tree Edit Distance and Maximum Agreement Subtree
A Communication Concept for Distributed Systems
A Note on Parallel Queries and the Symmetric-Difference Hierarchy
Reducing communication costs in robust peer-to-peer networks
The (n, k)-Star Graph: A Generalized Star Graph
On the Complexity of Simplifying Quadratic Forms
The Range Co-Minima Problem
Multidisk Partial Match File Design with Known Access Pattern
A Note on a Conjecture Concerning Symmetric Resilient Functions
A High-Low Kolmogorov Complexity Law Equivalent to the 0-1 Law
On Weak Persistency of Petri Nets
Edge-bipancyclicity of conditional faulty hypercubes
Exact Solutions for the Construction of Optimal Length Test Sequences
Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons
Maximum matching and kernelization of edge dominating set
A syntactic commutativity format for SOS
Complexity and Dimension
Local and global deadlock-detection in component-based systems are NP-hard
A New Approach to Choosing Initial Points in Local Search
Conditional fault tolerance of arrangement graphs
Computing distances between partial rankings
A neighborhood condition for graphs to be maximally k-restricted edge connected
Faster algorithms for guided tree edit distance
Eigen-distribution on random assignments for game trees
Permuted function matching
Sorting Numbers in Linear Expected Time and Optimal Extra Space
A Robust Variation of Interpolation Search
The Parallel Complexity of Integer Prefix Summation
A compression method for prefix-sum cubes
Error-detecting codes and fault-containing self-stabilization
Backwards Analysis of the Karger-Klein-Tarjan Algorithm for Minimum Spanning Trees
A note on the complexity of one-sided crossing minimization of trees
Subtree filament graphs are subtree overlap graphs
Probable Correctness Theory
Security of Wang et al.'s group-oriented (t, n) threshold signature schemes with traceable signers
Updating Hypothetical Data Bases
A note on partially ordered tree automata
Containment of Butterflies in Networks Constructed by the Line Digraph Operation
An Improvement on Parallel Computation of a Maximal Matching
Walking around fat obstacles
On the Complexity of Finite Random Functions
A note on the traveling salesman reoptimization problem under vertex insertion
Towards an Asymptotic Analysis of Karmarkar's Algorithm
A Control Mechanism of a Lisp-Based Data-Driven Machine
EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system
Generalized Lattices Applicable in Retrieval Models
The group factorization problem in finite groups of Lie type
A queueing network-based distributed Laplacian solver for directed graphs
Erratum: Rectilinear Short Path Queries Among Rectangular Obstacles
Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
Extension of the Banker's Algorithm for Resource Allocation in a Distributed Operating System
A Term Equality Problem Equivalent to Graph Isomorphism
On Converting Character Strings to Integers
Improved Nonconservative Sequential and Parallel Integer Sorting
Relationship between optimal k -distance dominating sets in a weighted graph and its spanning trees
Lucky labelings of graphs
Resolving Data Conflicts with Multiple Versions and Precedence Relationships in Real-Time Databases
Stable sets in k-colorable P 5 -free graphs
Varying radix numeral system based adaptive image steganography
The effect of iterativity on adversarial opinion forming
Some FP Algebra with Currying Operation
Approximating the min-max (regret) selecting items problem
The number of tests required to search an unordered table
Vacationing server model for M/G/1 queues for rebuild processing in RAID5 and threshold scheduling for readers and writers
On Detecting Spatial Regularity in Noisy Images
Brooksʼ Theorem for generalized dart graphs
Independence Results About Context-Free Languages and Lower Bounds
Improved hardness of approximation for Geometric Bin Packing
Non-interactive multisignatures in the plain public-key model with efficient verification
Cycle Reference Counting with Local Mark-Scan
An Abstract Interpretation Framework for Optimizing Dynamic Modular Logic Languages
Optimal online-list batch scheduling
Increasing the flexibility of the herding attack
A Public Key Cryptosystem Based on Lyndon Words
Adaptive general perfectly periodic scheduling
Loopless Generation of k-Ary Tree Sequences
On finding the longest antisymmetric path in directed acyclic graphs
A Transportable Code Generator System
An Optimal Test on Finite Unavoidable Sets of Words
The complexity of the proper orientation number
The two-equal-disjoint path cover problem of Matching Composition Network
On the hardness of the Consensus String problem
A fast cost scaling algorithm for submodular flow
Linear discrepancy is Π 2 -hard to approximate
An Experiment in Optimal Sorting
On the decycling number of generalized Kautz digraphs
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure
Optimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority Pre-Emptive Systems
On the All-Farthest-Segments problem for a planar set of points
A network flow based approach for network selection in dynamic spectrum access networks
Relationships between memory models
On the constructions of highly nonlinear zigzag functions and unbiased functions
On the Additive Complexity of Specific Polynomials
Average Case Analysis of Region Search in Balanced k-d Trees
Tree-Like Parse and Polynomial Subclasses of Search Problems
Compressing arrays by ordering attribute values
Unit-Length Embedding of Binary Trees on a Square Grid
A Note on the Relative Performance of Two Disk Scanning Policies
On Optimal Multilevel Indexed Sequential Files
A new algorithm for testing if a regular language is locally threshold testable
On the family of critical section problems
Distance monotonicity and a new characterization of Hamming graphs
On the Loopless Generation of Binary Tree Sequences
The Budgeted Maximum Coverage Problem
Finding Hamiltonian Circuits in Interval Graphs
On local modularity and interpolation in entailment systems
Termination detection by using distributed snapshots
Oracle Complexities for Computational Geometry of Semi-Algebraic Sets and Voronoi Diagrams
A New Lower Bound on Approximability of the Ground State Problem for Tridimensional Ising Spin Glasses
On the complexity of graph coloring with additional local conditions
Software Data Paging and Segmentation for Complex Systems
Grammar Coverings of a Deterministic Parser with Action Conflicts
Strong Equivalence of Relational Wxpressions Under Dependencies
On reporting the L 1 metric closest pair in a query rectangle
Optimizing the evaluation of ℓ -isogenous curve for isogeny-based cryptography
On-line restricted assignment of temporary tasks with unknown durations
A generic construction of CCA-secure deterministic encryption
An Optimal Embedding of Cycles into Incomplete Hypercubes
Intersection Graphs of k -Acyclic Families of Subtrees and Relational Database Query Processing
A novel elementary construction of matching vectors
Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones
A sufficient condition involving implicit degree and neighborhood intersection for long cycles
Use of logical models for proving infeasibility in term rewriting
A Note on Restricted H-Colouring
On the security margin of MAC striping
A Note on the Descriptive Complexity of Maximization
Some Optimal Algorithms for Decomposed Partially Ordered Sets
The envy-free matching problem with pairwise preferences
Static type checking without downcast operator
On the Calculation of Control Transition Probabilities in a Program
The maximum PI index of bicyclic graphs with even number of edges
Weighted Threshold Secret Sharing Schemes
Approximation algorithms for parallel open shop scheduling
Tumble, a fast simple iteration algorithm for Fibonacci
Erasure and error correcting ability of Parikh matrices
Maintaining a Topological Order Under Edge Insertions
A K-trivial set which is not jump traceable at certain orders
On the Programming of Elastic Stores
k-Violation Linear Programming
Testing a Simple Polygon for Monotonicity Optimally in Parallel
Fast computation of shortest watchman routes in simple polygons
Construction of Halvers
An improved approximation algorithm for the discrete Fréchet distance
Optimal Value for the Newton-Raphson Division Algorithm
Lower Bounds for Sampling Algorithms for Estimating the Average
Optimal global alignment of signals by maximization of Pearson correlation
Stop-and-Copy and One-Bit Reference Counting
Learning network structures from contagion
On Computing the Time Complexity of Transitive Closure Algorithms
On deriving conditional diagnosability of interconnection networks
Embedded edge connectivity of k -ary n -cubes
Dynamic bottleneck optimization for k-edge and 2-vertex connectivity
On the paper of Pascal Schweitzer concerning similarities between incompressibility methods and the Lovász Local Lemma
The Morse Sequence and Iterated Morphisms
A short proof of optimality for the MIN cache replacement algorithm
The Contour Problem for Rectilinear Polygons
Tight upper bound on the number of edges in a bipartite K 3, 3 -free or K 5 -free graph with an application
On limits on the computational power of data-accumulating algorithms
Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete
Complexity of weak acceptance conditions in tree automata
Generalized Lower Bounds Derived from Hastad's Main Lemma
Path Integral Methods for Computer Performance Analysis
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem
Rotation-Based Computations for Ray-Tracing Second-Order Surfaces and Curves
Fooling Turing machines with sublogarithmic space: a note on 'For completeness, sublogarithmic space is no space' by M. Agrawal
Approximating the Tree and Tour Covers of a Graph
The Complexity of Model Checking for Circumscriptive Formulae
Rank-2 module-LIP with special matrices
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
Producing the left parse during bottom-up parsing
Constraint Satisfaction - Algorithms and Complexity Analysis
On the Intersection of Orthogonal Objects
A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes
Some Remarks on One-Pebble Rectangular Array Acceptors
Boundedness of adaptive nets is decidable
On the parameterized complexity of the Edge Monitoring problem
Periodic String Division Generated by Deterministic L Systems
Robust parametric reachability for timed automata
A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix
Assertions About Past and Future in Highways: Global Flush Broadcast and Flush-Vector-Time
A cubic-time algorithm for computing the trinet distance between level-1 networks
Matrix Multiplication for Finite Algebraic Systems
Edge-colored graphs with applications to homogeneous faults
On the minimal information to encode timestamps in distributed computations
Bisimulation and Effectiveness
Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems
An Incremental Reconstruction Method for Dynamic Planar Point Location
An O(n log2 n) Algorithm for the Maximum Weighted Tardiness Problem
An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon
On message authentication with a correlated setup
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Scheduling on a Single Processor with Variable Speed
An improved degree based condition for Hamiltonian cycles
A Formal System for Parallel Programs in Discrete Time and Space
Efficient Algorithms for Finding the Most Vital Edge of a Minimum Spanning Tree
Stable Marriages by Coroutines
Performance analysis of a multicasting protocol with contention-less minislots
Another short proof of optimality for the MIN cache replacement algorithm
Protection in Operating Systems
Automatic generation of basis test paths using variable length genetic algorithm
On-Line Computation of Convolutions
Worst-case analysis of LPT scheduling on a small number of non-identical processors
Incremental Constraint Deletion in Systems of Linear Constraints
A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm
The hub number of a graph
Intersection Number of Two Connected Geometric Graphs
Universal Grammars
A Lower Bound for Two-Server Balancing Algorithms
Optimal point removal in closed-2PM labeling
Modulus Division on a Two's Complement Machine
Arrangement Graphs: A Class of Generalized Star Graphs
A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary
On Matijasevitch's Nontraditional Approach to Search Problems
Computational Limitations on Training Sigmoid Neural Networks
Gossip Latin square and the meet-all gossipers problem
Minimizing Elimination Tree Height Can Increase Fill More Than Linearly
Weakest Preconditions for Pure Prolog Programs
Extension complexities of Cartesian products involving a pyramid
Subnetwork preclusion for bubble-sort networks
A Denial of Service attack against fair computations using Bitcoin deposits
Inter-Protocol Interleaving Attacks on Some Authentication and Key Distribution Protocols
On the Convergence of Stationary Distributions in Simulated Annealing Algorithms
A New Data Structure for the UNION-FIND Problem
Boundedness Testing for Unambiguous Context-Free Grammars
Modifying an instance of the super-stable matching problem
On the Closure of Certain Function Classes Under Integer Division by Polynomially-Bounded Functions
WMT - from a personal perspective
An Algebraic Characterization of Semantic Independence
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees
Minimal Visibility Graphs
Binary Self-Stabilization in Distributed Systems
Boundedness undecidability for synchronized nets
A Simple Bivalency Proof that t -Resilient Consensus Requires t + 1 Rounds
The super connectivity of exchanged hypercubes
An O(NP) Sequence Comparison Algorithm
Double hashing with passbits
Edge-disjoint Hamiltonian cycles of balanced hypercubes
Invariants for the Construction of a Handshake Register
An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification
Decision tree classification with bounded number of errors
Relativized separation of EQP from P NP
Optimal On-Line Decremental Connectivity in Trees
On the Chromatic Index of Graphs with 2 m + 1 Vertices and 2 m 2 Edges
An Algorithm for Dynamic Data Allocation in Distributed Systems
Infinite Hierarchy of Expressions Containing Shuffle Closure Operator
A note on the Hadwiger number of circular arc graphs
Automata and Forbidden Words
Bounded-Width Polynomial-Size Boolean Formulas Compute Exactly Those Functions in AC^0
Efficient Bottom-Up Execution of Logic Programs Using Abstract Interpretation
Steiner Set and Connected Domination in Trapezoid Graphs
A simple factor-3 approximation for labeling points with circles
A note on 3D orthogonal drawings with direction constrained edges
Efficient algorithms for regular expression constrained sequence alignment
Exponential Lower Bounds for the Tree-Like Hajós Calculus
Gradient/Hessian-enhanced least square support vector regression
Simplicity in Eulerian circuits: Uniqueness and safety
A note on the size of OBDDs for the graph of integer multiplication
Nondominated k-Coteries for Multiple Mutual Exclusion
Acyclic chromatic indices of fully subdivided graphs
Optimal Checkpointing and Local Recording for Domino-Free Rollback Recovery
Kolmogorov Complexity and Random Graphs
Solving a system of difference constraints with variables restricted to a finite set
Corrigendum: An Algorithm for the Computation of the Hutchinson Distance
Separability and the Detection of Hidden Channels
Remarks on arbitrary multiple pattern interpretations
Friends-and-strangers is PSPACE-complete
On the Number of Edges in Cycletrees
A randomized sublinear time parallel GCD algorithm for the EREW PRAM
An improved security-aware packet scheduling algorithm in real-time wireless networks
Differential cryptanalysis of eight-round SEED
A Linear-Time Algorithm for Finding All Feedback Vertices
An Algorithm to Estimate the Fraction Defective and The Exponential Mean Life Using Unlabeled Samples
The transportation metric and related problems
Examples of Formal Grammars with Weights
A New Distributed Breadth-First-Search Algorithm
Performance Bounds for Modeling NUMA Architectures
Improved approximation algorithms for the Max Edge-Coloring problem
Memoryless near-collisions, revisited
Head-Strictness is Not a Monotonic Abstract Property
Approximation algorithms for restricted Bayesian network structures
Incremental distance products via faulty shortest paths
Safety Analysis Versus Type Inference for Partial Types
Lower bounds on the vertex-connectivity of digraphs and graphs
Quantification in Algol-Like Languages
Concurrency in a Language Employing Messages
Partial known plaintext attack on Koyama scheme
Global lock escalation in database management systems
On the k-tuple domination of de Bruijn and Kautz digraphs
Building Heaps in Parallel
On the role of formal methods in security
A Polynomial Bound on the Number of Light Cycles in an Undirected Graph
Efficient Query Evaluation in Relational Data Bases with Missing Values
Parallel genetic algorithm with parameter adaptation
An ID-based signcryption scheme with compartmented secret sharing for unsigncryption
The Worst-Case Running Time of the Random Simplex Algorithm is Exponential in the Height
On approximation by XOR-OBDDs
Paw-Fee Graphs
Noisy corruption detection
On parallel time in population protocols
The Data Refinement Calculator for Z Specifications
Polygonal Intersection Searching
Stabilizing Unison
Parallel Algorithms for the Segment Dragging Problem
Kinetic collision detection for balls
A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs
Single-source three-disjoint path covers in cubes of connected graphs
n-Reconstructability of Context-Free Grammars
Comments on "Generalized rate monotonic schedulability bounds using relative period ratios"
An Efficient Implemention of Priority Queues Using Fixed-Sized Systolic Coprocessors
Optimal Dynamization of Decomposable Searching Problems
An Algorithm for Approximate Membership checking with Application to Password Security
Computing Values of a Polynomial with Only few Multiplications
A new universal and fault-tolerant quantum basis
Some Average Measures in m-ary Search Trees
Restructuring binary search trees revisited
On vertex ranking of a starlike graph
On Learning width Two Branching Programs
Practical attack on NLM-MAC scheme
A Tagless Marking That is Linear Over Subtrees
A Note on Graham's Bound
On the Agreement of Many Trees
An optimal algorithm for reporting visible rectangles
Parametric analysis of overall min-cuts and applications in undirected networks
An Experiment With the Use of Predicate Transformers in UNITY
An Analysis of the Karp-Rabin String Matching Algorithm
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
Substad: For Fast Substitution in LISP, with an Application on Unification
Time and space optimality of rotor-router graph exploration
On computing the semi-sum of two integers
An improvement of a cryptanalysis algorithm
Sigma^0_n-Complete Properties of Programs and Martin-Löf Randomness
An O(|V|³) Algorithm for Finding Maximum Flows in Networks
Upper and lower bounds for the q-entropy of network models with application to network model selection
Complexity of Sorting by Distributive Partitioning
On the balancedness of nonlinear generators of binary sequences
A simple proof of optimality for the MIN cache replacement policy
Confluence of the Lambda Calculus with Left-Linear Algebraic Rewriting
Modal Functions for Concise Definition of State Machines and Products
Upper bound for algebraic immunity on a subclass of Maiorana McFarland class of bent functions
Universal homophonic coding scheme using differential encoding and interleaving
Tight FPT Approximation for Socially Fair Clustering
ECLR-Attributed Grammars: A Practical Class of LR-Attributed Grammars
A lower bound for the coverability problem in acyclic pushdown VAS
A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra
Voronoi Diagrams from Convex Hulls
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete
Numerical Solution of a Boundary Problem for Equations of Elastic Equilibrium of Bodies in Transferences
A Verification Algorithm for Inheritance Hierarchies in Object-Oriented Databases
Guided blocks WOM codes
Smooth movement and Manhattan path based Random Waypoint mobility
Parameterized approximation of dominating set problems
Faster recognition of clique-Helly and hereditary clique-Helly graphs
On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes
Using OBDDs to Handle Dynamic Constraints
Associative-Commutative Reduction Orderings
Constrained multilinear detection for faster functional motif discovery
Two Algorithms for Constructing a Binary Tree from its Traversals