yusuke1997/dblp-id-title huggingface dataset:
Approximate Max k -Cut with Subgraph Guarantee
On the Richness of the Collection of Subtrees in Random Binary Search Trees
Finding the Closest Extreme Vertex to a Fixed Point
On conflict-free cuts: Algorithms and complexity
Efficient multiplier based on hybrid approach for Toeplitz matrix-vector product
Partial Evaluation of Queries for Bit-Sliced Signature Files
Non-clairvoyant scheduling with conflicts for unit-size jobs
Antimagic labeling and canonical decomposition of graphs
Some Subclasses of Context-Free Languages In NC1
Remarks on the Equivalence of c-e Structures and Petri Nets
Sorting Roughly Sorted Sequences in Parallel
A Division Property of the Fibonacci Word
Efficient multi-variate abstraction using an array representation for combinators
Disjoint pattern matching and implication in strings
An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons
A V² Algorithm for Determining Isomorphism of Planar Graphs
Finding a chain graph in a bipartite permutation graph
On Circularly-Hidden Surface Removal
Runtime analysis of evolutionary algorithms via symmetry arguments
Graphical models of separation logic
Recognizing cographs and threshold graphs through a classification of their edges
On the Efficiency of Polynomial Time Approximation Schemes
Counting Convex Polygons in Planar Point Sets
An improved FPT algorithm for Almost Forest Deletion problem
On the inapproximability of maximum intersection problems
Some results on graphs without long induced paths
Canonical density control
The associativity of equivalence and the Towers of Hanoi problem
The expected complexity of Prim's minimum spanning tree algorithm
Unification in Commutative Rings is Not Finitary
Arbetrated Unconditionally Secure Authentication Scheme with Multi-Senders
Voronoi Diagram for services neighboring a highway
Corrigendum to "Upward separation for FewP and related classes"
Parallel Computation and Conflicts in Memory Access
Space-Time Trade Off in Implementing Certain Set Operations
Fully CCA2 secure identity based broadcast encryption without random oracles
Computability by monadic second-order logic
Efficient recognition of equimatchable graphs
Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules
Randomized distributed online algorithms against adaptive offline adversaries
Efficient multiple-precision integer division algorithm
Tetravex is NP-complete
Stabilizing Phase-Clocks
Programmed Simulation of Sequential Circuits
A Fast Compacting Garbage Collector
A shortest cycle for each vertex of a graph
Cryptanalysis of a Public Key System Based on Diophantine Equations
Fast batch modular exponentiation with common-multiplicand multiplication
A symbolic approach for content-based information filtering
Server Problems and Resistive Spaces
Parallel Asynchronous Connected Components in a Mesh
Factorization of de Bruijn digraphs by cycle-rooted trees
Communication Complexity of Multi-Processor Systems
Characteristic Inequalities for Binary Trees
On the composability of consistency conditions
Redundancy removal in multicast protocols
Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
Online Channel Allocation in FDMA Networks with Reuse Constraints
Data Allocation Strategies for the Gauss and Jordan Algorithms on a Ring of Processors
Scheduling a batching machine with convex resource consumption functions
Approximating Optimally Discrete Probability Distribution with kth-Order Dependency for Combining Multiple Decisions
Correct proof of the main result in "The number of spanning trees of a class of self-similar fractal models" by Ma and Yao
Strong hardness of approximation for tree transversals
Linear time distributed swap edge algorithms
An improved FPTAS for Restricted Shortest Path
An Algorithm for Obtaining the Chromatic Number and an Optimal Coloring of a Graph
Is SSS* Better Than Alpha-Beta?
Independent feedback vertex sets for graphs of bounded diameter
Fully symmetric swapped networks based on bipartite cluster connectivity
Flower Pollination Algorithm with Bee Pollinator for cluster analysis
Proof of correctness of Ressel's adOPTed algorithm
An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible
Gales suffice for constructive dimension
Levelling Terrain Trees: A Transshipment Problem
One-round identity-based key exchange with Perfect Forward Security
Log' version vector: Logging version vectors concisely in dynamic replication
Compressibility and Uniform Complexity
A Simple Algorithm for Enumerating Longest Distances in the Plane
Semantic flowers for good-for-games and deterministic automata
A Generalization of the Method of Finite Differences
Dynamic Connectivity in Digital Images
Non-clairvoyant scheduling for weighted flow time
Approximation algorithms for the ring loading problem with penalty cost
Improved and simplified inapproximability for k-means
Learning classifier systems: New models, successful applications
The Automated Solution of Logic Puzzles
Polynomial recognition of vulnerable multi-commodities
The Cost of Graceful Degradation for Omission Failures
Complexity of homomorphisms to direct products of graphs
Reverse auctions are different from auctions
A simple and communication-efficient Omega algorithm in the crash-recovery model
On certain computations of Pisot numbers
Permutations of Bounded Degree Generate Groups of Polynomial Diameter
No odd pairs in minimal imperfect NP 5 graphs
Maximum-area triangle in a convex polygon, revisited
On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
On the Number of Candidate Keys
New bounds on the size of the minimum feedback vertex set in meshes and butterflies
An Approximation Algorithm for Least Median of Squares Regression
Efficient feature selection based on correlation measure between continuous and discrete features
Kolmogorov-Loveland stochasticity for finite strings
Finding the largest fixed-density necklace and Lyndon word
A Generalized Notion of Semantic Independence
A Calculus of Durations
Experiments With a Fast String Searching Algorithm
On the Upper Bound on the Rotation Distance of Binary Trees
On the evolution of the worst-case OBDD size
On generalized bent functions with Dillon's exponents
Implicit Computation of Synchronization Primitives
Independent Sets in Graphs with Triangles
Using Fewer Processors to Reduce Time Complexities of Semigroup Computations
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions
Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy
Recovering distributed objects
Finding an Approximate Minimum-Link Visibility Path Inside a Simple Polygon
Computing inductive vertex orderings
Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General
Analysis of total average queue length in multi-hop wireless networks
1-Approximation Algorithm for Bottleneck Disjoint Path Matching
A linear-time algorithm for computing the multinomial stochastic complexity
A Fast Multiprocessor Message Passing Implementation
A Note on Word Chains and Regular Languages
The clique-transversal set problem in {claw, K 4 }-free planar graphs
Bandwidth of Chain Graphs
New simple constructions of distance-increasing mappings from binary vectors to permutations
A simple representation of subwords of the Fibonacci word
A Note on Unambiguous Function Classes
The Demand Operation in the Schematic Protection Model
Some improved inequalities related to Vizing's conjecture
The Min-Max Spanning Tree Problem and Some Extensions
Writing a Number as a Sum of Two Squares: A New Solution
Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs
Correctness of an Extended Operator-Precedence Parsing Algorithm
A note on an IND-CCA2 secure Paillier-based cryptosystem
Signed and minus clique-transversal functions on graphs
Infinite Hierarchy of Shuffle Expressions Over a Finite Alphabet
Average Number of Messages for Distributed Leader-Finding in Rings of Processors
Analysis of Hierarchical Bus-Based Multicomputer Architectures
Design methods for semi-bent functions
Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs
On the linear complexity of the sequences generated by nonlinear filterings
Efficient intensity map splitting algorithms for intensity-modulated radiation therapy
Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs
On Software Equations
End vertices of graph searches on bipartite graphs
On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables
Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537]
The firing squad synchronization problem with sub-generals
Improved construction for universality of determinant and permanent
The Towers of Hanoi Problem
F-Factors of Graphs: A Generalized Matching Problem
A note on an expressiveness hierarchy for multi-exit iteration
Approximation algorithms for color spanning diameter
On the VC-dimension of unique round-trip shortest path systems
Optimal online markdown and markup pricing policies with demand uncertainty
Improved bounds for asymmetric communication protocols
Complete Problems for Symmetric Logspace Involving Free Groups
Cryptanalysis of Chang-Wu's group-oriented authentication and key exchange protocols
Copying Theorems
On estimating the time taken to rectify faults in a software package during the system testing phase
Linear Algorithm for Domatic Number Problem on Interval Graphs
A Note on the Power of Integer Division
Successful Visual Human-Computer Interaction is Undecidable
A Multi-Stack Method for the Fast Generation of Permutations with Minimal Length Increasing Subsequences
A Simplified Account of Polymorphic References
A Note on Heuristics for Dynamic Organization of Data Structures
Algorithmic construction of Hamiltonians in pyramids
The Derivation of a Tighter Bound for Top-Down Skew Heaps
Differentiators and detectors
Random duplicate storage strategies for load balancing in multimedia servers
Instability results for cosine-dissimilarity-based nearest neighbor search on high dimensional Gaussian data
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set
An Algorithm for Shortest-Path Motion in Three Dimensions
An answer to an open problem of Mesnager on bent functions
A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments
Game chromatic number of graphs with locally bounded number of cycles
Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
Another Cryptanalytic Attack on 'A Cryptosystem for Multiple Communication'
The probability of "undefined" (non-converging) output in generating the universal probability distribution
Line segment covering of cells in arrangements
Ranking and unranking permutations in linear time
A note on exact distance labeling
Branching bisimulation semantics for quantum processes
The VC dimension of k-fold union
Obituary: Victor Mikhaylovich Glushkov (1923-1982)
Message Terminating Algorithms for Anonymous Rings of Unknown Size
What Hill-Marty model learn from and break through Amdahlʼs law?
Elements of security: Closure, convergence, and protection
On the Random Construction of Heaps
There is no EPTAS for two-dimensional knapsack
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
The Minimum Labeling Spanning Trees
"The simplest protocol for oblivious transfer" revisited
Global Avalanche Characteristics and Propagation Criterion of Balanced Boolean Functions
The Minkowski sum of a simple polygon and a segment
On the supports of recognizable series over a field and a single letter alphabet
On Minimal Eulerian Graphs
A fixed-parameter tractable algorithm for matrix domination
A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation
A New Class of C.F.L. for Which the Equivalence is Decidable
Erratum: Computer Generation of Vertex Graphs
Upper signed k-domination in a general graph
Distributed Evaluation of an Iterative Function for all Object Pairs on an SIMD Hybercube
Making a Fair Roulette From a Possibly Biased Coin
Computing Eulerian Trails
Selection by Distributive Partitioning
Scheduling Jobs with Varying Processing Times
On the Closure of Triangle-Free Graphs Under Substitution
A framework to visualize equivalences between computational models of regular languages
A polylogarithmic approximation for computing non-metric terminal Steiner trees
Sorting by Distributive Partitioning
Fixed Point Theorems and Semantics: A Folk Tale
Evaluating Clustering Factor Approach to Estimating Block Selectivities
Consecutive Retrieval with Redundancy: An Optimal Linear and an Optimal Cyclic Arrangement and Their Storage Space Requirements
A Size-Depth Trade-Off for the Analog Computation of Boolean Functions
Improved algorithm for the symmetry number problem on trees
Excessively duplicating patterns represent non-regular languages
Fast Computation of the Euclidian Distance Maps for Binary Images
Simple Algorithms for Multiprocessor Scheduling to Meet Deadlines
A Note on the Analysis of Extendible Hashing
On the hardness of approximating Max-Satisfy
Combinatorial search from an energy perspective
Time Efficient Systolic Architecture for Matrix * Vector Multiplication
KCube: A novel architecture for interconnection networks
Unboundedness Detection for a Class of Communicating Finite-State Machines
An improved kernelization for P 2 -packing
An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree
Counting extensional acyclic digraphs
The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n)
On Generalized Matching Problems
Randomized consensus with regular registers
A Simple Correctness Proof of the MCS Contention-Free Lock
Efficient algorithms for clique problems
Bracket-Languages are Recognizable in Logarithmic Space
A Simplified Solution of the n Queens Problem
Every lobster is odd-elegant
The Reachability Problem for Finite Cellular Automata
An Inductive Number-Theoretic Characterization of NP
Havel-Hakimi residues of unigraphs
A Note on Higher-Order Functions Versus Logical Variables
On Synthesis of Scheduling Algorithms
A Generalization of Binomial Queues
Structural soundness of workflow nets is decidable
An Exact Algorithm for the Constraint Satisfaction Problem: Application to Logical Inference
Computing the Determinant and the Characteristic Polynomial of a Matrix via Solving Linear Systems of Equations
Decidability Results Concerning k-limited ED0L Systems
Linear systolic multiplier/squarer for fast exponentiation
Multiplicative updates for polynomial root finding
Finding Near Neighbors in K-Dimensional Space
On the rectangle method in proofs of robustness of tensor products
Improved entropy bounds for parity filtered self-timed ring based random number generators
Modulo Classes and Logarithmic Advice
An O(log N) Algorithm to Solve Linear Recurrences on Hypercubes
A direct algorithm for restricted rotation distance
Ensuring the quasi-termination of needed narrowing computations
Hardware/software co-design then and now
A faster FPT algorithm for 3-path vertex cover
The number of pessimistic guesses in Generalized Black-peg Mastermind
The super connectivity of folded crossed cubes
Steady-Paced-Output and Fractional-On-Line Algorithms on a RAM
Strong Linear Orderings of a Directed Network
The Weighted Perfect Domination Problem
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
The Steiner path aggregation problem
An optimal hierarchical clustering algorithm for gene expression data
Spanners under the Hausdorff and Fréchet distances
Weighted well-covered graphs without cycles of lengths 5, 6 and 7
A Pursuit-Evasion Problem on a Grid
A Note on Terminal Balancing of Algebraic Systems
Optimal one-page tree embeddings in linear time
Non-Associative Parallel Prefix Computation
Pseudo-relevance feedback and statistical query expansion for web snippet generation
The Subprogram Problem for Software Metric Design
An Algorithm for String Matching with a Sequence of don't Cares
On the Generalized Twisted Cube
On the Correspondence Metween Two Classes of Reduction Systems
An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph
A flaw in the electronic commerce protocol SET
A general compiler for password-authenticated group key exchange protocol
An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon
Cartesian product digraphs with optimal restricted arc connectivity
On behavioural pseudometrics and closure ordinals
Computing the Optimal Bridge Between Two Convex Polygons
On local modularity variants and -institutions
Characterization and recognition of Radon-independent sets in split graphs
An improved heuristic for "Ulam-Rényi game"
Lower Bounds for Arithmetic Problems
A 2 O(k) poly(n) algorithm for the parameterized Convex Recoloring problem
Bottom-up nearest neighbor search for R-trees
A Systematic Test for Extended Operator Precedence
Tighter Bounds on a Heuristic for a Partition Problem
Performance Evaluation of Concurrent Systems Using Conflict-Free and Persistent Petri Nets
Cryptanalysis of an identity based broadcast encryption scheme without random oracles
A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms
Storage Requirements in Stochastic Data Acquisition Systems
The Effect of the Density of States on the Metropolis Algorithm
A note on the not 3-choosability of some families of planar graphs
On exploring always-connected temporal graphs of small pathwidth
The Greedy Algorithm is Optimal for On-Line Edge Coloring
A quadratic kernel for computing the hybridization number of multiple trees
Maximum subset intersection
A Note on "Scheduling Unit-Time Tasks with Integer Release Times and Deadlines"
A new method for approximate indexing and dictionary lookup with one error
Weighted Grammars and Kleene's Theorem
A Cryptosystem for Multiple Communication
Simulating finite automata with context-free grammars
Randomized selection in n+C+o(n) comparisons
Evolutionary game algorithm for continuous parameter optimization
On computing a longest path in a tree
An efficient algorithm for parameterizing HsMM with Gaussian and Gamma distributions
Distributing A B+-Tree in a Loosely Coupled Environment
Rearranging Scattered Information on BSR
λ-Optimality of Bipartite Digraphs
NC Algorithms for Dynamically Solving the all Pairs Shortest Paths Problem and Related Problems
A Coarse-Grained Multicomputer algorithm for the detection of repetitions
Scheduling Multiprocessor Tasks on Three Dedicated Processors
The optimal structure of algorithms for α-paging
On the tractability of coloring semirandom graphs
Dense Edge-Disjoint Embedding of Complete Binary Trees in the Hypercube
Heuristic Algorithms for Process Assignment in Distributed Computing Systems
Metric distortion of obnoxious distributed voting
Radix Sort on the Hypercube
Using 5-isogenies to quintuple points on elliptic curves
Topological additive numbering of directed acyclic graphs
On the diameter of geometric path graphs of points in convex position
An O(1) Time Optimal Algorithm for Multiplying Matrices on Reconfigurable Mesh
A Unified Algorithm for Sorting on Multidimensional Mesh-Connected Processors
A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees
Clique-width and edge contraction
Efficiently recognizing graphs with equal independence and annihilation numbers
Boundedness is Undecidable for Datalog Programs with a Single Recursive Rule
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
Probabilistic Analysis of k-Dimensional Packing Algorithms
Computing Strictly-Second Shortest Paths
A Note on the Server Problem and a Benevolent Adversary
The Class of Context-Free Languages is not an E0L Family
An Efficient Write-All Algorithm for Fail-Stop PRAM Without Initialized Memory
A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula
On the Structural Locality of Reference in LISP List Access Streams
Acyclic domination on bipartite permutation graphs
Linear complexity of the Naor-Reingold pseudo-random function
Faster deterministic Feedback Vertex Set
On Iterated Integer Product
Overcoming observability problems in distributed test architectures
A linear-time algorithm to compute a MAD tree of an interval graph
Lengths of words accepted by nondeterministic finite automata
Impossibility Results for Weak Threshold Networks
Predicative Specifications for Functional Programs Describing Communication Networks
Parallel Multisection for the Determination of the Eigenvalues of Symmetric Quindiagonal Matrices
On the Learnability of Monotone k \mu-DNF Formulae Under Product Distributions
On deterministic rendezvous at a node of agents with arbitrary velocities
Ehrenfeucht-Fraïssé games in finite set theory
The twin domination number in generalized de Bruijn digraphs
Is this network proper forest-based?
Arboricity and Bipartite Subgraph Listing Algorithms
A new lower bound for the number of perfect matchings of line graph
Covering and packing in linear space
Steiner trees in uniformly quasi-bipartite graphs
Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes
Minimum feedback arc set of m-free digraphs
Linear threshold multisecret sharing schemes
Fault tolerancy of continuous Yao graph of angle less than 2 π /5
The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues
P-hardness of the emptiness problem for visibly pushdown languages
New insights on GA-H reduced graphs
Chordal Graph Recognition is in NC
The NP-completeness of the Road Coloring Problem
On Facilities for Interprocess Communication
Restricted rotation distance between binary trees
A Solution Method for the Non-Additive Resource Allocation Problem in Distributed System Design
A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm
A Simple Linear Time Algorithm for the Domatic Partition Problem on Strongly Chordal Graphs
Undecidable problems of decentralized observation and control on regular languages
Scheduling Cyclic Tasks with Binary Periods
Improved reconstruction of RSA private-keys from their fraction
New Statistics for Demand-Based Software Testing
Probability of Shares in Secret Sharing Schemes
On security against the server in designated tester public key encryption with keyword search
Simple algorithms for searching a polygon with flashlights
A note on envy-free cake cutting with polynomial valuations
Integer programming with 2-variable equations and 1-variable inequalities
An Analytical Comparison of Two String Search Algorithms
An Algorithm for Testing Lossless Join Property in Relational Databases
On the hardness of computing span of subcubic graphs
A distributed leader election algorithm in crash-recovery and omissive systems
Improved algorithms for recognizing p
Borders, palindrome prefixes, and square prefixes
Inefficiency of Nash equilibria with parallel processing policy
Exchanged folded crossed cube: A new interconnection network for parallel computation
Miller's Primality Test
Billiard Quorums on the Grid
The complexity of finding temporal separators under waiting time constraints
Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems
Armstrong Databases for Functional and Inclusion Dependencies
A self-stabilizing algorithm for optimally efficient sets in graphs
A Note on Medium Selection and Spider Production
On Learning from Queries and Counterexamples in the Presence of Noise
Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer