yusuke1997/dblp-id-title huggingface dataset:
Parallel Algorithms for Solvable Permutation Groups
Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines
Two Cartesian closed categories of information algebras
Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
When Won't Membership Queries Help?
Backdoors into heterogeneous classes of SAT and CSP
Controlling entity integrity with key sets
How heavy independent sets help to find arborescences with many leaves in DAGs
The complexity of (Pk,Pℓ)-arrowing
Approximation algorithms for M AX -3-C UT and other problems via complex semidefinite programming
Model checking quantum Markov chains
Final Algebra Semantics and Data Type Extensions
SARP: A dynamically readjustable period size proactive routing protocol for MANETs
On the Efficiency of Transforming Database Logic Programs
Prefix-suffix duplication
A limitation of cell division in tissue P systems by PSPACE
"Global" Graph Problems Tend to Be Intractable
Data Independence of Read, Write, and Control Structures in PRAM Computations
Sorting signed permutations by reversals, revisited
Catalan structures and dynamic programming in H-minor-free graphs
A Free Construction of Dynamic Terms
Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory
XML compression techniques: A survey and comparison
On Two-way Multihead Automata
Computational Arithmetic Geometry I. Sentences Nearly in the Polynomial Hierarchy
Congruence Arithmetic Algorithms for Polynomial Real Zero Determination
Hashing and canonicalizing Notation 3 graphs
Serialization of Concurrent Programs
Ambient Abstract State Machines with applications
Analysis of Two Gradient-Based Algorithms for On-Line Regression
State complexity of one-way quantum finite automata together with classical states
Computing source-to-target shortest paths for complex networks in RDBMS
Vertex cover might be hard to approximate to within 2-epsilon
Symmetry in Self-Correcting Cellular Automata
Narrow sieves for parameterized paths and packings
Deterministic One-Counter Automata
A k-anonymous approach to privacy preserving collaborative filtering
A brief overview of network algorithms
Efficient learning algorithms yield circuit lower bounds
On the Computational Power of Pushdown Automata
Trade-Offs between Communication and Space
Asymmetric multi-path division communications in underwater acoustic networks with fading channels
On the Convergence of Query Evaluation
Polynomial hierarchy graph properties in hybrid logic
Linking indexing data structures to de Bruijn graphs: Construction and update
Exploiting hidden structure in selecting dimensions that distinguish vectors
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations
Decision Procedures for Surjectivity and Injectivity of Parallel Maps for Tessellation Structures
Precisely deciding CSL formulas through approximate model checking for CTMCs
Design of Desirable Relational Database Schemes
Equilibria problems on games: Complexity versus succinctness
Editorʼs foreword
A Hierarchy of Real-Time Deterministic Languages and Their Equivalence
An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees
Context-Free Languages of Sub-exponential Growth
Subrecursive Program Schemata I & II: I. Undecidable Equivalence problems; II. Decidable Equivalence Problems
A QoS-aware composition method supporting cross-platform service invocation in cloud environment
Algorithms for Updating Minimal Spanning Trees
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem
Linear-time 2-party secure merge from additively homomorphic encryption
Qualitative Relativizations of Complexity Classes
On kernels for d-path vertex cover
Packet latency of deterministic broadcasting in adversarial multiple access channels
Competitive On-line Scheduling of Continuous-Media Streams
Search-space reduction via essential vertices revisited: Vertex multicut and cograph deletion
Open-Addressing Hashing with Unequal-Probability Keys
Pebbling with an Auxiliary Pushdown
Lower Bounds for the Union-Find and the Sp;it-Find Problem on Pointer Machines
Boolean language operations on nondeterministic automata with a pushdown of constant height
Managing Conflicts Between Rules
The Calculus of Context-aware Ambients
A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity
A novel memory allocation scheme for memory energy reduction in virtualization environment
Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes
The complexity of finding small separators in temporal graphs
Comparing trees via crossing minimization
The 2CNF Boolean formula satisfiability problem and the linear space hypothesis
Learning Distributions by Their Density Levels: A Paradigm for Learning without a Teacher
Colouring diamond-free graphs
Concurrent Counting
Products of matrices and recursively enumerable sets
Decidable problems in substitution shifts
Towards highly available and scalable high performance clusters
Destroying densest subgraphs is hard
MCMG simulator: A unified simulation framework for CPU and graphic GPU
On Completeness Under Random Reductions
Finite-Turn Checking Automata
Strong partial clones and the time complexity of SAT problems
Continuous Self-Reproduction
Hyperplane separation technique for multidimensional mean-payoff games
Transaction Protection by Beacons
Structure Preserving Reductions among Convex Optimization Problems
Some Logical Characterizations of the Dot-Depth Hierarchy and Applications
Synonymous theories and knowledge representations in answer set programming
One-dimensional quantum walks with absorbing boundaries
Uniform Normal Form for General Time-Bounded Complexity Classes
Searching by heterogeneous agents
On the Nonexistence of Close-Packed Double Hamming-Error-Correcting Codes on q=7 Symbols
An empirical framework for user mobility models: Refining and modeling user registration patterns
The tree-child network inference problem for line trees and the shortest common supersequence problem for permutation strings
Improved distance sensitivity oracles with subcubic preprocessing time
A Note on Pattern Reproduction in Tessellation Structures
Test Sets and Checking Words for Homomorphism Equivalence
Complexity of verification in self-assembly with prebuilt assemblies
On the minmax regret path median problem on trees
On pseudoknot-bordered words and their properties
The weak aggregating algorithm and weak mixability
An Algorithm for Handling Many Relational Calculus Queries Efficiently
Analysis of Bounded Linear Cellular Automata Based on a Method of Image Charges
Algebraic and Calculus Query Languages for Recursively Typed Complex Objects
Dot-Depth of Star-Free Events
Explicit Constructions of Linear-Sized Superconcentrators
Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks
Synchronous counting and computational algorithm design
Reconstructing an ancestral genome using minimum segments duplications and reversals
Bounded Action Machines: Toward an Abstract Theory of Computer Structure
Topological tracking of connected components in image sequences
Monotone simulations of non-monotone proofs
One-variable context-free hedge automata
Practically stabilizing SWMR atomic memory in message-passing systems
Tessellations with Local Transformations
Distributed Algorithms for Selection in Sets
Categorical aspects of inducing closure operators on graphs by sets of walks
Secure outsourcing of modular exponentiations under single untrusted programme model
Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies
An Axiomatic Approach to Voronoi-Diagrams in 3D
Practical Arbitrary Lookahead LR Parsing
On the induced matching problem
A formal semantics for the Taverna 2 workflow model
Combinatorial Systems. I. Cylindrical Problems
A 1.5-approximation algorithm for sorting by transpositions and transreversals
A Semantics for Complex Objects and Approximate Answers
Subproblem ordering heuristics for AND/OR best-first search
Some Results Concerning Proofs of Statements about Programs
Counting complexity of propositional abduction
Recognizable series on graphs and hypergraphs
Decidable weighted expressions with Presburger combinators
A Semigroup Characterization of a Linearly Realisable Automaton over GF(p)
A new efficient indexing algorithm for one-dimensional real scaled patterns
Towards a Hierarchy of Nets
Classes of Discrete Optimization Problems and Their Decision Problems
Reversibility and Surjectivity Problems of Cellular Automata
Parameterized Pattern Matching: Algorithms and Applications
Remarks on the Approximation of Some Nonlinear Elliptic Equations
Three Theorems Concerning Principal AFLs
The Learnability of Unions of Two Rectangles in the Two-Dimensional Discretized Space
Lower Bounds on the Multiparty Communication Complexity
Splitting a Context-Sensitive Set
Contextuality in multipartite pseudo-telepathy graph games
Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
Answering "Why Empty?" and "Why So Many?" queries in graph databases
Pseudorandom Generators without the XOR Lemma
The Power of the Middle Bit of a #P Function
Decidability of order-based modal logics
A peer-to-peer recommender system for self-emerging user communities based on gossip overlays
On Polynomial Time One-Truth-Table Reducibility to a Sparse Set
Constraint satisfaction with succinctly specified relations
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Context-free coalgebras
Quantum certificate complexity
Randomness and reducibility
Consumer-centric QoS-aware selection of web services
Cubature and Tchakaloff Cone
The Analysis of Double Hashing
Affine projections of symmetric polynomials
Task partitioning and priority assignment for distributed hard real-time systems
Online bin packing with cardinality constraints resolved
Relative to a Random Oracle, NP Is Not Small
Implicit Data Structures for Fast Search and Update
Computational complexity of compaction to irreflexive cycles
Identifying locations from geospatial trajectories
Spanners in sparse graphs
Beyond operator-precedence grammars and languages
The Method of Closest Approach for Finding Nonisolated Zeros of Functions
Automaton Introspection
EC3: Elastic Cloud Computing Cluster
NP-Complete Scheduling Problems
Efficient testing and matching of deterministic regular expressions
Undecidability of PDL with L={a^(2i)|i>=0}
Equations over sets of integers with addition only
On DIL Schemes Simulated by D0L Schemes
Labeled sample compression schemes for complexes of oriented matroids
Network trust management in emergency situations
A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
Two algorithms for LCS Consecutive Suffix Alignment
Group Theoretic Characterization of Linear Permutation Automata
Subexponential algorithm for d -cluster edge deletion: Exception or rule?
Generalized Overlap Resolvable Grammars and Their Parsers
Open Problems in "Systems That Learn"
Heuristics for Semirandom Graph Problems
Solving problems on generalized convex graphs via mim-width
Time-Space Tradeoffs for Satisfiability
A Process-Calculus Analysis of Concurrent Operations on B-Trees
An optimal self-stabilizing strarvation-free alternator
A novel one-time password mutual authentication scheme on sharing renewed finite random sub-passwords
Algorithms and hardness results for the (k,ℓ)-cover problem
Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems
On the Power of Safe Locking
Packing arc-disjoint cycles in oriented graphs
A Trivial Algorithm Whose Analysis Isn't
The Copying Power of One-State Tree Transducers
The possible winner with uncertain weights problem
Pattern matching with address errors: Rearrangement distances
Learnability: Admissible, Co-Finite, and Hypersimple Languages
Error Detection in Formal Languages
The tree-generative capacity of combinatory categorial grammars
Bracketed Context-Free Languages
Some Decision Problems Concerning Sequential Transducers and Checking Automata
Denials leak information: Simulatable auditing
The Complexity of Propositional Closed World Reasoning and Circumscription
On list update with locality of reference
Erratum: Tree Acceptors and Some of Their Applications
Contraction Algebras and Unification of (Infinite) Terms
First-Order Necessary Conditions for Generalized Optimization Problems
Parameterized complexity of the k-arc Chinese Postman Problem
A dynamic prime number based efficient security mechanism for big sensing data streams
The weighted HOM-problem over fields
In search of an easy witness: exponential time vs. probabilistic polynomial time
Relating description complexity to entropy
Networks of polarized multiset processors
Automated synthesis of application-layer connectors from automata-based specifications
On Interpolating Arithmetic Read-Once Formulas with Exponentiation
On Closure Properties of #P in the Context of PF ° #P
A taxonomy for nearest neighbour queries in spatial databases
Algebraic hierarchical graph transformation
On the fast delivery problem with one or two packages
Properties of Syntax Directed Translations
Datalog and constraint satisfaction with infinite templates
Graphs are not universal for online computability
Assigning times to minimise reachability in temporal graphs
Surjectivity of Nondeterministic Parallel Maps Induced by Nondeterministic Cellular Automata
Adversary lower bounds for nonadaptive quantum algorithms
On computing large temporal (unilateral) connected components
Feature-based opinion mining and ranking
First-order query rewriting for inconsistent databases
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
The Best Nondeterministic Representations of Finite Orderings
Band-restricted diagonally dominant matrices: Computational complexity and application
View disassembly: A rewrite that extracts portions of views
Content-based image retrieval approach for biometric security using colour, texture and shape features controlled by fuzzy heuristics
Scheduling of online compute-intensive synchronized jobs on high performance virtual clusters
Feedforward Nets for Interpolation and Classification
Special issue on computational molecular biology
The identification of positive clones in a general inhibitor model
Automorphism Groups and Factor Automata of Strongly Connected Automata
A three-string approach to the closest string problem
Reproduction in Tessellation Structures
Models of a K-Rational Identity System
On Correctness of Nonserializable Executions
Threshold circuit lower bounds on cryptographic functions
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Inherent Complexity of Recursive Queries
Verifying whether one-tape Turing machines run in linear time
On the limits of gate elimination
Pumping Lemmas for Term Languages
A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem
Simplified proof of the blocking theorem for free-choice Petri nets
Tight hierarchy of data-independent multi-head automata
An Improved Simulation Result for Ink-Bounded Turing Machines
Steps toward accurate reconstructions of phylogenies from gene-order data
The price of validity in dynamic networks
Analytic performance comparison of hypercubes and star graphs with implementation constraints
A Method for Stepwise Refinement and Abstraction of Petri Nets
How Easy is Local Search?
On Inverse Deterministic Pushdown Transductions
Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem
Prediction, Learning, Uniform Convergence, and Scale-Sensitive Dimensions
Optimal channel utilization with limited feedback
Efficiently parallelizable problems on a class of decomposable graphs
An efficient fully polynomial approximation scheme for the Subset-Sum Problem
Towards more precise rewriting approximations
Interval-valued fuzzy coimplications and related dual interval-valued conjugate functions
Priority Promotion with Parysian flair
Three One-Way Heads Cannot Do String Matching
Authorship verification of e-mail and tweet messages applied for continuous authentication
Ordered Vertex Removal and Subgraph Problems
Discovery of stop regions for understanding repeat travel behaviors of moving objects
On the parameterized complexity of Grid Contraction
Logics for reasoning about cryptographic constructions
Decision Problems for Patterns
Algebras for Querying Text Regions: Expressive Power and Optimization
On speculative replication of transactional systems
Clearing directed subgraphs by mobile agents: Variations on covering with paths
Robust Gift Wrapping for the Three-Dimensional Convex Hull
Randomized Query Processing in Robot Path Planning
One Counter Languages and the IRS Condition
Output String Languages of Compositions of Deterministic Macro Tree Transducers
Deciding whether a regular language is generated by a splicing system
Conjunctive query answering in the description logic SH using knots
Public key encryption resilient to leakage and tampering attacks
Hardness vs Randomness
Faster winner determination algorithms for (Colored) Arc Kayles
Hazard Analysis of Asynchronous Circuits in Muller-Bartky's Sense
Lower bounds for the transition complexity of NFAs
Building squares with optimal state complexity in restricted active self-assembly
Information flow analysis of scientific workflows
Scaling up workflow-based applications
N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable
Representative families: A unified tradeoff-based approach
Latency, capacity, and distributed minimum spanning trees
The parametrized complexity of knot polynomials
On coresets for fair clustering in metric and Euclidean spaces and their applications
Multiswapped networks and their topological and algorithmic properties
On the hardness of learning intersections of two halfspaces
The Security of the Cipher Block Chaining Message Authentication Code
Query Time Versus Redundancy Trade-Offs for Range Queries
Preemptive scheduling in overloaded systems
Corrigendum: Independence Results in Computer Science?
A possibility degree method for interval-valued intuitionistic fuzzy multi-attribute group decision making
Orthogonal planarity testing of bounded treewidth graphs
A Model of Interactive Teaching
Multiple-Entry Finite Automata
Codeterministic Lindenmayer Schemes and Systems
Perfect Information Leader Election in log* n+O (1) Rounds
On the Transformation Semigroups of Finite Automata
Learning languages from positive data and negative counterexamples
On finding short reconfiguration sequences between independent sets
A Note on the Influence of an epsilon-Biased Random Source
Special issue: Frontiers and advance topics of computer and information technology
Structural operational semantics for continuous state stochastic transition systems
On the Density of Honest Subrecursive Classes
A cop and robber game on edge-periodic temporal graphs
On the Completeness of the Inductive Assertion Method
Regular expression length via arithmetic formula complexity
The value of agreement a new boosting algorithm
The Independence of Control Structures in Abstract Programming Systems
On Fixed-Parameter Tractability and Approximability of NP Optimization Problems
Maximum parsimony distance on phylogenetic trees: A linear kernel and constant factor approximation algorithm
Expressive power of first-order recurrent neural networks determined by their attractor dynamics
On the termination and structural termination problems for counter machines with incrementing errors
On approximate preprocessing for domination and hitting subgraphs with connected deletion sets
Group Character Tables in Discrete Transform Theory
Semantic Representations and Query Labguages for Or-Sets
Robust gossiping with an application to consensus
Parameterized algorithms for min-max multiway cut and list digraph homomorphism
Continuously Valued Logic
On the finite controllability of conjunctive query answering in databases under open-world assumption
Formal Analysis of a Systolic System for Finite Element Stiffness Matrices
Induced tree covering and the generalized Yutsis property
Content-dependent chunking for differential compression, the local maximum approach
On g-extra connectivity of hypercube-like networks
On Correct Refinement of Programs
A Result on the Equivalence Problem for Deterministic Pushdown Automata
Performance modeling of hybrid MPI/OpenMP scientific applications on large-scale multicore supercomputers
Preprocessing subgraph and minor problems: When does a small vertex cover help?
The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model
Kernels for deletion to classes of acyclic digraphs
Editor's Foreword: Selected Papers of PODS 1989
Substitution and Bounded Languages
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence
Graph reconstruction in the congested clique
On "Forgetful" Cellular Automata
Global Theory of the Riccati Equation
Nash equilibria in discrete routing games with convex latency functions
The impact of processing order on performance: A taxonomy of semi-FIFO policies
Newton's Method and Boundary Value Problems
River Routing with a Generalized Model
Cubic patterns with permutations
Design of Relational Database Schemes by Deleting Attributes in the Canonical Decomposition
An Extension of Van Gelder's Alternating Fixpoint to Magic Programs
A Three-Valued Semantics for Deductive Databases and Logic Programs
On Reversibility in Cellular Automata
Reachability relations of timed pushdown automata
Complexity of metric dimension on planar graphs
Extensions of Iterative Congruences on Free Iterative Algebras
A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy
New Error Bounds for Solomonoff Prediction
Multiparametric Eigenvalue Problems in Inner-product Spaces
Redundancy of information: Lowering effective dimension
Non-U-shaped vacillatory and team learning
An expressive language for linear spatial database queries
Special issue: Selected papers of the 9th International Conference on Language and Automata Theory and Applications, LATA 2015
Estimating the number of hosts corresponding to an intrusion alert while preserving privacy
Decomposing permutation automata
Computing the Maximum Bichromatic Discrepancy with Applications to Computer Graphics and Machine Learning
Sorting networks: To the end and back again
The consensus string problem and the complexity of comparing hidden Markov models
A General Theory of Extremals
Abstract Families of Relations
Membrane computing and complexity theory: A characterization of PSPACE
Dynamical Characteristics of Linear Cellular Automata
The complexity of complex weighted Boolean #CSP
Matrix and Matricial Iteration Theories, Part II
On the Decidability of Semilinearity for Semialgebraic Sets and Its Implications for Spatial Databases
Neighborhood Search Algorithms for Guaranteeing Optimal Traveling Salesman Tours Must Be Inefficient
Colouring square-free graphs without long induced paths
Simple Multi-Visit Attribute Grammars
Arithmetical complexity of the language of generic limit sets of cellular automata
A View of Computability on Term Algebras
Two-factor mutual authentication based on smart cards and passwords
Infinite Linear Sequential Machines
Discovery of optimal factors in binary data via a novel method of matrix decomposition
Representation Theorems on Regular Languages
Characterising the complexity of tissue P systems with fission rules
Better Lower Bounds for Monotone Threshold Formulas
Deep kernelization for the Tree Bisection and Reconnection (TBR) distance in phylogenetics
Abstract Families of Length-Preserving Processors
The parameterized complexity of some minimum label problems
Addressable Approximations to Nonaddressable Data Graphs