yusuke1997/dblp-id-title huggingface dataset:
A lower bound for the hitting set size for combinatorial rectangles and an application
A new lower bound on the price of anarchy of selfish bin packing
An Improvement of Algorithms for Solving Interface Equations
Effects of Message Loss on the Termination of Distributed Protocols
Hamiltonian Circuits in Interval Graph Generalizations
Another Glance at the Alpern-Schneider Characterization of Safety and Liveness in Concurrent Executions
Maximizing the Number of Unused Colors in the Vertex Coloring Problem
A Note on the Path Length of Red-Black Trees
The spined cube: A new hypercube variant with smaller diameter
Multi-Problem-Solving: Knowledge Representation and System Architecture
Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms
On Bispecial Factors of the Thue-Morse Word
On the Omega(n log n) Lower Bound for Convex Hull and Maximal Vector Determination
On a Problem in Storage Optimization
A filtration method for order-preserving matching
Area-Time Optimal VLSI Networks for Multiplying Matrices
Acyclic and k-distance coloring of the grid
A clique-covering sufficient condition for hamiltonicity of graphs
Constant-Slowdown Simulations of Normal Hypercube Algorithms on the Butterfly Network
A Guided Tour of the Mathematics of MetaSoft'88
Shortest Path Between Two Simple Polygons
The enumeration of permutations sortable by pop stacks in parallel
A Simple Transfer Lemma for Algebraic Specifications
Degree conditions for fractional ( a , b , k )-critical covered graphs
An Algorithm for Finding Clique Cut-Sets
Decomposition - An Approach for Optimizing Queries Including ADT Functions
A Fast Parallel Quicksort Algorithm
A New Routing Algorithm for Cyclic Shifts on BRGC Hypercubes
About acyclic edge colourings of planar graphs
Green data centers: Using hierarchies for scalable energy efficiency in large web clusters
Strong security of linear ramp secret sharing schemes with general access structures
Labeling a Rectilinear Map More Efficiently
Density of straight-line 1-planar graph drawings
Smaller superconcentrators of density 28
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
Using a minimal number of resets when testing from a finite state machine
Constrained existence of weak subgame perfect equilibria in multiplayer Büchi games
On the Consecutive Retrieval Property for Generalized Binary Queries
A parallel algorithm for approximate regularity
Efficient 3-dimensional GLV method for faster point multiplication on some GLS elliptic curves
Extending the Four Russians' Bound to General Matrix Multiplication
Restricted failure detectors: Definition and reduction protocols
An Optimal Algorithm for Distributed Snapshots with Causal Message Ordering
On Resource Scheduling of Multi-Join Queries in Parallel Database Systems
A note on labeling schemes for graph connectivity
A note on "The super connectivity of augmented cubes"
I/O-and CPU-Optimal Recognition of Strongly Connected Components
The Two-Thirds Rule for Dynamic Storage Allocation Under Equilibrium
An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path
Lower Bounds on the Area of Finite-State Machines
A new method to construct Boolean functions with good cryptographic properties
Improved Bounds for Covering Complete Uniform Hypergraphs
Improved analysis of the reduction from BDD to uSVP
Optimal Deadlock Resolutions in Edge-Disjoint Reducible Wait-For Graphs
A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock
A bounded space algorithm for online circle packing
Approximate matching in the L infinity metric
A new family of nonstochastic languages
Mahonian STAT on words
Local diagnosability of generic star-pyramid graph
Lexicographically Least Circular Substrings
Nonnegative integral subset representations of integer sets
On the bi-enhancement of chordal-bipartite probe graphs
An Incremental Pattern Matching Algorithm for the Pipelined Lexical Scanner
Finitistic Proofs of 0-1 Laws for Fragments of Second-Order Logic
Finding a Maximum Independent Set in a Permutation Graph
An Algorithm for the Most Economic Link Addition in a Tree Communication Network
Non-shared edges and nearest neighbor interchanges revisited
An Approach for Data Type Specification and Its Use in Program Verification
A Linear-Time Algorithm for Drawing a Planar Graph on a Grid
PRAMs with Variable Word-Size
On the minimum size of visibility graphs
A Fast Algorithm for Finding Interlocking Sets
On the computational structure of the connected components of a hard problem
A Note on Some Tree Similarity Measures
CPS transformation of beta-redexes
Simpler FM-index for parameterized string matching
Improving Bounds for the Number of Correlation Immune Boolean Functions
Approximating nearest neighbor among triangles in convex position
Improved Zhang neural network with finite-time convergence for time-varying linear system of equations solving
How to Construct Efficient Signcryption Schemes on Elliptic Curves
On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems
On the Day-Tripathi orientation of the star graphs: Connectivity
On the cubicity of certain graphs
Fifo-Optimal Placement on Pages of Independently Referenced Sectors
On the k -means/median cost function
Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine
An effective local search for the maximum clique problem
Real-Time Scheduling of Linear Speedup Parallel Tasks
Near-Optimal Nonapproximability Results for Some NPO PB-Complete Problems
Prime Numbers as a Tool to Design Distributed Algorithms
Relating Bends and Size in Orthogonal Graph Drawings
Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation
Size-optimal top dag compression
Transfer theorems via sign conditions
A force-directed algorithm that preserves edge-crossing properties
A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
A new class of zero-difference balanced functions
On the interconnection of message passing systems
Zhang neural networks for a set of linear matrix inequalities with time-varying coefficient matrix
On the Relationship Between the Diameter and the Size of a Boundary of a Directed Graph
A Simplified Proof for a Self-Stabilizing Protocol: A Game of Cards
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
On a Question About Learning Nearly Minimal Programs
Recognition of largest empty orthoconvex polygon in a point set
Cubic Map Configurations
An O(sqrt(n))-approximation algorithm for directed sparsest cut
Huffman Coding in Bit-Vector Compression
Some Observations on Skip-Lists
The Average Sensitivity of Bounded-Depth Circuits
Approximate String Matching with don't Care Characters
The Earley Algorithm as a Problem Representation
Hamiltonian Graphs with Minimum Number of Edges for Fault-Tolerant Topologies
Algorithms for Three-Dimensional Dominance Searching in Linear Space
Test Sets for Languages of Infinite Words
An algorithm for finding a k-median in a directed tree
Why is the 3D Delaunay Triangulation Difficult to Construct
A Guided Tour of Chernoff Bounds
Complexity and algorithms for injective edge-coloring in graphs
Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm
Sorting on PRAMs with Reconfigurable Buses
An Optimal Algorithm for Reconstructing a Binary Tree
Complexity analysis of a decentralised graph colouring algorithm
Multi-dimensional dynamic facility location and fast computation at query points
Feedback arc set in bipartite tournaments is NP-complete
Calculating with Procedure Calls
On "Inherently Context-Sensitive" Languages - An Application of Complexity Cores
Object-Oriented Interaction in Resource Constrained Scheduling
A new algorithm for online uniform-machine scheduling to minimize the makespan
A Note on 'Is Shortest Path Problem not Harder Than Matrix Multiplication?'
On-line grid-packing with a single active grid
Quorums from difference covers
How sensitive are the term-weighting models of information retrieval to spam Web pages?
A Generalization of Two Code Ordering Optimizations
On Simon's String Searching Algorithm
The design of conference key distribution system employing a symmetric balanced incomplete block design
On the multi-radius cover problem
A Limitation of Vector Timestamps for Reconstructing Distributed Computations
An Observation Concerning Constraint-Based Compaction
Hamiltonian paths and cycles passing through a prescribed path in hypercubes
On Proving that a Graph has no Large Clique: A Connection with Ramsey Theory
A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m
Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph
First-Order Queries on Databases Embedded in an Infinite Structure
Satisfying the restricted isometry property with the optimal number of rows and slightly less randomness
Space-Optimal Hidden Line Elimination for Rectangles
Factorial Languages with Quadratically Upper Bounded Growth Functions and Nonlinearly Upper Bounded Subword Complexities
Optimizing a mail-order with discount and shipping costs
Remark on the Computational Power of a Turing Machine Variant
Factoring stochastic relations
Spanners of de Bruijn and Kautz Graphs
On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
Minimum implicational basis for meet-semidistributive lattices
Escaping Braess's paradox through approximate Caratheodory's theorem
Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh
On the area of hypercube layouts
In search of lost time
A new tree inclusion algorithm
An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property
An acceleration of FFT-based algorithms for the match-count problem
The linear arboricity of planar graphs with maximum degree at least 5
Edge-choosability of planar graphs without non-induced 5-cycles
The Length Sets of D0L Languages are Uniformly Bounded
Data replication in static tree structures
Preferential deletion in dynamic models of web-like networks
Birthday type attacks to the Naccache-Stern knapsack cryptosystem
On cellular automata over Galois rings
A Note on Linear Precedence Functions
The Complexity of Ultrametric Partitions on Graphs
A Fast Heuristic Based on Spacefilling Curves for Minimum-Weight Matching in the Plane
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
A new graph characteristic and its application to numerical computability
Some optimization problems on weak-bisplit graphs
Complete and ready simulation semantics are not finitely based over BCCSP, even with a singleton alphabet
The facility location problem with maximum distance constraint
Corrigendum to "Revisiting reachability in polynomial interrupt timed automata" [Information Processing Letters 174 (2022) 106208]
Approximability and parameterized complexity of multicover by c-intervals
Integer SEC-DED codes for low power communications
A Fully Distributed (Minimal) Spanning Tree Algorithm
Computing two penetration measures for curved 2D objects
Common Intersections of Polygons
A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
Polyominos and Perfect Graphs
Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems
Bounds and algorithms for generalized superimposed codes
Stabilizing Observers
On the Relationship Between the LL(k) and LR(k) Grammars
Linear Decision Trees are too Weak for Convex Hull Problem
The eternal dominating set problem for interval graphs
A Note on Adaptive Parallel Sorting
A Note on Unification Type Zero
A McCulloch-Pitts Neural Net to Characterize Even Linear Languages
An Improved Algorithm for Intersecting Convex Polygons
A speed-up for the commute between subword trees and DAWGs
On the Structural Grammatical Inference Problem for Some Classes of Context-Free Grammars
Excess in Arrangements of Segments
Channel assignment via fast zeta transform
Signum-function array activated ZNN with easier circuit implementation and finite-time convergence for linear systems solving
A tighter upper bound for random MAX 2-SAT
An Undecidable Problem for Context-Free Grammars
A simplified correctness proof for a well-known algorithm computing strongly connected components
Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms
The Value of an Array Facility in Prolog
A Model of Distributed Control: Dependency and Uncertainty
An Improved Algorithm for the Fixed-Radius Neighbor Problem
A Note on Isomorphic Chordal Rings (Erratum)
On generation of permutations of m out of n items
A Remark on Matrix Rigidity
A type and effect system for activation flow of components in Android programs
A novel adaptive feature selector for supervised classification
Resistance of Balanced s-Boxes to Linear and Differential Cryptanalysis
A new matrix form to generate all 3 × 3 involutory MDS matrices over F2m
Linear structure of bipartite permutation graphs and the longest path problem
An Optimally Efficient Selection Algorithm
Faster semi-external suffix sorting
An efficient decoding technique for Huffman codes
On the applicability of Post's lattice
The alpha-beta Algorithm: An Exercise in Program Transformation
String matching with inversions and translocations in linear average time (most of the time)
An Insight on PRAM Computational Bounds
Analyzing Residual Random Greedy for monotone submodular maximization
An Algorithm for Inverting a Permutation
Analyzing scheduling with transient failures
Public-key encryption based on Chebyshev polynomials over GF(q)
Quasi chain rule for min-entropy
Hamiltonian properties on the class of hypercube-like networks
Recognizing Strict 2-Threshold Graphs in O(m) Time
A Note on Undefined Expression Values in Programming Logics
Improved gradient-based neural networks for online solution of Lyapunov matrix equation
Interpolation-Binary Search
A New Characterization of FD Implication with an Application to Update Anomalies
Efficiently pricing European-Asian options - ultimate implementation and analysis of the AMO algorithm
Probabilistic Checking of Associativity in Algebras
Motzkin subposets and Motzkin geodesics in Tamari lattices
Procedures and Atomicity Refinement
An Improvement of Goldberg, Plotkin and Vaidya's Maximal Node-Disjoint Paths Algorithm
Variants of constrained longest common subsequence
Varieties of Formal Series on Trees and Eilenberg's Theorem
Secondary constructions of RSBFs with good cryptographic properties
Asymptotic analysis of an optimized quicksort algorithm
An extension of TYT algorithm for GF((2 n ) m ) using precomputation
Template Method test pattern
On the Rationality of Petri Net Languages
A Special Arrangement with Minimal Number of Triangles
The Maximum Depth of Monotone Formulae
Compact Embedding of Binary Trees Into Hyperacubes
Scalable and Predictable Performance for Irregular Problems Using the WPRAM Computational Model
Average Time Analyses of Simplified Davis-Putnam Procedures
Matching with don't-cares and a small number of mismatches
Improved convertible authenticated encryption scheme with provable security
Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study
Graham triangulations and triangulations with a center are hamiltonean
The complexity of depth-3 circuits computing symmetric Boolean functions
Mean analysis of an online algorithm for the vertex cover problem
An Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits
Two algorithms for minimum 2-connected r-hop dominating set
The Design and Analysis of a New Hybrid Sorting Algorithm
Inapproximability of the kidney exchange problem
On the parameterized complexity of the repetition free longest common subsequence problem
A Relationship Between Nondeterministic Turing Machines and 1-Inkdot Turing Machines with Small Space
The super connectivity of augmented cubes
Cyclic Arrangements and Roudneff's Conjecture in the Space
A New Method to Solve Non-Linear Equations
Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups
Guarded Procedure: A Distributed Programming Concept
A Counter-Example to an Algorithm for the Generalized Input-Output Construct of CSP
Finding Linear and Circular Sequences of Minimal and Maximal Total Adjacency
Constructing a Program with Exceptions
An efficient algorithm for computing non-overlapping inversion and transposition distance
A practical approach of task scheduling and load balancing on heterogeneous distributed raytracing systems
Should one always use repeated squaring for modular exponentiation?
Total Domination in Interval Graphs Revisited
On the algebraic complexity of set equality and inclusion
An Note on the Number of Monadic Quantifiers in Monadic Sigma^1_1
Sufficient conditions for edit-optimal clusters
Corrigendum to "Note on covering monotone orthogonal polygons" [Inf. Process. Lett. 104(6) (2007) 220-227]
Note on property M(k) of some complete multipartite graphs
Maximal elements with minimal logic
Recognizing Breadth-First Search Trees in Linear Time
On some graphs with a unique perfect matching
On the two-dimensional cow search problem
Prefix and Equality Languages of Rational Functions are Co-Context-Free
Maximum h -Colourable Subgraph Problem in Balanced Graphs
Applying the Minimax Rule Over Graphs Which Are Not Trees
Equivalence of Multistage Interconnection Networks
Stochastic shortest path with unlimited hops
A generalization of orthogonal factorizations in digraphs
Trapdoor Knapsacks Without Superincreasing Structure
Selecting Small Ranks in EREW PRAM
Ciphertext-only attack on d × d Hill in O(d13 d )
Optimality of Intuitive Checkpointing Policies
Efficient monotone circuits for threshold functions
A Note on Border Rank
Hierarchical termination revisited
Learning a subclass of k-quasi-Horn formulas with membership queries
Parallel Cardinality Stacks and an Application
A short note on "A note on single-machine scheduling with job-dependent learning effects"
A Note on Multi-Inkdot Nondeterministic Turing Machines with Small Space
A note on on-line scheduling with precedence constraints on identical machines
The finite power problem revisited
On the Completeness of a Set of Transformations Optimizing Linear Programs
An Improved List-Searching Algorithm
Another Distributed Algorithm for Multiple Entries to a Critical Section
On the Security of Recent Protocols
Erratum to: "The design of conference key distribution system employing a symmetric balanced incomplete block design": [Inform. Process. Lett. 81 (2002) 313-318]
Turing Complexity of the Ordinals
Connecting face hitting sets in planar graphs
Farthest segments and extremal triangles spanned by points in R 3
Fast Parallel Algorithms for the Approximate Edge-Coloring Problem
Maximum induced subgraph of a recursive circulant
Online hypergraph coloring
On the Number of Descendants in an Object DAG
Exact Balancing is Not Always Good
Determining the Shape of a Convex n-Sided Polygon by Using 2n+k Tactile Probes
New algorithms for binary jumbled pattern matching
Primitive Morphisms
An algorithm for reconstructing level-2 phylogenetic networks from trinets
Undecidability of the Bandwidth Problem on Linear Graph Languages
A Primal-Dual Approximation Algorithm for the Steiner Forest Problem
The One-Dimensional Weighted Voronoi Diagram
A priority heuristic for the guillotine rectangular packing problem
Propositional Description of Finite Cause-Effect Structures
A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
On the intrinsic complexity of point finding in real singular hypersurfaces
A New Approach for the Domination Problem on Permutation Graphs
Black-box complexity: Advantages of memory usage
A Sweepline Algorithm to Solve the Two-Center Problem
Parallel Algorithms for Addition and Multiplication on Processor Arrays with Reconfigurable Bus Systems
Stabilizing data-link over non-FIFO channels with optimal fault-resilience
Characterization of Extended LR(k) Grammars
Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
Information Concepts and Pairwise Comparison Matrices
P2P-FISM: Mining (recently) frequent item sets from distributed data streams over P2P network
Exploiting distance coherence to speed up range queries in metric indexes
A note on cycle embedding in folded hypercubes with faulty elements
Constructing the Visibility Graph for n-Line Segments in O(n²) Time
Linear election in pancake graphs
Connected equitable cake division via Sperner's lemma
Average complexity of backward q-gram string matching algorithms
Proxy signature schemes based on factoring
Finding the maximum bounded intersection of k out of n halfplanes
An elementary proof that Herman's Ring is Theta (N 2 )
Alternating paths through disjoint line segments
An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree
A new sufficient condition for Hamiltonicity of graphs
Optimum Ordered Bi-Weighted Binary Trees
Maximum gap labelings of graphs
Finding a Minimal 1-DNF Consistent with a Positive Sample is LOGSNP-Complete
Reverse greedy is bad for k -center
Approximate maximum weight branchings
An Agent Calculus with Simple Actions Where the Enabling and Disabling are Derived Operators
Introducing concurrency in sequential Java via laws
An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths
A Note on Ambiguity in Context-Free Grammars
Binary codes for locally homogeneous sequences
Algorithms for anti-powers in strings
Normalized Divide-and-Conquer: A Scaling Technique for Solving Multi-Dimensional Problems
On Secret Sharing Schemes
Inverse Morphic Equivalence on Languages
Streaming tree automata
Black-Box Polynomials Resultants
Combining model finder and genetic programming into a general purpose automatic program synthesizer
The Helly property on subfamilies of limited size
Quantum attacks on Sum of Even-Mansour pseudorandom functions
On the Dynamic Maintenance of Maximal Points in the Plane
An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application
On the Angle Restricted Nearest Neighbor Problem
Reviewing bounds on the circuit size of the hardest functions
Scheduling on a Hypercube
Relaxations of semiring constraint satisfaction problems
On the asymmetric complexity of the group-intersection problem
Efficient Edge Domination Problems in Graphs
A Run-Time Mechanism for Referencing Variables
Parameterized complexity of the induced subgraph problem in directed graphs
Approximate pattern matching with k-mismatches in packed text
The Parallel Complexity of Two Problems on Concurrency
Testing for Existence of a Covering Boyce-Codd normal Form
A Generalized Deadlock Predicate
A Functional Model of a Simplified Sequential Machine
A note on width-parameterized SAT: An exact machine-model characterization
Reporting intersections among thick objects
A simple division-free algorithm for computing determinants
A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm
Conditional diagnosability of alternating group networks
Shape Distribution of Height-Balanced Trees
A Note on Quantum Black-Box Complexity of Almost all Boolean Functions
On Key Agreement Protocols Based on Tamper-Proof Hardware
Traveling Salesman Cycles are not Always Subgraphs of Voronoi Duals
Fast Decoding of the Huffman Codes
Counting and Randomly Generating Binary Trees
A linear time algorithm for maximal clique enumeration in large sparse graphs
On Approximating the Memory-Constrained Module Allocation Problem
Fractional programming formulation for the vertex coloring problem
Decreasing the Bandwidth of a Transition Matrix
Conjunctive Query Containment with Respect to Views and Constraints
A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem
Non-Elementary Lower Bound for Propositional Duration Calculus