yusuke1997/dblp-id-title huggingface dataset:
Finding Pattern Matchings for Permutations
An Improved Algorithm for Hierarchical Clustering Using Strong Components
Combining local and global information for product feature extraction in opinion documents
A faster algorithm for the cluster editing problem on proper interval graphs
Finding Approximate Solutions to NP-Hard Problems by Neural Networks is Hard
A remark on the complexity of consistent conjunctive query answering under primary key violations
A Generalization of Dijkstra's Algorithm
A Predicate Transformer for Progress
Parallel Priority Queues
A note on the approximation of mean-payoff games
Minimum projective linearizations of trees in linear time
Selection of a Large Sum-Free Subset in Polynomial Time
Finding the cyclic covers of a string
Data Structures in a Real-Time Environment
Rationality of Division Orderings
NP-hardness of geometric set cover and hitting set with rectangles containing a common point
Finitely Generated (Omega)o-Languages
Irrelevant updates and self-maintainability in transitive closure database views
Managed Agreement: Generalizing two fundamental distributed agreement problems
How to Detect Tampering of Data
Complexity of atoms, combinatorially
Marking shortest paths on pushdown graphs does not preserve MSO decidability
A note on binary sequence pairs with two-level correlation
Insertion Merge Sorting
Binary space partitions for axis-parallel line segments: Size-height tradeoffs
Some Observations Concerning Alternating Turing Machines Using Small Space
Threshold changeable secret sharing with secure secret reconstruction
Optimal randomized algorithm for a generalized ski-rental with interest rate
Impossibility of gathering, a certification
Optimization of LR(k) "Reduced Parsers"
lambda_beta' - A - lambda-Calculus with a Generalized beta-Reduction Rule
Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons
Fairness and Conspiracies
A note: Minimizing maximum earliness on a proportionate flowshop
Inefficiency analysis of the scheduling game on limited identical machines with activation costs
Segment representations with small resolution
Processor-Efficient Exponentiation in Finite Fields
VLSI Design With Multiple Active Layers
An Experimental Investigation of Geschke's Method of Global Program Optimization
A note on multiparty communication complexity and the Hales-Jewett theorem
X-code double parity array operation with two disk failures
Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays
Robust scheduling for minimizing maximum lateness on a serial-batch processing machine
On Selecting the k Largest with Restricted Quadratic Queries
A Study on Interleaving Versus Segmentation
Algorithms for Conversion of Minterms to Positive Polarity Reed-Muller Coefficients and Vice Versa
Exploring the optimality of byte-wise permutations of a piccolo-type block cipher
The incremental agreement
Efficient algorithm for the vertex connectivity of trapezoid graphs
A note on the minimum label spanning tree
Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
Optimal computation of the Voronoi diagram of disjoint clusters
A CKY parser for picture grammars
A Note on the Sufficiency of Sokolowski's Criterion for Context-Free Languages
Reducing Conflict Resolution Time for Solving Graph Problems in Broadcast Communications
Extended KCI attack against two-party key establishment protocols
The Complexity of Finding Arborescences in Hypergraphs
A New Computation Rule for Prolog
Incremental construction of coverability graphs
A Unified Approch for Showing Language Inclusion and Equivalence Between Various Types of omega-Automata
An Algebraic Algorithm to Compute the Exact General Sweep Boundary of a 2D Curved Object
A Structure Theorem for Maximum Internal Matchings in Graphs
Corrigendum to "On the complexity of co-secure dominating set problem" [Inf. Process. Lett. 185 (2024) 106463]
The complexity of the vertex-minor problem
A Faster Algorithm for Finding Edge-Disjoint Branchings
Simplified tight analysis of Johnson's algorithm
On optimal bridges between two convex regions
A Simplified Proof That Regular Resolution is Exponential
Short vectors of planar lattices via continued fractions
On the Index of Positive Programmed Formal Languages
Unifiability is Complete for co-NLogSpace
The Pagenumber of the Class of Bandwidth-k Graphs is k-1
Macro forest transducers
Probabilistic opacity for Markov decision processes
A lower bound on the size of resolution proofs of the Ramsey theorem
A Note on Scheduling Multiprocessor Tasks with Precedence Constraints on Parallel Processors
SAR image segmentation based on quantum-inspired multiobjective evolutionary clustering algorithm
On the dynamic extent of delimited continuations
An improved algorithm for the maximum agreement subtree problem
A characterization of Büchi tree automata
Clique polynomials have a unique root of smallest modulus
A More Efficient Convex Hull Algorithm
Average-Case Analysis of Robinson's Unification Algorithm with Two Different Variables
A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem
A fast algorithm for computing a longest common increasing subsequence
An Optimal Greedy Heuristic to Color Interval Graphs
Decomposable Searching Problems
Infinite Cube-Connected Cycles
Partial Sum Problem Mapping Into a Hypercube
The hamiltonicity of generalized honeycomb torus networks
Variationally universal hashing
Reconstruct versus read-modify writes in RAID
A Non-SOS Operational Semantics for a Process Algebra
Real-Time Emulations of Bounded-Degree Networks
Approximate Parametric Searching
On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem
Supereulerian digraphs with given local structures
Some Notes on Strong and Weak log log n Space Complexity
Linear-Size Constant-Depth Polylog-Treshold Circuits
The Cyclic Towers of Hanoi
Applicability of Genetic Algorithms to Optimal Evaluation of Path Predicates in Object-Oriented Queries
Minimizing the total weighted completion time of deteriorating jobs
Drawing the Planar Dual
Linear-Time Construction of Treaps and Cartesian Trees
Infinite binary words containing repetitions of odd period
Scalability and the Isomorphism Problem
A Note on a Construction of Margulis
Exploiting independent subformulas: A faster approximation scheme for #k-SAT
A Parallel Circle-Cover Minimization Algorithm
On Coupling and the Approximation of the Permanent
Limitations of Fast Consistency Conditions for Distributed Shared Memories
The reconstruction of polyominoes from their orthogonal projections
Communication Primitives for BSP Computers
On maximum leaf trees and connections to connected maximum cut problems
Refining abstract interpretations
A note on "An optimal online algorithm for single machine scheduling to minimize total general completion time"
Parallel Parsing on the Connection Machine
Generating all maximal models of a Boolean expression
Cyclic Reference Counting with Lazy Mark-Scan
On Pushout Consistency, Modularity and Interpolation for Logical Specifications
A Semantic Approach for Modular Synthesis of VLSI Systems
Average Efficiency of Data Structures for Binary Image Processing
Multitolerant Barrier Synchronization
Model checking conditional CSL for continuous-time Markov chains
Genetic algorithm-based parameter selection approach to single image defogging
A gradient descent rule for spiking neurons emitting multiple spikes
On the Greedy Algorithm for Satisfiability
Strong Normalization for Non-Structural Subtyping via Saturated Sets
A short note on the lower bound of dilation for O(log n )-label interval routing
On the Nonexistence of Resilient Consensus Protocols
An Architecture for Symbolic Processing
The super connectivity of exchanged crossed cube
Simple Linear Time Recognition of Unit Interval Graphs
Efficient Multiway Radix Search Trees
Optimal cuts and partitions in tree metrics in polynomial time
Tables of Large Graphs with Given Degree and Diameter
Safe Procedural Implementations of Algebraic Types
A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space
The optimal routing of augmented cubes
Improved Behaviour of Tries by Adaptive Branching
Experiments with Trees of the Storage and Retrieval of Future Events
On the largest convex subsets in Minkowski sums
Predictability of Fixed-Job Priority schedulers on heterogeneous multiprocessor real-time systems
Edge-pancyclicity of Möbius cubes
Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's
NC Algorithms for the Single Most Vital Edge Problem with Respect to Shortest Path
Software-Controlled Cache Coherence Protocol for Multicache Systems
Study of Self-Organizing Heuristics for Skewed Access Patterns
Online knapsack with resource augmentation
Efficient geometric measure of music similarity
Nonisomorphic Graphs with the Same T-Polynomial
Defining Liveness
A necessary condition for Constructive Negation in Constraint Logic Programming
Lower bounds on precedence-constrained scheduling for parallel processors
Concurrent File Access Under Unpredictability
No-wait scheduling in single-hop multi-channel LANs
An On-Line String Superprimitivity Test
On the greatest solution of equations in CLL R
Maximum-weight planar boxes in O(n 2 ) time (and better)
Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences
A refined analysis on the jump number problem of interval orders
A Linear Time Algorithm for Finding all Hinge Vertices of a Permutation Graph
An efficient method for computing dynamic program slices
Constructing Full Spanning Trees for Cubic Graphs
A Refinement of Replacement Selection
Power attacks on a side-channel resistant elliptic curve implementation
Greedy can beat pure dynamic programming
Simplified Chernoff bounds with powers-of-two probabilities
New efficiency results for makespan cost sharing
Monochromatic plane matchings in bicolored point set
Counting Trees in a Graph is #P-Complete
AKF: A key alternating Feistel scheme for lightweight cipher designs
Reducing the diameter of a unit disk graph via node addition
Hamiltonian decomposition of generalized recursive circulant graphs
A fast algorithm for computing large Fibonacci numbers
A generalization of the 0-1 principle for sorting
A linear-time algorithm for Euclidean feature transform sets
Erratum: Evading the Drift in Floating-Point Addition
On the probability of overlap of random subsequences of pseudorandom number generators
Asymptotic Evaluation of Window Visibility
The autocorrelation of a class of quaternary sequences of length pq with high complexity
Impossible futures and determinism
Implementation of a Wait-Free Synchronization Primitive that Solves n-Process Consensus
An Improvement to Immediate Error Detection in Strong LL(1) Parsers
The Expected Length of a Shortest Path
The fixed initial credit problem for partial-observation energy games is Ack-complete
A Lower Bound for the Edit-Distance Problem Under an Arbitrary Cost Function
On the Probabilistic Performance of Algorithms for the Satisfiability Problem
Intractability of min- and max-cut in streaming graphs
Membership(s) and compliance(s) with class-based graphs
Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality
A Generalized Model for Understanding Evasiveness
Algorithms for transitive closure
Can an operation both update the state and return a meaningful value in the asynchronous PRAM model?
A Simple Deduction Method for Modal Logic
The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs
Degree Constrained Tree Embedding Into Points in the Plane
"V-Tape", A Virtual Memory Oriented Data Type, and its Resource Requirements
Inefficiencies in network models: A graph-theoretic perspective
Erratum: Recognizing Strict 2-Threshold Graphs in O(m) Time
Combining the requirement information for software defect estimation in design time
Spectral characterization of cryptographic Boolean functions satisfying the (extended) propagation criterion of degree l and order k
Efficient Dynamic Range Searching Using Data Replication
How to Prove Representation-Independent Independence Results
On Computing Representatives
Counting the number of vertex covers in a trapezoid graph
A note on asynchronous multi-exponentiation algorithm using binary representation
Quick encoding of plane graphs in log 2 14 bits per edge
A Note on Lower Bounds for Rectilinear Steiner Trees
A Note on Presburger Arithmetic with Array Segments, Permutation and Equality
A Set of Combinators for Abstraction in Linear Space
Strong Menger connectivity with conditional faults on the class of hypercube-like networks
Erratum and addendum to "A linear time algorithm for finding all hinge vertices of a permutation graph" [Information Processing Letters 59 (2) (1996) 103-107]
Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees
Isometric-path numbers of block graphs
A purely model-theoretic proof of the exponential succinctness gap between CTL + and CTL
Minimum cost subpartitions in graphs
The Readers and Writers Problem Avoided
Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors
t-Wise independence with local dependencies
TrCBC: Another look at CBC-MAC
Improved lower bound for differentially private facility location
Low complexity bit parallel multiplier for GF(2 m ) generated by equally-spaced trinomials
Noncommutative Minimization Algorithms
The linked list representation of n LIFO-stacks and/or FIFO-queues in the single-level memory
An enhanced recursive frequency splitting broadcasting algorithm for near video-on-demand services
A Note on Bitonic Sorting
Some Proofs of Data Refinement
On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles
An Active Attack on Protocols for Server-Aided RSA Signature Computation
Line graph operation and small worlds
Cluster deletion revisited
Routing with congestion in acyclic digraphs
Improving on-line construction of two-dimensional suffix trees for square matrices
On Transformations of Algorithms to Multiply 2*2 Matrices
Does co-NP Have Short Interactive Proofs?
A Simple Randomized Parallel Algorithm for List-Ranking
Computing Multivariate Polynomials in Parallel
An Exponential Lower Bound for the Pure Literal Rule
Combinatorial algorithms for feedback problems in directed graphs
An Algorithm to Generate the Basis of Solutions to Homogeneous Linear Diophantine Equations
The reverse greedy algorithm for the metric k -median problem
Good self-dual generalized quasi-cyclic codes exist
A SAT-based preimage analysis of reduced Keccak hash functions
Bottleneck flows in unit capacity networks
A Modified Tree-to-Tree Correction Problem
A note on the relation between XOR and Selective XOR lemmas
A Note on the Token Distribution Problem
A Note on Finitely Ambiguous Distance Automata
Packet loss probability for DiffServ over IP and MPLS reliable homogeneous multicast networks
Decoding Residue Codes
A Proof of the Determinacy Property of the Data Flow Schema
Universal Traversal Sequences of Length n^O(log n) for Cliques
The VLSI Optimality of the AKS Sorting Network
Bottleneck bichromatic full Steiner trees
Very Fast and Simple Approximate String Matching
An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems
Inclusion-exclusion for k-CNF formulas
An aggressive algorithm for multiple string matching
How much can lookahead help in online single machine scheduling
Balanced Allocations for Tree-Like Inputs
Further Comments on the Subtree Isomorphism for Ordered Trees
The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations
A Fast Algorithm for Copying Binary Trees
A single-point mutation evolutionary programming
On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages
A Classification of Extensible Programming Languages
Approximating minimum coloring and maximum independent set in dotted interval graphs
On Slicing of K-Iteration Grammars
Drawing Polygons Given Angle Sequences
A Tight Lower Bound for the Best-alpha Algorithm
An Existence Lemma for Canonical Forms in Symbolic Mathematics
Complexity of the Closest Vector Problem in a Lattice Generated by (0, 1)-Matrix
Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time
Online inventory replenishment scheduling of temporary orders
Computing the permanent modulo a prime power
Logics and Decidability for Labelled Pre- and Partially Ordered Kripke Structures
Arithmetical Axiomatization of First-Order Temporal Logic
Structured programming: A minor part of software engineering
Hashiwokakero is NP-complete
An O(log m) Parallel Algorithm for the Minimum Spanning Tree Problem
On the approximability of minmax (regret) network optimization problems
Cancellation Rules and Extended Word Problems
A Polynomial Characterization of Some Graph Partitioning Problems
On the number of spanning trees of a multi-complete/star related graph
A note on Rooted Survivable Networks
Verifying lossy channel systems has nonprimitive recursive complexity
Logarithmic Width, Linear Area Upward Drawing of AVL Trees
A Short Certificate of the Number of Universal Optimal Strategies for Stopping Simple Stochastic Games
A Note on SpanP Functions
Embedding meshes/tori in faulty crossed cubes
Linear-time algorithms for problems on planar graphs with fixed disk dimension
Pop-Stacks in Parallel
A decidable characterization of the classes between lintime and exptime
On the Complexity of Computing Gröbner Bases in Characteristic 2
On mimicking networks representing minimum terminal cuts
Local correction of juntas
The burst factor and its impact on buffer performance
A Parallel Parsing Algorithm for Arbitrary Context-Free Grammars
A Learning-Theoretic Characterization of Classes of Recursive Functions
A Note on Approximate Linear Programming
The diagnosability and 1-good-neighbor conditional diagnosability of hypercubes with missing links and broken-down nodes
Optimal real-time garbage collection for acyclic pointer structures
Joint object placement and node dimensioning for Internet content distribution
A Correction to a Unilaterally Connected Components Algorithm
On Average Time Hierarchies
Using postdomination to reduce space requirements of data flow analysis
Solving the Hamiltonian cycle problem via an artificial neural network
Isomorphism for random k -uniform hypergraphs
An Optimal Lower Bound for Nonregular Languages
Odd-Even Sort in Powerlists
E-passport EAC scheme based on Identity-Based Cryptography
A Data Structure for Bicategories, with Application to Speeding up an Approximation Algorithm
CAPTCHA-based image annotation
Testing consistency of quartet topologies: a parameterized approach
The Decidability of Persistence for Vector Addition Systems
The complexity of two supply chain scheduling problems
Minimizing interference in ad hoc networks with bounded communication radius
On a Relation Between Algebraic Programs and Turing Machines
HCB-Tree: A Height Compressed B-Tree for Parallel Processing
Notes on vertex pancyclicity of graphs
A Parallel Merging Algorithm
Mathematical Solution for a Data Processing System
Practical forgeries for ORANGE
Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables
Conditional fault Hamiltonicity of the complete graph
Multiresource Malleable Task Scheduling to Minimize Response Time
On Relations Between Intervals
A Distributed Deadlock Detection Algorithm: Distributed Graph Reconstruction Algorithm
Faster algorithm for optimum Steiner trees
The Pair Completion algorithm for the Homogeneous Set Sandwich Problem
Strict Majority Bootstrap Percolation in the r-wheel
Fault-tolerant pancyclicity of augmented cubes
Common intervals of trees
Parallel Maximum Independent Set in Convex Bipartite Graphs
Computing all large sums-of-pairs in R n and the discrete planar two-watchtower problem
Semantics-Directed Compilation of Nonlinear Patterns
Improved analysis of the greedy algorithm for stochastic matching
On an on-line scheduling problem for parallel jobs
A Note on the Expected Time Required to Construct the Outer Layer
On the complexity of co-secure dominating set problem
Online scheduling of unit jobs on three machines with rejection: A tight result
Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
Limits of a conjecture on a leakage-resilient cryptosystem
Some Characterizations of Finitely Specifiable Implicational Dependency Families
On the Euclidean TSP with a permuted Van der Veen matrix
On-line scheduling with extendable working time on a small number of machines
Collisionful Keyed Hash Functions with Selectable Collisions
A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation
Inequalities on submodular functions via term rewriting
Directed Maximal-Cut Problems
A Fast Sorting Algorithm, a Hybrid of Distributive and Merge Sorting
Some new maximum VC classes
Continuous-time orbit problems are decidable in polynomial-time
A Model of Reconfiguration in Communicating Sequential Processes
Reducing the blocking in two-phase commit with backup sites
Planar straight-line point-set embedding of trees with partial embeddings
Improved efficiency of Kiltz07-KEM
A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search
A Characterization of Systems Derived From Terminating Concurrent Histories
Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures
Password Authentication Without Using a Password Table
On Polygon Similarity
Minimal 2-connected graphs satisfying the even cut condition
A rely-guarantee discipline for open distributed systems design
Geometric separability using orthogonal objects
Cycles passing through prescribed edges in a hypercube with some faulty edges
A Note on the Computational Complexity of the Pure Classical Implication Calculus
An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity
Efficient Deduction in Equality Horn Logic by Horn-Completion
A Very Simple Construction of 1-Writer Multireader Multivalued Atomic Variable
Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker
On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram
Broadcast using certified propagation algorithm in presence of Byzantine faults
Scheduling Independent 2-Processor Tasks to Minimize Schedule Length
Application of the Special Latin Square to a Parallel Routing Algorithm on a Recursive Circulant Network
A Faster Parallel Algorithm for k-Connectivity
On conditions for the liveness of weakly persistent nets
Batch Sizes for the Batching Method of Colouring Planar Maps
A Simple Proof of a Simple Consensus Algorithm
Coloring chip configurations on graphs and digraphs
Counter abstraction for regular open teams
Fast arithmetics using Chinese remaindering
A Note on Alternating On-Line Turing Machines
A uniform framework for term and graph rewriting applied to combined systems
Finding Maximum Cliques on Circular-Arc Graphs
A compact data structure for representing a dynamic multiset
Visibility representation of plane graphs via canonical ordering tree ,
A Unifying Framework for Trie Design Heuristics
Multiple Cuts, Input Repetition, and VLSI Complexity
Properties of enhanced mobile membranes via coloured Petri nets
On the Maximum Edge Length in VLSI Layouts of Complete Binary Trees
Vertex-connectivity for node failure identification in Boolean Network Tomography
Evaluation of permanents in rings and semirings
On-line algorithms for 2-space bounded 2-dimensional bin packing
Some bounds on the generalised total chromatic number of degenerate graphs
Selection of Good Algorithms from a Family of Algorithms for Polynomial Derivative Evaluation
On the conjecture of vertex-transitivity of DCell
Some Properties of Commutation in Free Partially Commutative Monoids
On-line scheduling of equal-length intervals on parallel machines
An Efficient Implementation of Vector Clocks
On the Union of 0L Languages
Optimal Use of Storage in a Simple Model of Garbage Collection