yusuke1997/dblp-id-title huggingface dataset:
Addendum to "An O(|V| 2 ) algorithm for single connectedness"
Revisiting explicit adaptive two-probe schemes
A toughness condition for fractional ( k , m )-deleted graphs
A Storage Allocation Method with Invalidating Dangling References
An improved kernelization algorithm for r-Set Packing
Bypassing BDD construction for reliability analysis
Generalized cuckoo hashing with a stash, revisited
Optimal Fault-Tolerant Distributed Construction of a Spanning Forest
On-Line Longest Fragment First Parsing Algorithm
A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint
Simple Distributed Delta +1-coloring of Graphs
On the "majority is least stable" conjecture
Strong NP-Hardness of Moving Many Discs
Bipartite Graphs, Upward Drawings, and Planarity
Quadratic-time algorithm for a string constrained LCS problem
Modeling Hypergraphs by Graphs with the Same Mincut Properties
On spectral windows in supervised learning from data
A combinatorial characterization of regular anonymous perfect threshold schemes
A Parallel Algorithm for the Maximum 2-Chain Edge Packing Problem
Obstacle Growing in a Nonpolygonal World
A note on randomized streaming space bounds for the longest increasing subsequence problem
Data Compression and Gray-Code Sorting
An Improved Data-Dependency-Based Backtracking Scheme for Prolog
Degree condition for completely independent spanning trees
On the Complexity of the Recognition of Parallel 2D-Image Languages
Rotation distance is fixed-parameter tractable
Partial words with a unique position starting a square
A User Authentication Scheme for Shared Data Based on a Trap-Door One-Way Function
An algorithm for computing simple k-factors
Efficient polynomial time algorithms computing industrial-strength primitive roots
NP-hardness and inapproximability of sparse PCA
The Steiner Problem with Edge Lengths 1 and 2
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
A proof of a conjecture on multiset coloring the powers of cycles
An analytical study of central and in-network data processing for wireless sensor networks
Maximum number of edges joining vertices on a cube
Implementation Approach to Parallel Systems
A Note on Vector Grammars
A Lower Bound for Communication in the Crossbar
Improved FPT algorithm for feedback vertex set problem in bipartite tournament
The shuffle-cubes and their generalization
On Covering Boyce-Codd Normal Forms
Adding cardinality constraints to integer programs with applications to maximum satisfiability
A faster algorithm for the computation of string convolutions using LZ78 parsing
Direct Determination of a 'Seed' Binary Matrix
Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel
Equality sets of prefix morphisms and regular star languages
An Omega(n/lg n) 1/2 Lower Bound on the Number of Additions Necessary to Compute 0-1 Polynomials over the Ring of Integer Polynomials
Allocation Techniques for Distributed Reduction Data Elements
A factor 2 approximation algorithm for the vertex cover P 3 problem
Connectivity of the Crossed Cube
On the IO-Complexity and Approximation Languages
On the Logarithmic Evaluation of Recurrence Relations
ET0L-Grammars and N-Grammars
The number of guillotine partitions in d dimensions
Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations
The decidability border of hereditary history preserving bisimilarity
The complexity of deciding stability under FFS in the Adversarial Queueing model
Imbalance is fixed parameter tractable
VLSI Implementation of Fast Solvers for Band Linear Systems With Constant Coefficient Matrix
Semi-Unification of Two Terms in Abelian Groups
I -rationality of a certain class of formal series
On the Complexity of Inexact Computations
Finding iterative roots with a spiking neural network
A Storage-Size Selection Problem
An Improved LALR(k) Parser Generation for Regular Right Part Grammars
Approximating weighted matchings in parallel
Randomized Group Testing for Mutually Obscuring Defectives
Faster deterministic algorithm for Co-Path Set
On the Verification of Qualitative Properties of Probabilistic Processes under Fairness Constraints
Efficient incremental mining of contrast patterns in changing data
An Error-Correcting Coding Scheme for Alphanumeric Data
A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption
Resource constrained scheduling on multiple machines
Fault-tolerant-prescribed hamiltonian laceability of balanced hypercubes
Reducing the space used by the sieve of Eratosthenes when factoring
On the Costs of Self-Stabilization
Revisiting Global Constraint Satisfaction
A fast CU depth decision mechanism for HEVC
On the Domatic Number of Interval Graphs
Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space
s-partitions
Eliminating the Flag in Threaded Binary Search Trees
Insertion depth in power-weight trees
The Inclusion of D0L in MULTI-RESET
Comments on "Integer SEC-DED codes for low power communications" [Inform. Process. Lett. 110 (2010) 518-520]
Multilevel threshold secret sharing based on the Chinese Remainder Theorem
A note on matching-cut in P t -free graphs
Depth of nodes in random recursive k -ary trees
Intersection and Union of Regular Languages and State Complexity
Extracting reusable components: A semi-automated approach for complex structures
Quantum period reconstruction of approximate sequences
Computation of words satisfying the "rhythmic oddity property" (after Simha Arom's works)
On the inapproximability of minimizing cascading failures under the deterministic threshold model
Constraint Preservation Through Loops
Generalized Vertex-Rankings of Trees
An Algorithm for Hazard-Free Minimization of Incompletely Specified Switching Function
A Parallel Algorithm for Circulant Tridiagonal Linear Systems
A simple test on 2-vertex- and 2-edge-connectivity
BPA bisimilarity is EXPTIME-hard
Traveling the Boundary of Minkowski Sums
The bottleneck k -MST
Conflict-Free Access of Arrays - A Counter Example
Rotation symmetry in algebraically generated cryptographic substitution tables
A note on synchronized extension systems
Deterministic Two-Way One-Head Pushdown Automata are Very Powerful
Optimal Broadcasting in the Back to Back d-ary Trees
An Algorithm for FIFO Message Delivery Among Migrating Tasks
On embedding cycles into faulty dual-cubes
A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities
On the largest matching roots of graphs with cut edges
Area-Time Tradeoffs for Bilinear Forms Computations in VLSI
Starvation-Free Secure Multiversion Concurrency Control
Relating Monotone Formula Size and Monotone Depth of Boolean Functions
The Mailman algorithm: A note on matrix-vector multiplication
A note on closure properties of logspace MOD classes
An Old Sub-Quadratic Algorithm for Finding Extremal Sets
An improved analysis of SRPT scheduling algorithm on the basis of functional optimization
From Left-Regular to Greibach Normal Form Grammars
A New Safety Test for Deadlock Avoidance
Distributed Routing in a Fault-Tolerant Multistage Interconnection Network
A Consideration of a Practical Implementation for a New Convergence Division
Cache-oblivious selection in sorted X
The power of first-order quantification over states in branching and linear time temporal logics
Towards a Theory of (Self) Applicative Communicating Processes: A Short Note
Proving empirical key-correlations in RC4
Inclusion and Exclusion Algorithm for the Hamiltonian Path Problem
An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles
An impossibility gap between width-4 and width-5 permutation branching programs
Approximation results for a bicriteria job scheduling problem on a single machine without preemption
Improving counting Bloom filter performance with fingerprints
A note on subject reduction in (→, ∃)-Curry with respect to complete developments
Linear cryptanalysis of reduced-round SPECK
An Algorithm to Find Polygon Similarity
Recognizing well-dominated graphs is coNP-complete
A Linear-Processor Algorithm for Depth-First Search in Planar Graphs
Computing a Poset from its Realizer
On the design of correct and optimal dynamical systems and games
A Kleene theorem for splitable signals
Semi-Linearity, Parikh-Boundedness and Tree-Adjunct Languages
An Algebraic Characterization of the Behaviour of Non-Sequential Systems
Perfectly Overlapped Merging and Sorting on a Two-Way Linear Array
On the Complexity of Finding the Set of Candidate Keys for a Given Set of Functional Dependencies
A secure and scalable Group Key Exchange system
Order statistics and selection methods of evolutionary algorithms
A simple matching algorithm for regular bipartite graphs
A note on maximum independent set and related problems on box graphs
Constrained multi-object auctions and b-matching
Alphabet Dependence in Parameterized Matching
A lower bound on Voronoi diagram complexity
Unambiguous Description of Chain Code Picture Languages
On the linear arboricity of graphs embeddable in surfaces
On the connection between Hamming codes, Heapsort and other methods
Simple and Efficient String Matching with k Mismatches
A Simple Solution to the Interleaved Memory Bandwidth Problem
A note on I -completeness of NP-witnessing relations
On lattices of regular sets of natural integers closed under decrementation
The strong chromatic index of sparse graphs
The Necessary and Sufficient Condition for the Worst-Case Male Optimal Stable Matching
On the minimum number of negations leading to super-polynomial savings
Static Filtering on Stratified Programs
Broadcasting with locally bounded Byzantine faults
Complexity aspects of generalized Helly hypergraphs
On Approximation Algorithms for the Minimum Satisfiability Problem
A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel Computations
Knapsack Problems for NL
A VLSI Fast Solver for Tridiagonal Linear Systems
VC-dimension of perimeter visibility domains
XCRIBL - A Hardcopy Scan Line Graphics System for Document Generation
On the Traveling Salesman Problem with a Relaxed Monge Matrix
An improved testing scheme for catastrophic fault patterns
On Space Functions Fully Constructed by Two-Dimensional Turing Machines
A Simplified NP-Complete MAXSAT Problem
Tighter bounds on non-clairvoyant parallel machine scheduling with prediction to minimize makespan
A conservative scheme for parallel interval narrowing
Path for AND-Parallel Execution of Logic Programs
Schedulability issues for EDZL scheduling on real-time multiprocessor systems
Complexity of Boolean Functions Over Bases with Unbounded Fan-In Gates
Self-Modifying Finite Automata: An Introduction
Efficient Parallel Prefix Algorithms on Multiport Message-Passing Systems
Comment on "Bounds on the Number of Functions Satisfying the Strict Avalanche Criterion"
Quasi-Boolean Equivalence
Faster output-sensitive skyline computation algorithm
Three-coloring planar graphs without short cycles
Representing point sets on the plane as permutations
The Path-Partition Problem in Block Graphs
On the Arithmetic Complexity of Matrix Kronecker Powers
Input-Output Modeling and Identification of Linear Automata
Deciding safety and liveness in TPTL
On approximability of the independent/connected edge dominating set problems
The super-connected property of recursive circulant graphs
A Note on Universal Classes of Hash Functions
A Simple Linear-Time Algorithm for Finding Path-Decompositions of Small Width
An efficient stream authentication scheme using tree chaining
Strongly Sequential and Inductively Sequential Term Rewriting Systems
Speeding up transposition-invariant string matching
A simple group mutual l-exclusion algorithm
A Lower Bound for the Time to Assure Interactive Consistency
LP decoding of codes with expansion parameter above 2/3
A note on regular Petri nets
Analysis of an Asynchronous PRAM Algorithm
Subword Complexity of a Generalized Thue-Morse Word
Random List Permutations in Place
Lower Bounds for Line Stabbing
On matrices potentially useful for tree codes
Solving the Satisfiability Problem by Using Randomized Approach
A Note on Shortest Superstrings with Flipping
Scheduling Periodically Occurring Tasks on Multiple Processors
A Simple Linear-Time Algorithm for the Recognition of Bandwidth-2 Biconnected Graphs
Counting the Number of Fault Patterns in Redundant VLSI Arrays
Lower bound proof for the size of BDDs representing a shifted addition
An Efficient Algorithm for k -Pairwise Disjoint Paths in Star Graphs
Root-restricted Kleenean rotations
A Real-Time Algorithm for the (n²-1)-Puzzle
Counting Propositional Models
A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem
Approximating the minimal lookahead needed to win infinite games
Polynomial Complete Problems in Automata Theory
Tight Lower Bounds for Minimum Weight-Triangulation Heuristics
On Homomorphic Images of Transition Graphs
On Timeout for Global Deadlock Detection in Decentralized Database Systems
On one-round reliable message transmission
A Simple Scheme to Construct k-Coteries with O(sqrt(N)) Uniform Quorum Sizes
On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings
Lower Bounds for Planar Orthogonal Drawings of Graphs
A Statistical Model for Estimating the Number of Records in a Relational Database
Some New Results on Isotonic Array Grammars
Randomly coloring simple hypergraphs with fewer colors
The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces
Parallel Trace-Driven Simulation of Packet-Switched Multiplexer Under Priority Scheduling Policy
An On-Line Algorithm to Optimize File Layout in a Dynamic Environment
The complexity of economic equilibria for house allocation markets
Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
A combinatorial property on angular orders of plane point sets
An improved lower bound on approximation algorithms for the Closest Substring problem
The shortest path in parallel
Annotated regular expressions and input-driven languages
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
A Caution on Universal Classes of Hash Functions
A general mixing strategy for the ECB-Mix-ECB mode of operation
Disjoint Hamiltonian Cycles in Recursive Circulant Graphs
Lower bounds for approximate polygon decomposition and minimum gap
A Switching Algorithm for the Solution of Quadratic Boolean Equations
Internal Merge Sorting with Delayed Selection
Parallel / Sequential Array Automata
On Linear Context-Free Languages and One-Way Multihead Automata
Fast Computation of Periodic Continued Fractions
A Specification of Parallel Problems
Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings
A Parallel O(log n) Algorithm for the Drawing of Algebraic Curves in an n*n Square
Surjective Linear Cellular Automata over Z m
Optimization, block designs and No Free Lunch theorems
Two Implementations of the Conditional Critical Region Using a Split Binary Semaphore
H-colorings of dense hypergraphs
Zero Testing of Algebraic Functions
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform
The particle swarm optimization algorithm: convergence analysis and parameter selection
A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form
Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs
Limitations of the Chase
A Separator Theorem for One-Dimensional Graphs Under Linear Mapping
An O( n 3 loglog n /log n ) time algorithm for the all-pairs shortest path problem
A note on the size of minimal covers
Large alphabets and incompressibility
Optimizing the Region Algebra is PSPACE-complete
On the complexity of model checking interval-valued discrete time Markov chains
Efficient minimization of deterministic weak omega-automata
Tag Systems Generating Thue Irreducible Sequences
Shared Authentication Token Secure Against Replay and Weak Key Attacks
Partitioned systolic architecture for modular multiplication in GF(2 m )
Edge Intersection on the Hypercube Computer
Detecting directed 4-cycles still faster
Partitioned Encryption and Achieving Simultaneity by Partitioning
On the topological complexity of ω-languages of non-deterministic Petri nets
Permutation Inversions and Multidimensional Cumulative Distribution Functions
The Magnus-Derek game revisited
Cryptanalysis of GOST R hash function
An Optimal Algorithm for Deleting the Root of a Heap
Game chromatic number of toroidal grids
An undecidable property of context-free linear orders
PalmHashing: a novel approach for cancelable biometrics
Fault-tolerant strategies in the Iterated Prisoner's Dilemma
Time-varying PSO - convergence analysis, convergence-related parameterization and new parameter adjustment schemes
Multi-Processor Scheduling and Expanders
On the Use of Extendible Hashing Without Hashing
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
Embedding a Ring in a Hypercube with Both Faulty Links and Faulty Nodes
Undecidability of Partial Order Logics
Improved bounds for dictionary look-up with one error
Nonlinear gradient neural network for solving system of linear equations
On Sparse Sets in NP - P
A functional correspondence between call-by-need evaluators and lazy abstract machines
Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems
Cliques, holes and the vertex coloring polytope
An Oracle Separating \oplus P from PP^PH
Optimal Node Ranking of Trees
Accuracy of Approximating Queueing Network Departure Processes With Independent Renewal Processes
A note on atomicity: Boosting Test&Set to solve consensus
New upper bounds on the Boolean circuit complexity of symmetric functions
Partitions with Minimum Entropy of Regions in R²
Denotational Semantics of Communicating Processes Based on a Language for Applicative Multiprogramming
On the fatness of Minkowski sums
On the P versus NP intersected with co-NP question in communication complexity
Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes
A New Formalism for Relational Algebra
On the 'Correct Prefix Property' in Precedence Parsers
Strong edge-colouring and induced matchings
The final nail in the coffin of statistically-secure obfuscator
The cost of becoming anonymous: on the participant payload in Crowds
An extension of Hall's theorem for partitioned bipartite graphs
An efficient algorithm for minimum feedback vertex sets in rotator graphs
Optimal Bucket Size for Nearest Neighbor Searching in k-d Trees
On Edge-Disjoint Spanning Trees in Hypercubes
Security pitfalls of an efficient threshold proxy signature scheme for mobile agents
A Study on Two Geometric Location Problems
Rational Search
Derivation of an O(k² log n) Algorithm for Computing Order-k Fibonacci Numbers From the O(k³ log n) Matrix Multiplication Method
A Fast Garbage Compaction Algorithm
Improved algorithm for finding next-to-shortest paths
Iterative Methods for Solving Difference Equations of the Theory of Elasticity not Depending on the Spacing of the Difference Set
Attacks on Shamir's 'RSA for Paranoids'
Set-Theoretic Problems of Null Completion in Relational Databases
The finite horizon investor problem with a budget constraint
An Efficient Scheme to Solve Two Problems for Two-Terminal Series Parallel Graphs
Cryptanalysis of RSA with a small parameter revisited
Thou shalt covet the average of thy neighbors' cakes
Splitting NP-complete sets infinitely
Separating Collections of Points in Euclidean Spaces
An Efficient Algorithm for Detection of Combined Occurrences
An Application of Ramp Schemes to Broadcast Encryption
Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane
Palindromes in the Fibonacci Word
Robustness of PSPACE-complete sets
One-inclusion hypergraph density revisited
On Some Factorizations of Infinite Words by Elements of Codes
Algorithmic results in Roman dominating functions on graphs
Analysis of a List-Update Strategy
Shorter strings containing all k-element permutations
A counterexample for the proof of implication conjecture on independent spanning trees
A Simulation Result for Two-Way Pushdown Automata
Maximum weight independent sets and cliques in intersection graphs of filaments
An Improved Bound for Detecting Looping Configurations in Deterministic DPA's
Strategies for peer-to-peer downloading
The Correctness of Nondeterministic Programs Revisited
Simulation of simultaneous safe recursion over an arbitrary structure
A note on the construction of error detecting/correcting prefix codes
A Monte Carlo Study of Parwise Comparison
A polynomial-time algorithm for computing low CP-rank decompositions
The game chromatic number and the game colouring number of classes of oriented cactuses
On the Convergence of Difference Schemes Approximating a Plane Static Problem of the Theory of Elasticity with Mixed Boundary Conditions
On the Partial Computation Principle
Programming in an Integrated Functional and Logic Language
Design and Implementation of the GNU Prolog System
Polytypic Programming With Ease
A Proof Procedure for Functional First Order Logic Programs with Non-Deterministic Lazy Functions and Built-in Predicates
A Game-based Architecture for Developing Interactive Components in Computational Logic
Complete Selection Functions for a Lazy Conditional Narrowing Calculus
Improving Deterministic Computations in Lazy Functional Logic Languages
Complexity Analysis of Late Binding in Dynamic Object-Oriented Languages
Reasoning about Redundant Patterns
Optimizing Mark-Scan Garbage Collection
On the Correctness of the Replacement Operation for CLP Modules
Editorial: Selected Papers from the Joint International Symposium PLILP/ALP'98
On Strong Normalization of Explicit Substitution Calculi (Short Note)
Metatheoretic Results for a Modal lambda-Calculus
Composing Complete and Partial Knowledge
Bottom-up Partial Deduction of Logic Programs
From Set to Hyperset Unification
Solving Constraints for an Instance of an Extended CLP Language over a Domain Based on Real Numbers and Herbrand Terms
Embedding Propagators in a Concurrent Constraint Language
Encapsulating Non-Determinism in Functional Logic Computations
A Practical Partial Evaluation Scheme for Multi-Paradigm Declarative Languages
Calculi of Generalized beta-Reduction and Explicit Substitutions: The Type-Free and Simply Typed Versions
Metalevel Interval Arithmetic and Verifiable Constraint Solving
Subject Reduction of Logic Programs as Proof-Theoretic Property
Context-sensitive Computations in Functional and Functional Logic Programs
Editorial: Functional and Logic Programming
A Uniform Proof-theoretic Foundation for Abstract Paraconsistent Logic Programming
A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations
On the Inference od Structured Recursive Effects with Subtyping
A Minimality Study for Set Unification
Fundamentals of Module Logic for Distributed Object Systems
Compile-Time Pointer Reversal
Beyond Depth-First Strategies: Improving Tabled Logic Programs through Alternative Scheduling
Thunk Lifting: Reducing Heap Usage in an Implementation of a Lazy Functional Language
Realizing Modularity in lambdaProlog
Probabilistic Declarative Debugging
Polymorphic Types in Functional Logic Programming
Semantics for using Stochastic Constraint Solvers in Constraint Logic Programming
Editorial: the Sixth International Symposium on Functional and Logic Programming
Typed Static Analysis: Application to the Groundness Analysis of Typed Prolog
The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation
Formalizing Two Fixed Point Semantics for HH(C)
Dynamic Predicates in Functional Logic Programs
Better Consumers for Program Specializations
Heap Memory Management in Prolog with Tabling: Principles and Practice
Improved Register Usage for Functional Programs through Multiple Function Versions
A Declarative Debugging Scheme
A Simply Typed Context Calculus with First-class Environments
Aggregation in Functional Query Languages