yusuke1997/dblp-id-title huggingface dataset:
Reliability of wireless sensors with code attestation for intrusion detection
A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds
Approximation algorithms for maximum independent set of a unit disk graph
A Neural Sorting Network with O(1) Time Complexity
Algorithms of Placing Recovery Points
Finding Hamiltonian Circuits in Proper Interval Graphs
Rectangular Partition is Polynomial in Two Dimensions but NP-Complete in Three
Incremental learning of approximations from positive data
A Tight Lower Bound for the Train Reversal Problem
Rudimentary Reductions Revisited
Efficient implementation of the Galois Counter Mode using a carry-less multiplier and a fast reduction algorithm
An asymptotically tight online algorithm for m -Steiner Traveling Salesman Problem
A compress slide attack on the full GOST block cipher
Fast and simple algorithms to count the number of vertex covers in an interval graph
Zooming by Repeated Range Detection
A Note on Time-Space Tradeoffs for Computing Continuous Functions
Circuit Depth Relative to a Random Oracle
Stream Cipher Encryption of Random Access Files
An improvement of the tree code construction
Some notes on bounded starwidth graphs
On Verifying that a Concurrent Program Satisfies a Nondeterministic Specification
A Halving Technique for the Longest Stuttering Subsequence Problem
An Information-Theoretic Lower Bound for the Longest Common Subsequence Problem
Max-optimal and sum-optimal labelings of graphs
On the complexity of tree pattern containment with arithmetic comparisons
A Quorum Based k -Mutual Exclusion by Weighted k -Quorum Systems
Improved improbable differential attacks on ISO standard CLEFIA: Expansion technique revisited
A Modified Branch-and-Bound Strategy
On the Computability of Circumscription
Exponential separation between Res( k ) and Res( k +1) for k leq varepsilonlog n
Pancyclic out-arcs of a vertex in oriented graphs
On the Performance Guarantee of Neural Networks for NP-Hard Optimization Problems
An Algorithm for Load Balancing in Multiprocessor Systems
Performance guarantees for the TSP with a parameterized triangle inequality
Multiple Total Stable Models are Definitely Needed to Solve Unique Solution Problems
A Limit Theorem for Sets of Subwords in Deterministic T0L Languages
A subset-sum type formulation of a two-agent single-machine scheduling problem
A correspondence between type checking via reduction and type checking via evaluation
Worst-Case Performance of Rayward-Smith's Steiner Tree Heuristic
A note on optimal covering augmentation for graphic polymatroids
Transistion Systems from Event Structures Revisited
Improved upper bounds on synchronizing nondeterministic automata
A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem
Infinite Lyndon Words
Two strings at Hamming distance 1 cannot be both quasiperiodic
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to {k}-sparse graphs
In-Place Random List Permutations
On a Compaction Theorem of Ragde
Some Principles for Dynamizing Decomposable Searching Problems
Scheduling on parallel identical machines with job-rejection and position-dependent processing times
On proving C E -termination of rewriting by size-change termination
Linear templates of ACTL formulas with an application to SAT-based verification
Order-k α-hulls and α-shapes
Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design
The greedy algorithm for edit distance with moves
Some Improved Bounds on the Number of 1-Factors of n-Connected Graphs
A note on finding minimum mean cycle
On the isomorphism of expressions
Cryptanalysis of RSA with two decryption exponents
Finding optimal paths in MREP routing
Crossvalidation: Minimizing the Entropy of the Future
Dynamic planar range skyline queries in log logarithmic expected time
Limits for Automatic Verification of Finite-State Concurrent Systems
Another Solution of the Mutual Exclusion Problem
Square reflection cryptanalysis of 5-round Feistel networks with permutations
Learning-augmented maximum flow
Physical Parallel Devices are not Much Faster than Sequential Ones
Upper bounds for minimum dilation triangulation in two special cases
A Note on Post's Correspondence Problem
Random Access Machines with Multi-Dimensional Memories
Anonymous graph exploration without collision by mobile robots
On the General Classification of Nonlinear Filters of m -Sequences
Finding the Convex Hull of a Sorted Point Set in Parallel
An n 1.618 Lower Bound on the Time to Simulate One Queue or Two Pushdown Stores by One Tape
Efficient Implementation of the Ada Overloading Rules
Construction of Aho Corasick automaton in linear time for integer alphabets
Union and intersection types to support both dynamic and static typing
Real Addition and the Polynomial Hierarchy
Multi-hop all-to-all optical routings in Cartesian product networks
Generating Hinges from Arbitrary Subhypergraphs
QoS based resource scheduling by computational economy in computational grid
An Implementation of Mutual Inclusion
Pairs of majority-decomposing functions
On the Complexity of the Extreme Points Decision Problem
A k-server problem with parallel requests and unit distances
Corrigenda: Common Intersections of Polygons
Unique Horn Renaming an Unique 2-Satisfiability
On the cryptanalysis of the hash function Fugue: Partitioning and inside-out distinguishers
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
On Finding the Strongly Connected Components in a Directed Graph
Solving SCS for bounded length strings in fewer than 2 n steps
A Clarification of the Comparison Between Some Measures of Software Science
An Algorithm for Finding All Shortest Paths Using N^(2.81) Infinite-Precision Multiplications
Some Negative Results Concerning DPDA's
An Approximation Result for a Duo-Processor Task Scheduling Problem
Computing the cycles in the perfect shuffle permutation
A Note on the Horton-Strahler Number for Random Trees
Self-Adjusting Multi-Way Search Trees
Split Sequence Hash Search
Managing the granularity of constraint-based analyses by rule transformation
Contracting bipartite graphs to paths and cycles
Translation of Turner Combinators in O(n log n) Space
On the Subword Complexity of D0L Languages with a Constant Distribution
Un-Skolemizing Clause Sets
A scalable Web cache sharing scheme
An Effecient Parallel Sorting Algorithm
A Note on the Ádám Conjecture for Double Loops
On maximal repetitions of arbitrary exponent
On confluence and residuals in Cauchy convergent transfinite rewriting
An Exact Analysis on Expected Seeks in Shadowed Disks
On the Approximation Hardness of Dense TSP and Other Path Problems
Some Observations on the Determination of an Upper Bound for the Clique Number of a Graph
Total coloring of rooted path graphs
Towards a Formal Proof System for omega-Rational Expressions
Multiprocessor Interconnection Network Using Pairwise Balanced Combinatorial Designs
An algebraic attack on the improved summation generator with 2-bit memory
A Note on the Queens' Problem
A pre-test for factoring bivariate polynomials with coefficients in F 2
Comparison of Signature File Models with Superimposed Coding
Who wants a computer to be a millionaire?
Enumerating k-Way Trees
Polynomial-time local-improvement algorithm for Consecutive Block Minimization
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities
An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
A risk-reward model for the on-line leasing of depreciable equipment
Reduced checking sequences using unreliable reset
Trading uninitialized space for time
Finding minimum 3-way cuts in hypergraphs
On approximate pattern matching with thresholds
Approximating minimum cocolorings
Finding Lowest Common Ancestors in Arbitrarily Directed Trees
A note on maximizing the spread of influence in social networks
On-The-Fly Analysis of Distributed Computations
An optimal layout of multigrid networks
Storing Matrices on Disk for Efficient Row and Column Retrieval
On the construction of all shortest node-disjoint paths in star networks
A note on the Chen-Morrissey-Smart DAA scheme
Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm
On the Determinacy Problem for Two-Way Pushdown Automata
Key recovery attacks on reduced-round Joltik-BC in the single-key setting
On the maximum acyclic subgraph problem under disjunctive constraints
Fitness levels with tail bounds for the analysis of randomized search heuristics
An Efficient Functional Implementation of FIFO Queues
Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs
On security analysis of an after-the-fact leakage resilient key exchange protocol
Recognizing Shortest-Path Trees in Linear Time
A note on robustness tolerances for combinatorial optimization problems
Algebraic properties of the shuffle over omega-trajectories
Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited
The Log-Rank Conjecture and low degree polynomials
An Algorithm for Testing Chordality of Graphs
Computability versus exact computability of martingales
Approximate swapped matching
Formal language identification: query learning vs. Gold-style learning
Generalized honeycomb torus is Hamiltonian
Horner's Rule and the Computation of Linear Recurrences
A note on a single machine scheduling problem with generalized total tardiness objective function
Fair service for mice in the presence of elephants
Diagnosable evaluation of enhanced optical transpose interconnection system networks
A Linear Applicative Solution for the Set Union Problem
A New Algorithm for Rectangle Enclosure Reporting
On query result integrity over encrypted data
Codes, Simplifying Words, and Open Set Condition
A Fast Algorithm for Stereo Matching
On finding spanning trees with few leaves
A Linear Time Algorithm for Finding Depth-First Spanning Trees on Trapezoid Graphs
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
Comments on 'Error Resynchronisation in Producer Consumer Systems'
Testing the Universal Instance Assumption
A note on the distribution of the number of prime factors of the integers
The Tree-to-Tree Editing Problem
Sorting Permutations by Block-Interchanges
On the non-efficient PAC learnability of conjunctive queries
On the Equal-Subset-Sum Problem
An Efficient Algorithm for Deciding Quadratic Residuosity in Finite Fields GF(p_m)
A degree condition for fractional [ a , b ]-covered graphs
Maximum vertex occupation time and inert fugitive: Recontamination does help
Process algebra and conditional composition
A revised result on chasing tree patterns under schema graphs
Analysis of Range Searches in Quad Trees
Online malleable job scheduling for m<=3
Dispersed particle swarm optimization
A Fast Algorithm for Finding the Compact Sets
A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree
Dicing on the Streett
A note on one-space bounded square packing
A Randomized Algorithm for Finding Maximum with O((log n)²) Polynomial Tests
On the Subword Complexity of m-Free D0L Languages
A Simple Algorithm for Computing the Smallest Enclosing Circle
Corrigendum: A Simple Proof of a Completeness Result for Leads-To in the UNITY Logic
A note on some collapse results of valued constraints
A Note on Bottom-Up Pyramid Acceptors
A simple and improved parameterized algorithm for bicluster editing
Towards an Understanding of Unbounded Variables in Asynchronous Systems
Improved algorithms for left factorial residues
From a simple elimination ordering to a strong elimination ordering in linear time
Relations between semantic security and anonymity in identity-based encryption
On computing the optimal bridge between two convex polygons
Simple and efficient floor-planning
The common prefix problem on trees
Connectivity of Plane Triangulations
A Parallel Tree Difference Algorithm
Efficient Implementations of Square-root Vélu's Formulas
A Data-Parallel Algorithm for Minimum-Width Tree Layout
Non-depth-first search against independent distributions on an AND-OR tree
Perfect Code is W[1]-complete
On a Triangle Counting Problem
Heuristics for Partial-Match Retrieval Data Base Design
A Space Efficient Distributive Sort
A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption
A No Free Lunch theorem for multi-objective optimization
On the equivalence and range of applicability of graph-based representations of logic programs
Smallest k -point enclosing rectangle and square of arbitrary orientation
τ-Bisimulations and Full Abstraction for Refinement of Actions
ANSV Problem on BSRs
A Note on Binomial Recurrences Arising in the Analysis of Algorithms
On approximating planar metrics by tree metrics
Election in a Complete Network with a Sense of Direction
A Truncation Technique for Clausal Analytic Tableaux
Search audio data with the wavelet pyramidal algorithm
Simple Computation of LALR(1) Lookahead Sets
An Optimum Theta (n log n) Algorithm for Finding a Canonical Hamiltonian Path and a Canonical Hamiltonian Circuit in a Set of Intervals
On a Setup Optimization Problem for Interval Orders
Complexity Versus Stability for Classes of Propositional Formulas
Sequential Calculus
New bounds on antipowers in words
On the desirability of mechanizing calculational proofs
Connected Domination and Steiner Set on Weighted Permutation Graphs
One More Polynomial Complete Consecutive Retrieval Problem
The (non-)existence of perfect codes in Fibonacci cubes
Applying the Positional Burrows-Wheeler Transform to all-pairs Hamming distance
Nesting of Shuffle Closure is Important
On extending de Bruijn sequences
The Towers of Hanoi Revisited: Moving the Rings by Counting the Moves
Error Correction by Mutational Grammars
Fast Hough Transform on a Mesh Connected Processor Array
An incremental linear-time learning algorithm for the Optimum-Path Forest classifier
Lower Bounds for Synchronous Circuits and Planar Circuits
Preimage resistance of LPmkr with r=m-1
Ensuring the Existence of a BCNF-Decomposition that Preserves Functional Dependencies in O(N²) Time
Repetitions, Known or Unknown?
Approximating Shortest Lattice Vectors is not Harder than Approximating Closest Lattice Vectors
On a compact encoding of the swap automaton
Autenticated Encryption Schemes with Message Linkage
Decidability of the consistency problem for regular symbolic picture description languages
Efficient structural joins with clustered extents
Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs
On Cahit's Result on Graceful Permutations
The Equivalence of Vector Addition Systems to a Subclass of Post Canonical Systems
An Alternative Way to Represent the Cogroup of a Relation in the Context of Nested Databases
A Note on the Expected Path Length of Trees with Known Fringe
Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N)
A note on distance-preserving graph sparsification
Perfect codes in direct graph bundles
Alphabetic coding with exponential costs
Scalable real-time monitoring system for ubiquitous smart space
Lower bounds on online deadline scheduling with preemption penalties
Dynamic Shannon coding
Direct Proofs of the Undecidability of the Equivalence Problem for Sentential Forms of Linear Context-Free Grammars and the Equivalence Problem for 0L Systems
Distributed similarity search algorithm in distributed heterogeneous multimedia databases
Non-uniform packings
On the connectivity threshold for general uniform metric spaces
The k-center problem of uncertain points on graphs
The Boundedness Problem for Three-Dimensional Vector Addition Systems with States
Catalan and Schröder permutations sortable by two restricted stacks
The impact of overload conditions on computer network reliability
Real-Time Queue Operation in Pure LISP
Probabilistic weak simulation is decidable in polynomial time
Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines
The connectivity of generalized graph products
Three Results of Comparison Between L Languages with and without Interaction
A new birthday-type algorithm for attacking the fresh re-keying countermeasure
A note on constructing binary heaps with periodic networks
A New SLDNF-Tree
A Simple Approach for Generating RSA Keys
Path partitions of hypercubes
Fast One's-Complement Multiplication
An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings
Improved Processor Bounds for Parallel Algorithms for Weighted Directed Graphs
A Recursive Algorithm to Generate Joint Probability Distribution of Arrivals from Exponential Sources During a Random Time Interval
Coffman-Graham Scheduling of UET Task Systems with 0-1 Resources
What is a free name in a process algebra?
An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow
Polychromatic 4-coloring of guillotine subdivisions
On Termination of the Direct Sum of Term-Rewriting Systems
In-place permuting and perfect shuffling using involutions
An Inheritance Flow Model for Class Hierarchy Analysis
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Linear-time algorithms for counting independent sets in bipartite permutation graphs
Online deadline scheduling on faster machines
A self-stabilizing enumeration algorithm
Data filtering based least squares iterative algorithm for parameter identification of output error autoregressive systems
On Max-Flow Min-Cut and Integral Flow Properties for Multicommodity Flows in Directed Networks
Optimal distortion embedding of complete binary trees into lines
Capturing crossings: Convex hulls of segment and plane intersections
The Incompleteness of Misra and Chandy's Proof Systems
A LISP Programming Exercise
An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite Automata
A short note on "Proportionate flowshops with general position-dependent processing times"
Euclidean TSP between two nested convex obstacles
Deciding Freeness for Program Schemes with a Single Unary Function
On the antisymmetry of Galois embeddings
Sharing Special Purpose Resources in a Multiprocessor Environment
Timed automata and additive clock constraints
On building minimal automaton for subset matching queries
On Similarity of Polynomial Configurations
Some remarks on distributed depth-first search
Nonconstructive Advances in Polynomial-Time Complexity
A note on the use of determinant for proving lower bounds on the size of linear circuits
Prefixes of Infinite Words and Ambiguous Context-Free Languages
Lower bounds on the complexity of recognizing SAT by Turing machines
Background feature clustering and its application to social text
Steiner connectivity problems in hypergraphs
An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
Counting distinct palindromes in a word in linear time
An O(N) Algorithm for Finding Periodicity of a Sequence Using Hash Coding
Isomorphism Testing of k-Trees is in NC, for Fixed k
Cycle Detection in Critical Path Networks
A Linear-Time Algorithm for Solving the Center Problem on Weighted Cactus Graphs
Message Complexity of the Set Intersection Problem
Improved Lower Bounds for Some Matrix Multiplication Problems
A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph
The pessimistic diagnosability of data center networks
On Universal Learning Algorithms
Enclosures: An Access Control Mechanism with Applications in Parallel Programming and Other Areas of System Programming
An Interesting Way to Partition a Number
A Positive Relativization of Polynomial Time Versus Polylog Space
Variable Abstraction in O(n log n) Space
A Note on Decision Problems for Three-Way Two-Dimensional Finite Automata
There are no Fully Space Constructible Functions Between log log n and log n
Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits
Space-efficient FCFS group mutual exclusion
Erratum to: "A note on monotone complexity and the rank of matrices": [Information Processing Letters 87 (2003) 321-326]
Diversity and fault avoidance for dependable replication systems
An algebraic characterization of independence of Petri net processes
Fast Inversion of Hankel and Toeplitz Matrices
Capacitated domination faster than O ( n 2 )
Approximability and hardness of geometric hitting set with axis-parallel rectangles
Proving Correctness with Respect to Nondeterministic Safety Specifications
A Note on Uniformly Limited ETOL Systems with Unique Interpretation
A constant approximation algorithm for the densest k
Corrigendum: Semantics of a Declarative Language
Special issue on Economics and Computation
Learning Convex Bodies under Uniform Distribution
Robbins and Ardila meet Berstel
Undecidability of accordance for open systems with unbounded message queues
Even faster parameterized cluster deletion and cluster editing
A New Data Structure for Shortest Path Queries in a Simple Polygon
Rank-r Decision Trees are a Subclass of r-Decision Lists
Approximation algorithm for sweep coverage on graph
Complexity of Finding k-Path-Free Dominating Sets in Graphs
On planar path transformation
Mu-calculus path checking
On the Impact of Sense of Direction on Message Complexity
On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams
Mesosome avoidance
Bases for Boolean co-clones
List Scheduling Bounds for UET Systems With Resources
Finding Large Holes
Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees
Branching Bisimilarity is an Equivalence Indeed!
Stabilizing mobile philosophers
A Distributed Algorithm for Distributed Termination
A simplified way of proving trade-off results for resolution
Closed form bounds for clock synchronization under simple uncertainty assumptions
Small polyomino packing
A note on sparse least-squares regression
Positive Boolean Dependencies
Convergence of best-response dynamics in games with conflicting congestion effects
Non-deterministic transducer models of retransmission protocols over noisy channels
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
Weak and Strong One-Way Space Complexity Classes
Edge-fault-tolerant vertex-pancyclicity of augmented cubes
On fractional (f, n)-critical graphs
The domination number of exchanged hypercubes
Strongly polynomial efficient approximation scheme for segmentation
On the Centers of the Set of Weakly Square-Free Words on a Two Letter Alphabet
A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability
Approximation Results for the Minimum Graph Coloring Problem
Faster Implementation of a Shortest Superstring Approximation
A Note on the Complexity of a Partition Algorithm
Self-Stabilization (in Spite of Distributed Control) in Tree-Structured Systems
Signature files and signature trees
The complexity of primal logic with disjunction
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
A New Solution for Thue's Problem
A Constraint-Based Approach to Narrow Search Trees for Satisfiability
A Note on Implementing Parallel Assignment Instructions
Point Representation and Hashing of an Interval
A Tight Lower Bound for Top-Down Skew Heaps
Phrase Structures, Non-Determinism and Backtracking
Dynamic programming algorithms for the mosaic longest common subsequence problem
Self-Organizing Maps for Drawing Large Graphs
On the computational power of linearly transformed BDDs
Faster broadcasting in unknown radio networks
Paired-bacteria optimiser - A simple and fast algorithm
A path-based node filtering method for efficient structural joins ,
Minimum feedback vertex set and acyclic coloring
A note on quantum related-key attacks
Optimal randomized algorithms of weakly-balanced multi-branching AND-OR trees
Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
An Optimization of the Alternating Semantic Evaluator