yusuke1997/dblp-id-title huggingface dataset:
Modeling the reliability of large dynamic distributed non-homogeneous networks
A lower bound method for quantum circuits
Security analysis of SIMECK block cipher against related-key impossible differential
On Using the Fourier Transform to Learn Disjoint DNF
A semantics of sequence diagrams
Improving a Family of Approximation Algorithms to Edge Color Multigraphs
Dispersion problem on a convex polygon
Adjacency queries in dynamic sparse graphs
The pessimistic diagnosability of Split-Star Networks under the PMC model
A Formula for the Number of Spanning Trees of a Multi-Star Related Graph
Agent Search in Uniform b-Ary Trees: Multiple Goals and Unequal Costs
An Efficient Distributed Termination Test
On the Reduction of LR(k) Parsers
Multiple Access to a Tree in the Context of Readers and Writers Problem
A Note on a Theorem by Ladner
Partitioning extended P 4 -laden graphs into cliques and stable sets
On the advice complexity of online bipartite matching and online stable marriage
Detecting Cycles Through Three Fixed Vertices in a Graph
A 3-Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem
A Comparison of Simulation Results and a Mathematical Model of a Multiprogramming System
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2)
A multiple-file write scheme for improving write performance of small files in Fast File System
On the Deterministic Complexity of Factoring Polynomials over Finite Fields
Iterative Improvement of Vertex Covers
A New Method for Implementing LR(k) Tables
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition
An Inproved Algorithm for Retrieving Fuzzy Information from Two Systems
Error Bounds on Disk Arrangement Using Frequency Information
Lower Bounds of the Complexity of Linear Algebras
An Optimal Algorithm for Sink-Finding
A Theorem on the Relation Between BSR k and BSR +
Recursiveness of Monotonic Array Grammars and a Hierarchy of Array Languages
Nondominated local coteries for resource allocation in grids and clouds
Base invariance of feasible dimension
On the geodetic number of complementary prisms
A Note on the Ambiguity of Context-Free Grammars
Slow Optimally Balanced Search Strategies VS. Cached Fast Uniformly Balanced Search Strategies
Security of most significant bits of g x 2
The State Complexity of \Sigma * L and its Connection with Temporal Logic
An Efficient Parallel Algorithm for Random Sampling
Exponential space complexity for OBDD-based reachability analysis
A Note on the Higher Moments of the Expected Behavior of Straight Insertion Sort
Oriented chromatic number of grids is greater than 7
Kolmogorov random graphs only have trivial stable colorings
An analytical upper bound on the minimum number of recombinations in the history of SNP sequences in populations
A Comparison of Sixteen Quality Metrics for Object-Oriented Design
Parallel parsing of operator precedence grammars
Non-uniform birthday problem revisited: Refined analysis and applications to discrete logarithms
On the embedding degree of reductions of an elliptic curve
Square Rooting by Iterative Multiply-Additions
Complexity Measures for Concurrent Programs Based on Information-Theoretic Metrics
Sending compressed messages to a learned receiver on a bidirectional line
A Note on Grammatical Covers
On the Complexity of Recursive Path Orderings
Feedback Automata and Their Languages
Simultaneous image fusion and demosaicing via compressive sensing
Three colorability characterized by shrinking of locally connected subgraphs into triangles
The strong distance problem on the Cartesian product of graphs
Relative to a Random Oracle, P/Poly is not Measurable in EXP
On multiple output bent functions
Space efficient and time optimal distributed BFS tree construction
A Simple Sub-Quadratic Algorithm for Computing the Subset Partial Order
Sponsored search, market equilibria, and the Hungarian Method
Improved hardness results for unique shortest vector problem
A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs
Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
Stream VByte: Faster byte-oriented integer compression
The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof
Hitting sets when the VC-dimension is small
An Improved Algorithm to Check for Polygon Similarity
The Towers of Antwerpen Problem
A Simple Algorithm for Determining the Envelope of a Set of Lines
One-Way Permutations in NC0
Practical committing attacks against Rocca-S
Coding distributive lattices with Edge Firing Games
Reflected min-max heaps
Transformations for Communication Fairness in CSP
Number-Theoretic Functions Which Are Equivalent to Number of Divisors
Analyzing the Held-Karp TSP Bound: A Monotonicity Property with Application
Comments on "Circuit ciphertext-policy attribute-based hybrid encryption with verifiable delegation"
Note on Max Lin-2 above Average
Feature Evaluation with Quadratic Mutual Information
A note on computing set overlap classes
Scheduling time-constrained multicast messages in circuit-switched tree networks
An alternate proof of Statman's finite completeness theorem
Two-level hub Steiner trees
The Benefits of External Wires in Single Row Routing
Improved approximation algorithms for the Min-Max Selecting Items problem
Correcting matrix products over the ring of integers
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
The Parallel Complexity of Coarsest Set Partition Problems
Notes on a hierarchical scheduling problem on identical machines
A New Variation on Hypercubes with Smaller Diameter
A dynamic programming solution to a generalized LCS problem
Approximaely Satisfied Properties of Systems and Simple Language Homomorphisms
On radio k -labeling of the power of the infinite path
A faster computation of the most vital edge of a shortest path
Concurrent Execution of Transaction Copies
Analysis of Algorithms on Problems in General Abelian Groups
An Algorithm for Verifying Equations of Morphisms in a Category
Incremental String Matching
Processor-Efficient Implementation of a Maximum Flow Algorithm
Fault-Tolerant Parallel k Selection Algorithm in n-Cube Networks
Efficient Simulations by a Biased Coin
A First-In-First-Out Buffered Cyclic Memory
Algorithms to Count Paths and Cycles
Bounds on the Weighted Path Length of Binary Trees
A New Algorithm for Finding Weak Components
Shortest Routing in Trivalent Cayley Graph Network
On Szilard's Languages Associated to a Matrix Grammar
An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes
On the density and discrepancy of a 2D point set with applications to thermal analysis of VLSI chips
Multidimensional On-Line Bin-Packing: An Algorithm and its Average-Case Analysis
A DSS based on optimizer tools and MTS meta-heuristic for the Warehousing Problem with Conflicts
A note on the spectral characterization of correlation immune Boolean functions
Optimal per-edge processing times in the semi-streaming model
The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy
NQP C = co-C = P
On the limits of efficient teachability
A simple reduction from maximum weight matching to maximum cardinality matching
On computing Pareto optimal paths in weighted time-dependent networks
On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions
Fault Tolerance of the Star Graph Interconnection Network
On disjoint maximal independent sets in graphs
Improving the Efficiency of Depth-First Search by Cycle Elimination
A Linear Algorithm for the Domination Number of a Tree
Path bipancyclicity of hypercubes
Reduction of OBDDs in Linear Time
Extension Functions for Multiset Orderings
A weakest failure detector-based asynchronous consensus protocol for f<n
Ring embedding in faulty honeycomb rectangular torus
A Fully Parallel Algorithm for Residue to Binary Conversion
An Upper Bound on Buffer Size for Join Operation Using Nonclusterd Indexes
2-Covered paths by a set of antennas with minimum power transmission range
Zen Puzzle Garden is NP-complete
The Power of Geometric Duality Revisited
Separating some splicing models
Equivalency reasoning to solve a class of hard SAT problems
On ideal semicomplete digraphs
Improved neural solution for the Lyapunov matrix equation based on gradient search
A Fast and Simple Randomized Parallel Algorithm for Maximal Matching
A clustering algorithm based on graph connectivity
Using Reliability Analysis to Estimate the Number of Generations to Convergence in Genetic Algorithms
Hybridsort Revisited and Parallelized
Optimal Speed-Up Algorithms for Template Matching on SIMD Hypercube Multiprocessors with Restricted Local Memory
A Faster Lexicographical N Queens Algorithm
A note on mixed tree coloring
Recursive (omega)o-Rule for Proof Systems
Reconstructing graphs from cut-set sizes
Non-contractible non-edges in 2-connected graphs
Detecting Conjunctions of Global Predicates
A heuristic algorithm for minimizing mean flow time with unit setups
Determining the specificity of terms using inside-outside information: a necessary condition of term hierarchy mining
Arboral satisfaction: Recognition and LP approximation
Generational Cyclic Reference Counting
Globally minimal defensive alliances
Fixed-Point Calculus
Dynamic asymmetric communication
Notes on Looping Deterministic Two-Way Pushdown Automata
Generalized mirror descents with non-convex potential functions in atomic congestion games: Continuous time and discrete time
Solving Combinatorial Search Problems by Intelligent Backtracking
Efficient Parallel k Selection Algorithm
A linear space algorithm for computing a longest common increasing subsequence
Normalised Squeeziness and Failed Error Propagation
Deterministically testing sparse polynomial identities of unbounded degree
On the cubicity of bipartite graphs
Sharpening Occam's razor
A decidable class of problems for control under partial observation
On Bounds for a Board Covering Problem
Fault-Tolerant Routing in Unique-Path Multistage Interconnection Networks
Periodic and Sturmian languages
Node-pancyclicity and edge-pancyclicity of crossed cubes
A Characterization of Multivalued Dependencies Equivalent to a Join Dependency
On Fixpoint Arithmetic and Infinite Time Turing Machines
Scheduling jobs under decreasing linear deterioration
Efficient preprocessing of XML queries using structured signatures
Verifiable secret sharing in a total of three rounds
Partial Evaluation of Pattern Matching in Strings
Model-based specification
Analysis of N-Trees
The computational complexity of some explainable clustering problems
Dynamic bin packing with unit fraction items revisited
Making Bubblesort Recursive
On the Normalization of Relational Databases
The Inaccessible Set: A Classification by Query Type of Security Risks in Statistical Database
A Note on Recursive Properties of the de Bruijn, Kautz and FFT Digraphs
Boyce-Codd Normal Form and Object Normal Forms
Program Schemata with Polynomial Bounded Counters
Improvements on the Accelerated Integer GCD Algorithm
The Optimal Effectiveness Metric for Parallel Application Analysis
A deterministic algorithm for fitting a step function to a weighted point-set
Maximal matching stabilizes in time O(m)
The Universal Space for Parallel Computation
Space-efficient Huffman codes revisited
Online constrained optimization with recourse
Reducing inference control to access control for normalized database schemas
A Randomized NC Algorithm for the Maximal Tree Cover Problem
Relating size and width in variants of Q-resolution
On the Enlargement of the Class of Regular Languages by the Shuffle Closure
Yield-Languages of Two-Way Pushdown Tree Automata
The Graph of Multiplication is Equivalent to Counting
On-line construction of parameterized suffix trees for large alphabets
A linear time recognition algorithm for proper interval graphs
An Introduction to Three Algorithms for Sorting in Situ
Corrigendum to "On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles" [Information Processing Letters 110 (24) (2010) 1084-1087]
Determining Whether a Groupoid is a Group
LP-based solution methods for the asymmetric TSP
Fast Approximations to Discrete Optimal Quantization
A theoretical limit for safety verification techniques with regular fix-point computations
An Note on Finding Compact Sets in Graphs Represented by an Adjacency List
Grant Levels in an Authorization Mechanism
Fraction interpolation walking a Farey tree
Quantum computing and quadratically signed weight enumerators
A combinatorial property of the factor poset of a word
The complexity of linear programming in (gamma, kappa)-form
Multicasting in the hypercube, chord and binomial graphs
Pipelining Tree-Structured Algorithms on Simd Architectures
Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs
Local Authentication in Insecure Environments
An Algorithm to Construct a Compact B-Tree in Case of Ordered Keys
A Note on Infinite Trees
An Observation on Scattered Grammars
A Polynomial Time Solution for Labeling a Rectlinear Map
Operational semantics: Concepts and their expression
A Characterization of Finitary Bisimulation
Good and Semi-Strong Colorings of Oriented Planar Graphs
A Controlled Quantification in Parsing of Montague Grammar
Nearly-Perfect Hypergraph Packing is in NC
On Totalistic Systolic Networks
An Optimal Scheduling Algorithm for Preemptable Real-Time Tasks
Computing minimal solutions to the ring loading problem
Two Results on Tables
Finding a longest nonnegative path in a constant degree tree
Improved bounds for rectangular monotone Min-Plus Product and applications
Splitmerge - A Fast Stable Merging Algorithm
On the Area of Binary Tree Layouts
Preservation of Integrity Constraints in Definite DATALOG Programs
A Note on Precedence Functions
Fast Composition of Sparse Maps
Acyclic chromatic index of planar graphs with triangles
Proximity and average eccentricity of a graph
An O(n log n) Lower Bound for Decomposing a Set of Points into Chains
Packing batches of cubes into a single bin
Rate Monotonic Scheduling in Hard Real-Time Systems
A Circuit for Exact Summation of Floating-Points Numbers
An Omega(nlogn) lower bound for computing the sum of even-ranked elements
Chain rotations: A new look at tree distance
An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
Drawing Straight Lines with a Pyramid Cellular Automaton
Incidence coloring of Cartesian product graphs
Embedding even cycles on folded hypercubes with conditional faulty edges
A construction of one-point bases in extended lambda calculi
Accelerated diffusion algorithms for dynamic load balancing
Leftmost one Computation on Meshes with Row Broadcasting
The Cover Time of a Regular Expander is O(n log n)
Batch Checking with Applications to Linear Functions
Minimum Area Joining of k Compacted Cells
A characterization of average case communication complexity
A logical approach to multicut problems
Constant-Time Parallel Recognition of Split Graphs
A (Delta/2)-Approximation Algorithm for the Maximum Independent Set Problem
Detecting masquerades in intrusion detection based on unpopular commands
Airports and railways with unsplittable demand
A Matched Approximation Bound for the Sum of a Greedy Coloring
How many oblivious robots can explore a line
An O(log n) Algorithm for Computing the n th Element of the Solution of a Difference Equation
Errata: A Fast Method for Interpolation Using Preconditioning
The Level-Ancestor problem on Pure Pointer Machines
On some properties of the NML estimator for Bernoulli strings
An Adaptive Algorithm for Finding a Covering Hypersphere
Compact searchable static binary trees
A Fault-Tolerant Hexagonal Systolic Array
Relations as Programming Language Elements
Scheduling Unit-Time Tasks With Integer Release Times and Deadlines
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
Dominating set based exact algorithms for 3-coloring
A Divide-and-Conquer Approach to General Context-Free Parsing
A Systematic Analysis of Splaying
A Note on an Improved Bisection Algorithm
A Technique for Implementing Backtrack Algorithms and its Application
On a Problem Connected with Topological Sorting
On the Expressive Power of the Relational Algebra
Route Selection with Multiple Metrics
Analogues of Chaitin's Omega in the computably enumerable sets
Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree
A Novel Hybrid Slot Allocation Mechanism for 802.11e EDCA Protocol
Ring embedding in faulty pancake graphs
An algorithm with linear expected running time for string editing with substitutions and substring reversals
A More General Sufficient Condition for Partition Testing to be Better than Random Testing
An Algebraic Semantics of Notional Entailment Logic Cn
Algorithmic aspects of k-tuple total domination in graphs
Improvements of generalization of threshold signature and authenticated encryption for group communications
On plane spanning trees and cycles of multicolored point sets with few intersections
Comments on "Proportionate flowshops with general position dependent processing times" [Inf. Process. Lett. 111 and "Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection" [Inf. Process. Lett. 132 (2018) 39-43]
Efficient Pattern Searching Over Large Dictionaries
The optimal read-once branching program complexity for the direct storage access function
Interprocedural analysis vs. procedure integration
An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
Counting edge crossings in a 2-layered drawing
An Infinite Square-Free co-CFL
On the complexity of some restricted variants of Quotient Pigeon and a weak variant of Kőnig
Computing the Optimal IO Sequences of a Protocol in Polynomial Time
Fast estimation of fractal dimension and correlation integral on stream data
Improved algorithm for the widest empty 1-corner corridor
Partial Values in a Tabular Database Model
Calculating sharp adaptation rules
On Efficient Computations of Costs of Paths on a Grid Graph
Towards the Minimum Set of Primitive Relations in Temporal Logic
The vertex cover P 3 P3 problem in cubic graphs
A note on the complexity of matching patterns with variables
A Technique for Adding Range Restrictions to Generalized Searching Problems
Cycles embedding in hypercubes with node failures
A Reconfiguration Algorithm for Fault Tolerance in a Hypercube Multiprocessor
Short proofs for some symmetric Quantified Boolean Formulas
More Information Theoretical Inequalities to be Used in Secret Sharing?
A Fast Parallel Algorithm for the Closest Pair Problem
Convex Hull of a Finite Set of Points in Two Dimensions
Holographic reduction for some counting problems
A Fast Parallel Coloring of Planar Graphs with Five Colors
A power-set construction for reducing Büchi automata to non-determinism degree two
Finding the Upper Envelope of n Line Segments in O(n log n) Time
A Kleene characterization of computability
Geometric stable roommates
A note on 3-choosability of planar graphs
Finding Biconnected Components in O(n) Time for a Class of Graphs
Public-key encryption scheme with optimal continuous leakage resilience
A lower-variance randomized algorithm for approximate string matching
Optimal suffix sorting and LCP array construction for constant alphabets
Alternation with a Pebble
Flip-pushdown automata with k pushdown reversals and E0L systems are incomparable
Minimum-cost single-source 2-splittable flow
Recognizability of the support of recognizable series over the semiring of the integers is undecidable
On the Polynomial IO-Complexity
A Note on the Equivalence Problem of Rational Formal Power Series
A sufficient condition for a planar graph to be 3-choosable
Query containment under bag and bag-set semantics
Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model
Faster parameterized algorithm for pumpkin vertex deletion set
Optimal broadcasting for locally twisted cubes
Cryptanalysis of a round optimal lattice-based multisignature scheme
On a Hierarchy of Classes for Nested Databases
On the geometry of similarity search: Dimensionality curse and concentration of measure
The Processor Identity Problem
External matrix multiplication and all-pairs shortest path
Efficient precomputation schemes of kP+IQ
On Lookahead in the List Update Problem
A New Lower Bound on the Expected Size of Irredundant Forms for Boolean Functions
A Note on a Conjecture of Kam and Ullman Concerning Statistical Databases
Broadcasting in a Hypercube when Some Calls Fail
On Modal mu-Calculus and Büchi Tree Automata
Optimal Multidisk Partial Match File Designs
New efficient algorithms for the LCS and constrained LCS problems
Algebraic Techniques in Communication Complexity
Isomorphic factorization, the Kronecker product and the line digraph
A Uniform Model for the Storage Utilization of B-Tree-Like Structures
Statistical delay analysis on an ATM switch with self-similar input traffic
Distributed Algorithms for Depth-First Search
Performance of Distributive Partitioned Sort in a Demand Paging Environment
Some observations on LR-like parsing with delayed reduction
A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem
Highly nonlinear balanced Boolean functions with good local and global avalanche characteristics
Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule
Correcting noisy exponentiation black-boxes modulo a prime
On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs
Addendum: Computing Multivariate Polynomials in Parallel
A fast algorithm for the generalized k-keyword proximity problem given keyword offsets
Number of mutual connections in neighborhoods and its application to self-diagnosable systems
Domination in Convex and Chordal Bipartite Graphs
Bounds on the Fourier coefficients of the weighted sum function
Bounding the maximum size of a minimal definitive set of quartets
Bisimulation is Two-Way Simulation
Characterization of repetitions in Sturmian words: A new proof
Discrete Logarithm and Minimum Circuit Size
Memory-restricted black-box complexity of OneMax
Wirelength of 1-fault hamiltonian graphs into wheels and fans
On fixed size projection of simplicial polyhedra
Fishing for minimum evolution trees with Neighbor-Nets
Identifying Periodic Occurrences of a Template with Applications to Protein Structure
An algorithm for solving the longest increasing circular subsequence problem
Some Remarks on Subclass Containment Problems for Several Classes of DPDA's
A Finite 5-Pebble-Automaton Can Search Every Maze
Formal Correctness Proofs of a Nondeterministic Program
An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph
A Note on Construction of Treaps and Cartesian Trees
Upper Bounds on the Size of LR(k) Parsers
Drawing K 2, n : A lower bound
Erratum: A Decidability Theorem for a Class of Vector-Addition Systems
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs
A Note on a New Data Structure for in-the-Past Queries
Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time
E=I+T: The internal extent formula for compacted tries
Parallelism and the Feedback Vertex Set Problem
Loop-free Gray code algorithm for the e-restricted growth functions
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
On the average complexity for the verification of compatible sequences
The minimum spanning tree problem with non-terminal set
An Optimal Parallel Adaptive Sorting Algorithm
Monochromatic geometric k-factors for bicolored point sets with auxiliary points
Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring F2+vF2
Leader Election in the Presence of n-1 Initial Failures
Affine-evasive sets modulo a prime
Learning Conjunctions with Noise under Product Distributions