yusuke1997/dblp-id-title huggingface dataset:
A note on minimizing the sum of quadratic completion times on two identical parallel machines
A better list heuristic for vertex cover
Overlap Closures do not Suffice for Termination of General Term Rewriting Systems
A Note on the Reduction of Two-Way Automata to One-Way Automata
A refined approximation for Euclidean k-means
Another Efficient Algorithm for Convex Hulls in Two Dimensions
The Automatic Synthesis of Iterative Programs
Algorithms and reductions for rewriting problems II
Approximation the Pathwidth of Outerplanar Graphs
String searching with mismatches using AVX2 and AVX-512 instructions
Userrank for item-based collaborative filtering recommendation
Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
Erratum to: "Efficient algorithm for transversal of disjoint convex polygons"
Implementing (Nondeterministic) Parallel Assignments
A Parallel Algorithm for Nearly Optimal Edge Search
Analysis of the Worst Case Space Complexity of a PR Quadtree
Hypercube Permutations Routable Under all Dimension Orderings
Super-connected and super-arc-connected Cartesian product of digraphs
A Fundamental Restriction on Fully Dynamic Maintenance of Bin Packing
Fast Knuth-Bendix Completion with a Term Rewriting System Compiler
A Note on Well Quasi-Orderings for Powersets
A Presentation of the Fibonacci Algorithm
On Random Oracle Separations
Conditional fault hamiltonian connectivity of the complete graph
On the validity of encodings of the synchronous in the asynchronous π -calculus
On the vertex-distinguishing proper edge coloring of composition of complete graph and star
A Hash-Based Join Algorithm for a Cube-Connected Parallel Computer
Mixing time bounds for graphlet random walks
Logical characterization of branching bisimilarity over random processes
A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem
Strictness Analysis Aids Inductive Proofs
Lower Bounds for Constant-Depth Circuits in the Presence of Help Bits
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
An in-place algorithm for Klee's measure problem in two dimensions
Information Streams Sharing a Finite Buffer
The hub number, girth and Mycielski graphs
New Sequential and Parallel Algorithms for Interval Graph Recognition
A Rewriting Technique for Universal Polynomial Invariants
An Almost Perfect Heuristic for the N Nonattacking Queens Problem
Faster deterministic algorithm for Cactus Vertex Deletion
Counter-One-Pass Features in One-Pass Compilation: A Formalization Using Attribute Grammars
An Almost-Constant Round Interactive Zero-Knowledge Proof
Time Bounds on Synchronization in a Periodic Distributed System
A High Availability \sqrt{N} Hierarchical Grid Algorithm for Replicated Data
On the de-randomization of space-bounded approximate counting problems
On the Unimodality of Convex Polygons
Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method
New bounds on D -ary optimal codes
Colored top-K range-aggregate queries
Absorbant of generalized de Bruijn digraphs
Improved approximate common interval
A Note Concerning Top Down Program Development and Restricted Exit Control Structures
Preemptive Scheduling of Independent Jobs with Releas Times and Deadlines on a Hypercube
A simultaneous reduction of several measures of descriptional complexity in scattered context grammars
Real time scheduling with a budget: Parametric-search is better than binary search
Optimal Simulation of Tree Arrays by Linear Arrays
Linear Strategy for Propositional Modal Resolution
On some open problems in monotonic and conservative learning
On a Cycle Finding Algorithm
An improved kernel size for rotation distance in binary trees
Simple computation of st-edge- and st-numberings from ear decompositions
Exact k -NN queries on clustered SVD datasets
Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs
Perfectly Reliable Message Transmission
Approximating weighted neighborhood independent sets
On complementing unambiguous automata and graphs with many cliques and cocliques
The Medians of Discrete Sets
Some undecidable problems for parallel communicating finite automata systems
A note on the method of equal shares
A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
External-memory depth-first search algorithm for solid grid graphs
Level-ordered Q-resolution and tree-like Q-resolution are incomparable
Normal Forms Have Partial Types
An Intermediate-Value Theorem for Optimum Tree Valuation
Singleton and 2-periodic attractors of sign-definite Boolean networks
Realization of an Arbitrary Permutation on a Hypercube
On the Power of Enumerative Counting
A note on domination 3-edge-critical planar graphs
Substitutions into propositional tautologies
Improving the Strict Avalanche Characteristics of Cryptographic Functions
A note on the Greedy algorithm for finding independent sets of C k -free graphs
The Convex-Hull-and-k-Line Travelling Salesman Problem
A tradeoff between search and update in dictionaries
Distributed Subcube Identification Algorithms for Reliable Hypercupes
Constructing LZ78 tries and position heaps in linear time for large alphabets
Cost-Minimal Preemptive Scheduling of Independent Jobs With Release and Due Dates on Open Shop Under Resource Constraints
Direct definition of a ternary infinite square-free sequence
A polynomial algorithm for the multiple knapsack problem with divisible item sizes
Dynamic pricing of call rates: Bayesian approach
An Algorithm for the Sequence Alignment with Gap Penalty Problem using Multiway Divide-and-Conquer and Matrix Transposition
On the Parallel Complexity of Digraph Reachability
Notes on inverse bin-packing problems
On edge-disjoint spanning trees with small depths
Light paths and edges in families of outer-1-planar graphs
Testing Unboundedness of Database Schemes and Functional Dependencies
Fault Tolerant Token Ring Embedding in Double Loop Networks
A Simple Proof of a Completeness Result for leads-to in the UNITY Logic
Władysław Marek Turski (1938-2013)
Median Selection of 9 Elements in 14 Comparisons
Fitted Diagonals for Reducing I/O Bandwidth in Systolic Systems
The cycle roommates problem: a hard case of kidney exchange
Differential Fault Analysis on SMS4 using a single fault
An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching
Upward Separation for FewP and Related Classes
Fast Gossiping on Square Mesh Computers
Hard problems that quickly become very easy
Upper bounds for reversible circuits based on Young subgroups
On Collapsing the Polynomial-Time Hierarchy
Improving the Worst-Case Performance of the Hunt-Szymanski Strategy for the Longest Common Subsequence of Two Strings
An Image Algorithm for Computing the Hausdorff Distance Efficiently in Linear Time
A Parallel Bucket Sort
Improved semi-online makespan scheduling with a reordering buffer
On the security of a convertible group signature scheme
A Note on the Reconstruction of a Binary Tree from its Traversals
d-dimensional arrangement revisited
On the Complexity of Scheduling Jobs on Dedicated Resources to Minimize Set-Up Costs
More restrictive Gray codes for some classes of pattern avoiding permutations
Fault Diameter of Star Graphs
On a Graph Partition Problem with Application to VLSI Layout
A characterization of s-languages
On acyclic edge coloring of toroidal graphs
Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems
A linear time algorithm for consecutive permutation pattern matching
A sharper lower bound on Rankin's constant
An FPT algorithm for orthogonal buttons and scissors
Time- and VLSI-Optimal Convex Hull Computation on Meshes with Multiple Broadcasting
Möbius-deBruijn: The product of Möbius cube and deBruijn digraph
Weighted fair division of indivisible items: A review
Complexity of estimating multi-way join result sizes for area skewed spatial data
Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing
Diophantine Inference on a Statistical Database
Partial model checking via abstract interpretation
Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors
On a Language Without Star
Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs
On the expressive power of Kleene algebra with domain
A competitive analysis for the Start-Gap algorithm for online memory wear leveling
Sorting can exponentially speed up pure dynamic programming
A Note on Scheduling on a Single Processor with Speed Dependent on a Number of Executed Jobs
A note on quasi-kernels in digraphs
New lower and upper bounds for the competitive ratio of transmission protocols
Surjective multidimensional cellular automata are non-wandering: A combinatorial proof
A Decomposition Strategy for the Vertex Cover Problem
Bit Complexity of Matrix Products
The reachability and related decision problems for monadic and semi-constructor TRSs
On Finding a Cycle Basis with a Shortest Maximal Cycle
A note on the characterization of TL[EF]
HC_AB: A new heuristic clustering algorithm based on Approximate Backbone
Comment on "An enhanced and secured RSA public cryptosystem algorithm using Chinese remainder theorem (ESRPKC)"
Improved upper and lower bounds on the optimization of mixed chordal ring networks
Computing generalized ham-sandwich cuts
Improved Matrix Triangularisation Using a Double Pipeline Systolic Array
Some Considerations About NPRIORITY(1) Without ROM
Programmed Deallocation Without Dangling Reference
Pruned Three-Dimensional Toroidal Networks
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
Approximating Matchings in Parallel
ECT - An Extensible-Contractable Translator System
Strategical languages of infinite words
Onion Polygonizations
Orienting Graphs to Optimize Reachability
RAC drawings in subcubic area
Rewriting Systems and Word Problems in a Free Partially Commutative Monoid
Modularity for teams of I/O automata
On the Sets of Perfect Matchings for Two Bipartite Graphs
Automorphisms of Broadcasting Schemes with Respect to Start Rounds
Feature weighting as a tool for unsupervised feature selection
VLSI Layouts of Complete Graphs and Star Graphs
Parallel Implementation of a Genetic-Programming Based Tool for Symbolic Regression
A Note on the Parallel Complexity of Computing the Rank of Order n Matrices
State-level and value-level simulations in data refinement
On distribution properties of sequences with perfect linear complexity profile
How to guard a graph against tree moves
A greedy approach to compute a minimum cycle basis of a directed graph
The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the MM ⁎ model
Counting Problems and Algebraic Formal Power Series in Noncommuting Variables
The distant-2 chromatic number of random proximity and random geometric graphs
A New Distributed Depth-First-Search Algorithm
A Liveness Property of a Parallel Algorithm
Efficient Management of Multiple Outstanding Timeouts
The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic
A note on improved results for one round distributed clique listing
An Optimal Parallel Algorithm for Maximal Matching
Determining the Global Progress of Parallel Simulation with FIFO Communication Property
Strongly secure ramp secret sharing schemes for general access structures
The Complexity of Number-Theoretic Constants
Topological sorts on DAGs
On Two-Processor Scheduling and Maximum Matching in Permutation Graphs
Mutex Needs Fairness
Total coloring of planar graphs of maximum degree eight
Fault-Tolerant Routings in a kappa-Connected Network
The isomorphism problem for tree-automatic ordinals with addition
On the ensemble of optimal dominating and locating-dominating codes in a graph
Introducing the counter mode of operation to Compressed Sensing based encryption
Fast Dynamic Intersection Searching in a Set of Isothetic Line Segments
A note on the efficiency of position mechanisms with budget constraints
Compositionality and Bisimulation: A Negative Result
A result on linear coloring of planar graphs
Lazy Dynamic-Programming Can Be Eager
Embedding Meshes of Trees Into deBruijn Graphs
Hierarchical broadcast and gossip networks
Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks
Planar graphs with cycles of length neither 4 nor 6 are (2, 0, 0)(2, 0, 0)-colorable
Reference Counting Can Manage the Circular Environments of Mutual Recursion
Improved approximation algorithms for k -connected m -dominating set problems
On Quickselect, partial sorting and Multiple Quickselect
Maximum common induced subgraph parameterized by vertex cover
Security analysis of a dynamic threshold secret sharing scheme using linear subspace method
Nonstationary Poisson modeling of web browsing session arrivals
Should the Two-Headed Disk be Greedy? - Yes, it Should
An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-Driven Languages
Tweakable enciphering schemes using only the encryption function of a block cipher
Vertex covering by paths on trees with its applications in machine translation
A Note on Language Equations Involving Morphisms
A Linear-Time Algorithm for Proper Interval Graph Recognition
What is an Abstract Datatype?
Parallel Dictionaries with Local Rules on AVL and Brother Trees
An Application of a Transfer Lemma
Maximum Matchings and Trees
Approximating the Diameter of a Set of Points in the Euclidean Space
A note on the Markoff condition and central words
Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal
On Recurrent and Recursive Interconnection Patterns
The Inclusion of the Substitution Closure of Linear and One-Counter Languages in the Largest Sub-AFL of the Family of Algebraic Languages is Proper
The Complexity of Matching with Bonds
Optimized random number generation in an interval
An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences
Optimal bounding cones of vectors in three dimensions
Transformational vs Reactive Refinement in Real-Time Systems
Complexity of Scheduling Tasks with Time-Dependent Execution Times
Linkage on the infinite grid
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
An efficient upper bound of the rotation distance of binary trees
Security analysis of an RFID tag search protocol
On priority assignment in fixed priority scheduling
Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary Graphs
From Algebra to Operational Semantics
Flows in dynamic networks with aggregate arc capacities
List edge multicoloring in graphs with few cycles
Listing and Counting Subtrees of Equal Size of a Binary Tree
The Space Reduction Method: A Method to Reduce the Size of Search Spaces
Regularity of Normed PA Processes
An undecidability result for Separation Logic with theory reasoning
Characterizing Parallel Hierarchies by Reducibilities
Exact algorithm for graph homomorphism and locally injective graph homomorphism
Fast Practical Multi-Pattern Matching
Real Scaled Matching
Tight approximation bounds for dominating set on graphs of bounded arboricity
Corrigendum: Lower Bounds for Rectilinear Steiner Trees
An Optimal Algorithm for Parallel Selection
Placing two disks in a convex polygon
Protocols of Accessing Overlapping Sets of Resources
An Iterative Program to Calculate Fibonacci Numbers in O(log n) Arithmetic Operations
Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
Range Searching in Low-Density Environments
About the Expressive Power of CTL Combinators
Deadlock-Free Routing in k-Ary Hypercube Network in Presence of Processor Failures
Optimal algorithm for a special point-labeling problem
A Lower Bound for the Multiplication of Polynomials Modulo a Polynomial
An O(n log n) Manhattan Path Algorithm
Reconstructing Sequential Behavior from Parallel Behavior Projections
On the complexity of the quantified bit-vector arithmetic with binary encoding
Generalizations of Line Graphs and Applications
Plane-Sweep Solves the Closest Pair Problem Elegantly
Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs
An Optimal Message Routing Algorithm for Double-Loop Networks
A Notion of Information Related to Computation
A case for a fast trip count predictor
A note concerning the closest point pair algorithm
Grid straight-line embeddings of trees with a minimum number of bends per path
From the Editors of this special issue
Computing the Gromov hyperbolicity of a discrete metric space
Complexity of solving a system of difference constraints with variables restricted to a finite set
A new threshold scheme and its application in designing the conference key distribution cryptosystem
Local linear set on graphs with bounded twin cover number
Systems of Distinct Representatives for k Families of Sets
Exploring acquaintances of social network site users for effective social event recommendations
A Note on Odd and Even Factors of Undirected Graphs
Time-bounded incompressibility of compressible strings and sequences
Several Practical Protocols for Authentication and Key Exchange
A fixed-parameter tractability result for multicommodity demand flow in trees
R-Generability, and Definability in Branching Time Logics
A Sound and Complete Query Evaluation for Implicit Predicate which is a Semantic Descriptor of Unknown Values
A Note on the Monotone Complexity of 2-REF
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links
Comments on Monitor Definition and Implementation
A probabilistic algorithm for verifying polynomial middle product in linear time
Literal Shuffle on omega-Languages
A Note on Upper Bounds for the Selection Problem
A Generalization of Chordal Graphs and the Maximum Clique Problem
A Note on the Computation of the k-Closure of a Graph
Exponential-time approximation of weighted set cover
A Probabilistic Simulation of PRAMs on a Bounded Degree Network
Modeling virtual worlds in databases
New upper bounds on feedback vertex numbers in butterflies
A Note on Extending Equivalence Theories of Algorithms
Rewriting queries using views over monadic database schemas
A note on VNP-completeness and border complexity
The worst-case chip problem
Collapse of PP with a Semi-Random Source to BPP
"Everywhere" in Predicate Algebra and Modal Logic
Many-Face Complexity in Incremental Convex Arrangements
Ergodicity of Linear Cellular Automata over ganzen Zahlen_m
Computing the clique-separator graph for an interval graph in linear time
Deterministic network exploration by a single agent with Byzantine tokens
A Fair Banker's Algorithm for Read and Write Locks
The Decidability of v-Local Catenativity and of Other Properties of D0L Systems
On the approximability of the Largest Sphere Rule Ensemble Classification problem
Complexity of Solving Algebraic Equations
Improvement of the Miyazaki-Takaragi threshold digital signature scheme
Lower Bounds on Parallel Algorithms for Finding the First Maximal Independent Set
The relative neighbourhood graph is a part of every 30degree-triangulation
A compact encoding of plane triangulations with efficient query supports
Efficient algorithm for transversal of disjoint convex polygons
Optimal Network Partitioning for Fault-Tolerant Network Management Using Evolutionary Programming
Self-stabilizing coloration in anonymous planar networks
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
Finding shortest safari routes in simple polygons
3-colouring for dually chordal graphs and generalisations
The exact complexity of the infinite Post Correspondence Problem
Note on Shortest and Nearest Lattice Vectors
Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines
A Polynomial Time Solvable Instance of the Feasible Minimum Cover Problem
Constructing a binary tree from its traversals by reversible recursion and iteration
Checking strict positivity of Kraus maps is NP-hard
The 2-Evader Problem
When does abstraction help?
A priority dynamics for generalized drinking philosophers
On Ring Embedding in Hypercubes with Faulty Nodes and Links
On the complexity of signed and minus total domination in graphs
Static Behavior Analysis of a Mesh System
On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs
There is no APTAS for 2-dimensional vector bin packing: Revisited
Heuristics for a Calculational Proof
Approximating Linear Programming is Log-Space Complete for P
Natural language tagging with genetic algorithms
Reference count analysis with shallow aliasing
"Software Devices" for Processing Graphs Using PL/I Compile Time Facilities
Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem
A fast algorithm for all-pairs Hamming distances
An Efficient Variation of Bubble Sort
Traversing Graphs in a Paging Environment, BFS or DFS?
Bisections and Ham-Sandwich Cuts of Convex Polygons and Polyhedra
On the Number of Spanning Trees of Multi-Star Related Graphs
Average-Case Analysis of the Smart Next Fit Algorithm
Min of Mat is not Necessarily Mat
On the Tractability Landscape of the Conditional Minisum Approval Voting Rule
Strong Menger connectivity with conditional faults of folded hypercubes
Downhill domination problem in graphs
An exercise in structural congruence
Bit Complexity of Order Statistics on a Distributed Star Network
An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees
The equality problem for Parikh simple algebraic power series
Single-bit messages are insufficient for data link over duplicating channels
Analyzing linearizability violations in the presence of read-modify-write operations
A Correction to "An Optimal Algorithm to Compute all the Covers of a String"
Triggering cascades on undirected connected graphs
Testing for Class Membership in Multi-Parent Hierarchies
On strong centerpoints
United and Discriminated Record Types in Strongly Typed Languages
Generalized interpolation in CASL
Kinetic collision detection with fast flight plan changes
Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm
An optimal O(N 2 ) algorithm for computing the min-transitive closure of a weighted graph
Speedup of bit-parallel Karatsuba multiplier in GF(2 m ) generated by trinomials
Trigonometric Polynomials with Simple Roots
On the Equivalence of Some Rectangle Problems
Detecting Embedded Horn Structure in Propositional Logic
Achieving Optimal CRCW PRAM Fault-Tolerance
A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs
Sparsifying Count Sketch
EDISON-80, a Language for Modular Programming of Parallel Processes
Randomized local elections
Approximating optimum branchings in linear time
An Algebraic Description of Some State-Dependent Failure Mechanisms
Fault-tolerant wormhole routing for hypercube networks
A Still Better Performance Guarantee for Approximate Graph Coloring
Routing and wavelength assignment for 3-ary n-cube in array-based optical network
Shortest Path and Closure Algorithms for Banded Matrices
Optimal algorithms for the average-constrained maximum-sum segment problem
A note on the query complexity of the Condorcet winner problem
An Optimality Proof for Asynchronous Recovery Algorithms in Distributed Systems
On the Complexity of Tree Embedding Problems
Abstracting numeric constraints with Boolean functions
Unbounded parallel-batch scheduling with family jobs and delivery coordination
An Integrated Approach to Routing and Via Minimization
Simple deterministic wildcard matching
Data Compression in Limited Capacity Microcomputer Systems
Searching a polygonal region by a group of stationary k -searchers
Introduction to Design Choices in the Semantics of Statecharts
Pattern matching with wildcards using words of shorter length