yusuke1997/dblp-id-title huggingface dataset:
A Linear-Time Algorithm for Isomorphism of a Subclass of Chordal Graphs
Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs
Task migration in 2D wormhole-routed mesh multicomputers
Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates
On the Communication Complexity of Polling
Existence of Simple Propositional Formulas
A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
NTS Grammars and Church-Rosser Systems
Name-independent compact routing in trees
A new method to determine algebraic expression of power mapping based S-boxes
The Aars of a Polygon
Preemptive stochastic online scheduling on two uniform machines
On the nonnegative rank of distance matrices
Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints
The p -Neighbor k -Center Problem
The Weakest Prespecification
Priority Queues with Update and Finding Minimum Spanning Trees
A Note on Implementing Prolog in Lisp
Learning Nearly Monotone k -Term DNF
On the longest common subsequence of Thue-Morse words
Approximating the Minimum-Cost Maximum Flow is P-Complete
Many-to-many n-disjoint path covers in n-dimensional hypercubes
The Traveling Salesman Problem for lines in the plane
On the correctness of Egalitarian Paxos
Tree-core and tree-coritivity of graphs
A sufficient condition for pancyclic graphs
Improving the arithmetic of elliptic curves in the Jacobi model
Long Edges in the Layouts of Shuffle-Exchange and Cube-Connected Cycles Graphs
On the inequivalence of bilinear algorithms for 3×33×3 matrix multiplication
Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected
Hierarchical Overlap Graph
Translation and scale invariants of Krawtchouk moments
Self-stabilizing distributed algorithm for local mutual inclusion
Greedy Binary Search Trees are Nearly Optimal
Efficient Parallel Algorithms for Finding Maximal Cliques, Clique Trees, and Minimum Coloring on Chordal Graphs
All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
A simple division-free algorithm for computing Pfaffians
Semantics of a Declarative Language
A Sensitive Transitive Closure Algorithm
An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
How to decrypt or even substitute DES-encrypted messages in 2 28 steps
Feedback arc set problem in bipartite tournaments
On purely tree-colorable planar graphs
Parametric Stable Marriage and Minimum Cuts
Optimal 1-edge fault-tolerant designs for ladders
Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs
The Worst Case Analysis of Algorithm on Multiple Stacks Manipulation
Systolic Partitioning Algorithms
Generically globally rigid zeolites in the plane
A Simple Analysis of the Error Probability of Two-Point Based Sampling
A COTS-based approach for estimating performance and energy consumption of embedded real-time systems
Customizable Garbage Collectors
Common Modulus and Chosen-Message Attacks on Public-Key Schemes with Linear Recurrence Relations
Confusion of memory
A Note on Division Orderings on Strings
A Space-Efficient Fast Prime Number Sieve
Acyclic colorings of subcubic graphs
Remarks on the Structural Grammatical Inference Problem for Context-Free Grammars
Hard real-time tasks' scheduling considering voltage scaling, precedence and exclusion relations
Bin Packing with Restricted Piece Sizes
A Note on Euclidean Near Neighbor Searching in the Plane
Geometric systems of unbiased representatives
On the Parallel Evaluation of Division-Free Arithmetic Expressions with Fan-In of Three
A Note on "A Faster Approximation Algorithm for the Steiner Problem in Graphs"
On multiple-instance learning of halfspaces
Finding the maximum common subgraph of a partial k -tree and a graph with a polynomially bounded number of spanning trees
Semantics and Properties of Existential Quantifiers in Deductive Databases
A Bit-String Longest-Common-Subsequence Algorithm
On the symmetric angle-restricted nearest neighbor problem
Codeterministic Automata on Infinite Words
Improvements on Fast Methods for Generating Normal Random Variables
An almost-linear time and linear space algorithm for the longest common subsequence problem
Limiting negations in bounded-depth circuits: An extension of Markov's theorem
Abstract Interpretation of Trace Semantics for Concurrent Calculi
A Note on the Complexity of Approximative Evaluation of Polynomials
A Fast Error Evaluation Algorithm for Polynomial Approximation
On the Security of the Lucas Function
Optimal Node Ranking of Trees in Linear Time
SPT is optimally competitive for uniprocessor flow
Some Problems Concerning Keys for Relation Schemes and Relations in the Relational Datamodel
A note on the algebraic immunity of the Maiorana-McFarland class of bent functions
A note on unbounded parallel-batch scheduling
Construction of a Tree From its Traversals in Optimal Time and Space
Cryptanalysis of Certain Variants of Rabin's Signature Scheme
On exact solutions to the Euclidean bottleneck Steiner tree problem
Worst-Case Data Structures for the Priority Queue with Attrition
New lower bounds for online k-server routing problems
Weakest Precondition Semantics for Time and Concurrency
Layer - A Language Construction for Concurrent Structure Program Design
Gray codes for reflectable languages
The compression structure of a process
Optimal Parallel 3-Coloring Algorithm for Rooted Trees and its Applications
AM exp [nsube](NP[cap]coNP)/poly
On Tree Transducers for Partial Functions
The minimum likely column cover problem
An Off-Line Storage Allocation Algorithm
Minimizing the solid angle sum of orthogonal polyhedra
A Partitioning Algorithm for Minimum Weighted Euclidean Matching
On Generalized Twisted Cubes
Improved Linear Systolic Algorithms for Substring Statistics
An approximation ratio for biclustering
Document Retrieval Using Associative Processors
An algorithm for fast multiplication of sedenions
Locating modifications in signed data for partial data integrity
Addition chains with a bounded number of registers
A pseudo-random network mobile automaton with linear growth
DB: A LISP-Type Data Base System
A note on path bipancyclicity of hypercubes
Information Streams Sharing a Finite Buffer: Protection Problems
Analysis of noise-induced phase synchronization in nervous systems: from algorithmic perspective
Design Parameters for a Multiserver Processing Buffering System with Feedback
Deciding k-colorability in expected polynomial time
An Alternative Implementation of Communication Primitives
On finding a widest empty 1-corner corridor
A General Mechanism for Avoiding Starvation with Distributed Control
Corrigenda: Phase Synchronization
Topological orderings of weighted directed acyclic graphs
A Linear Algorithm for the Number of Degree Constrained Subforests of a Tree
Node-To-Set Disjoint Paths Problem in Star Graphs
Patchworks and metablocks enumeration
Trivalent Cayley Graphs for Interconnection Networks
Simulated Annealing versus Metropolis for a TSP instance
Synchronizing the I/O Behavior of Functional Programs with Feedback
Optimal implementations of UPGMA and other common clustering algorithms
The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
On Identification of CR Property in File Organisation
Place/Transition Nets with Debit Arcs
Sorting with Efficient Use of Special-Purpose Sorters
A Layout for the Shuffle-Exchange Network with Theta(N²/log N) Area
On the Degree of Dominator Trees
Minimum cuts, girth and a spectral threshold
Deadlock Absence Proofs for Networks of Communicating Processes
A good characterization of squares of strongly chordal split graphs
On the Minimum Diameter Spanning Tree Problem
GR(1) is equivalent to R(1)
An efficient sorting algorithm for a sequence of kings in a tournament
The Solution of a Problem by Ginsburg
Deterministic treasure hunt and rendezvous in arbitrary connected graphs
Approximate Decision Algorithms for Approximate Congruence
Alternative formulations for the ordered weighted averaging objective
Routing and wavelength assignment for exchanged hypercubes in linear array optical networks
Multidimensional Tries Used for Associative Searching
Lower bounds on the OBDD size of two fundamental functions' graphs
Dependency mining-based causal message logging
On the total choosability of planar graphs and of sparse graphs
Center-based clustering under perturbation stability
Quasi-random rumor spreading: Reducing randomness can be costly
Minimum-Cost Spanning Tree as a Path-Finding Problem
A note on the integrality gap of the configuration LP for restricted Santa Claus
Geometric pattern matching for point sets in the plane under similarity transformations
Bucking the trends
On some decidability questions concerning supports of rational series
Parallel Algorithms for a Class of Graphs Generated Recursively
Generalization of a New Definition of Consistency for Pairwise Comparisons
The Complexity of Finding Fixed-Radius Near Neighbors
Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane
A Tight Upper Bound of the Lumped Disk Seek Time for the Scan Disk Scheduling Policy
Conservativity of Nested Relational Calculi with Internal Generic Functions
Between 2- and 3-colorability
The orthogonal CNN problem
Scalar recoding and regular 2 w -ary right-to-left EC scalar multiplication algorithm
The hardest linear conjunctive language
On a game in directed graphs
On the average depth of asymmetric LC-tries
On the oriented chromatic number of Halin graphs
Combinatorial Lower Bounds for Secret Sharing Schemes
New fault attacks using Jacobi symbol and application to regular right-to-left algorithms
Generalization of Floyd's Model on Permuting Information in Idealized Two-Level Storage
Conflict Detection and Resolution in a Lexical Analyzer Generator
On Approximating the Minimum Independent Dominating Set
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
Preemptive scheduling for approximate computing on heterogeneous machines: Tradeoff between weighted accuracy and makespan
2-Dimensional palindromes with k mismatches
The Tree Representation of the Graph Used in Binary Image Processing
Efficient computation of shortest absent words in a genomic sequence
A 4-states algebraic solution to linear cellular automata synchronization
The equivalence problem for deterministic MSO tree transducers is decidable
Rearrangeable Nonblocking Condition for Multi-log_2 N Multiconnection Networks
Quasi-Parity and Perfect Graphs
The existence of perfect codes in a family of generalized Fibonacci cubes
The online Prize-Collecting Traveling Salesman Problem
Super-connected but not super edge-connected graphs
Kernel for K t -free Edge Deletion
A unified framework for structure identification
Algorithms for clustering clickstream data
Perfect Stables in Graphs
Computing the k densest subgraphs of a graph
Fast Algorithms for Lowest Common Ancestors on a Processor Array with Reconfigurable Buses
A Note on Anomalies in Parallel Branch-and-Bound Algorithms with One-to-One Bounding Functions
A Sperner lemma complete for PPA
Decomposing a Star Graph Into Disjoint Cycles
An A ⁎ search algorithm for the constrained longest common subsequence problem
A note on the decoding complexity of error-correcting codes
Optimal Packing and Covering in the Plane are NP-Complete
Dynamic Programming on Linear Pipelines
On regularity of Max-CSPs and Min-CSPs
On a Complexity Hierarchy Between L and NL
On-Line Algorithms for the Dominating Set Problem
An Asymptotic Comment on a Paper by Analyti and Pramanik
On a Class of Square-Free Graphs
Linear Programming in O(n * (3_d)_2) Time
Syntax-Directed Unit Conversion
Voronoi Diagrams with Barriers and the Shortest Diagonal Problem
Preemptive Scheduling of Independent Jobs on a Hypercube
Multiple Search Problen on Reconfigurable Meshes
Erratum: A Polynomial Bound on the Number of Light Cycles in an Undirected Graph
A Note on Implementing Combining Networks
802.4 Rate Monotonic Scheduling in Hard Real-Time Environments: Setting the Medium Access Control Parameters
Multiple Quickselect - Hoare's Find Algorithm for Several Elements
A note of an O(n 3 /logn) time algorithm for all pairs shortest paths
Graphs of interval count two with a given partition
A Linear Algorithm for the Hamiltonian Completion Number of a Tree
An optimal algorithm for the maximum-density path in a tree
Integrating Authentication in Public Key Distribution System
A fast correlation attack on LILI-128
The Recognition of Union Trees
An On-Line Pattern Matching Algorithm
Hanano Puzzle is NP-hard
Strictness Analysis of the Untyped lambda-Calculus
On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions
On the Computational Complexity of Graph Closures
Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs
Axiomatizing Fixpoint Logics
Concurrent non-malleable statistically hiding commitment
A kind of conditional fault tolerance of alternating group graphs
A Fast Convex Hull Algorithm
Fastest Path Across Constrained Moving Rectilinear Obstacles
Typing evolving ambients
A short note on the complexity of computing strong pathbreadth
Quantified Computation Tree Logic
Some Properties of Fully Reducible Graphs
Neither the Greedy Nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation
Cryptanalysis of "an identity-based society oriented signature scheme with anonymous signers"
Finding and counting cliques and independent sets in r-uniform hypergraphs
On Fixed Priority Scheduling, Offsets and Co-Prime Task Periods
A note on generalized rank aggregation
Computing the Hausdorff Set Distance in Linear Time for Any L_p Point Distance
On the primitivity of operators in SPARQL
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
A note on relaxed equitable coloring of graphs
Robustness of k -gon Voronoi diagram construction
A Linear Time Algorithm for Finding all Farthest Neighbors in a Convex Polygon
The Complexity of Scheduling Starting Time Dependent Tasks with Release Times
Substantiable Evaluations by Electronic Computers and Their Application to one Problem in Combinatorial Geometry
A note on vectorial bent functions
Security weaknesses of a signature scheme and authenticated key agreement protocols
Credibility decay model in temporal evidence combination
An Optimal Parallel Algorithm for Sorting Multisets
Binary trees with choosable edge lengths
Data Refinement by Miracles
Enumeration of lattice points in l 1 norm
A Fast Correlation Attack on Multiplexer Generators
An approximation algorithm for interval data minmax regret combinatorial optimization problems
Approximating Block Accesses in Database Organizations
A note on "Category and measure in complexity classes"
A fault-tolerant wormhole routing scheme for torus networks with nonconvex faults
A log log n Data Structure for Three-Sided Range Queries
On the (im)possibility of improving the round diffusion of generalized Feistel structures
Fair and truthful allocations under leveled valuations
An algorithm for Exact Satisfiability analysed with the number of clauses as parameter
Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis
Bandwidth of convex bipartite graphs and related graphs
On the Complexity of Interactive Proofs with Bounded Communication
On an Extension of Dijkstra's Semaphore Primitives
Not all Planar Digraphs have Small Cycle Separators
Corrigendum: A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m
An approximation algorithm for maximum P 3 -packing in subcubic graphs
Two Results on the List Update Problem
A simple algorithm for the constrained sequence problems
Restricted compositions and permutations: From old to new Gray codes
A hierarchical clustering algorithm for categorical sequence data
Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models
The Complexity of Searching in X+Y and Other Multisets
Optimal priority assignment in the presence of blocking
Insertion-Safeness in Balanced Trees
A Linear Time Algorithm for Unique Horn Satisfiability
On Lexicographic Semi-Commutations
List k -colouring P t -free graphs: A Mim-width perspective
Attacks on Okamoto and Tanaka's One-Way ID-Based Key Distribution System
Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
Refined memorization for vertex cover
An Optimization Problem Related to Neural Networks
Enumeration of Binary Trees
Generalized rate monotonic schedulability bounds using relative period ratios
On the optimal utilization of all available states in the 2 n moduli set
Some results on Parametric Temporal Logic
A randomized algorithm for long directed cycle
Fast RNS Division Algorithms for Fixed Divisors with Application to RSA Encrytion
Cluster editing problem for points on the real line: A polynomial time algorithm
Computing the Minimum Weight Triangulation of a Set of Linearly Ordered Points
A Note on the Hamiltonian Circuit Problem on Directed Path Graphs
Inapproximability of counting independent sets in linear hypergraphs
Polynomial Algorithms for the Weighted Perfect Domination Problems on Chordal Graphs and Split Graphs
An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set
A note on models for non-probabilistic analysis of packet switching networks
The Effects of Checkpointing on Program Execution Time
Online scheduling on semi-related machines
Brother trees: A family of optimal 1 p -hamiltonian and 1-edge hamiltonian graphs
On an optimal randomized acceptor for graph nonisomorphism
A note on point location in arrangements of hyperplanes
A simple algorithm for computing the document array
Information Streams Sharing a Finite Buffer: Other Solutions
On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities
Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order
On Embedding Functions in Logic
Clique Transversal and Clique Independence on Comparability Graphs
An Algorithm for Flow Time Minimization and its Asymptotic Makespan Properties
Refined Simulation of Multihead Automata
Fast computation of smallest enclosing circle with center on a query line segment
A one-round secure message broadcasting protocol through a key sharing tree
A Note on Random Sampling
Direction-Independent Application of Productions on Two-Dimensional Arrays
Obtaining Lazy Evaluation with Continuations in Scheme
Statistical EL is ExpTime-complete
Counterexamples in infinitary rewriting with non-fully-extended rules
A Parallel List Update Problem
There is no Asymptotic PTAS for Two-Dimensional Vector Packing
A simple algorithm for computing positively weighted straight skeletons of monotone polygons
On a characterization of the standard Gray code by using its edge type on a hypercube
Comments on "A Comparison of Concatenated and Superimposed Code Word Surrogate Files for Very Large Data/Knowledge Bases"
Oriented colorings of 2-outerplanar graphs
Computing unique canonical covers for simple FDs via transitive reduction
Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
Two Remarks on a Convex Hull Algorithm
Variations of the maximum leaf spanning tree problem for bipartite graphs
The complexity of computing the 2-K-reliability in networks
Adding State Merging to the DMC Data Compression Algorithm
A Simple Proof of Strassen's Result
On the Generation of Permutations
A Comment on the 'Basic Security Theorem' of Bell and LaPadula
Heuristics for Syntactial Optimization of Relational Queries
Computing a Single Cell in the Overlay of Two Simple Polygons
Design of Queuing Buffer Register Size
The Complexity of Symmetrizing Matrices
Iteration Strikes Back - at the Cyclic Towers of Hanoi
A Deficiency of Natural Deduction
Smoothness of Schatten norms and sliding-window matrix streams
Construct a perfect word hash function in time independent of the size of integers
The Complexity of Finding Uniform Emulations on Fixed Graphs
Security of Tseng-Jan's group signature schemes
Distributed Termination Detection Algorithm for Distributed Computations
Integrating job parallelism in real-time scheduling theory
Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable
On the definition of sequential consistency
On Injectivity of Deterministic Top-Down Tree Transducers
The Lower Bounds on the Additive Complexity of Bilinear Problems in Terms of Some Algebraic Quantities
Infinitely many Zhang functions resulting in various ZNN models for time-varying matrix inversion with link to Drazin inverse
Acyclically 4-colorable triangulations
The d-deap ast: a fast and simple cache-aligned d-ary deap
Optimal Embedding of 2-D Torus Into Ring
Deriving Graphical Representations of Process Networks from Algebraic Expressions
The Diameter of the Cube-Connected Cycles
A Cascade Algorithm for the Logical Closure of a Set of Binary Relations
The ski-rental problem with multiple discount options
A linear time algorithm for liar's domination problem in proper interval graphs
Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal Piecewise-Linear Motion of a Ladder
Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property
An intuitive and simple bounding argument for Quicksort
Superiority of exact quantum automata for promise problems
An Alternative for the Implementation of the Knuth-Morris-Pratt Algorithm
The Order of Appel's Algorithm
Liu and Layland's schedulability test revisited
Improving the usability of the source code quality index with interchangeable metrics sets
An efficient algorithm for Horn description
More decidable instances of Post's correspondence problem: beyond counting
On the semantics of Strategy Logic
Efficient Algorithms for the Temporal Precedence Problem
On the Average Number of Maxima in a Set of Vectors
An Optimal Algorithm for Finding the Edge Visibility Polygon under Limited Visibility
Mesh Permutation Routing with Locality
Routing and wavelength assignment for 3-ary n-cube communication patterns in linear array optical networks for n communication rounds
Flaws in some self-healing key distribution schemes with revocation
A Note on the Complexity of the Chromatic Number Problem
Determining a singleton attractor of an AND/OR Boolean network in O(1.587 n ) time
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
A Note on the Pebble Game
Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
Elementary approximation algorithms for prize collecting Steiner tree problems
The Unwind Property for Programs with Bounded Memory
An Execution Mechanism for Nondeterministic, State-Oriented Programs Based on a Chart Parser
Efficient extraction of schemas for XML documents
Evaluations of Domino-Free Communication-Induced Checkpointing Protocols
Algebra of Two-Level Cause-Effect Structures
An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3
Deadlock and Fairness in Parallel Schemas: A Set-Theoretic Characterization and Decision Problems
The Duodirun Merging Algorithm: A New Fast Algorithm for Parallel Merging
On reversing arcs to improve arc-connectivity
On two restricted ancestors tree problems
Weaknesses in some multisignature schemes for specified group of verifiers
Deadline-based scheduling of periodic task systems on multiprocessors
Finding routes in anonymous sensor networks
Unifying wp and wlp
Low discrepancy sets yield approximate min-wise independent permutation families
Convertibility in Databases