yusuke1997/dblp-id-title huggingface dataset:
Tree Constructions of Free Continuous Algebras
The Translation Power of Top-Down Tree-to-Graph Transducers
On planar valued CSPs
Algorithms for a distributed IDS in MANETs
Average stretch without migration
"During" Cannot be Expressed by "After"
The K-armed dueling bandits problem
Parameterized complexity classes beyond para-NP
On the Structure of Subrecursive Degrees
Exploring wedges of an oriented grid by an automaton with pebbles
Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters
Heuristic algorithms in computational molecular biology
A new linearization method for nonlinear feedback shift registers
Two Iteration Theorems for Some Families of Languages
On the Power of the Linear Array Architecture for Performing Tree-Structured Computations
Petri Net Languages and Infinite Subsets of m
Multiple Equality Sets and Post Machines
Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory
Distributed redundancy and robustness in complex systems
Password-based authentication and key distribution protocols with perfect forward secrecy
On the role of complementation in implicit language equations and relations
Model-checking for Resource-Bounded ATL with production and consumption of resources
Special Issue: Games in Verification
Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely)
Improved Algorithms via Approximations of Probability Distributions
Solving parity games by a reduction to SAT
The control complexity of r-Approval: From the single-peaked case to the general case
Synchronizing Boolean networks asynchronously
A complete characterization of statistical query learning with applications to evolvability
Representations of commutative asynchronous automata
The Turing way to parameterized complexity
Self-Similarity of Linear Cellular Automata
Model-checking hierarchical structures
Multilevel length-based classified index table for IP lookups and updates
Mixing local and global information for community detection in large networks
A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems
An Application of the Epsilon Technique to the Solution of Pursuit and Evasion Problems
Algorithmic identification of probabilities is hard
Special issue: Web and mobile information systems
Speeding up k-Means algorithm by GPUs
A parametric analysis of the state-explosion problem in model checking
Three-objective subgraph mining using multiobjective evolutionary programming
Analytic methods for reachability problems
Tensors masquerading as matchgates: Relaxing planarity restrictions on Pfaffian circuits
Pancake Flipping is hard
Approximations to the Halting Problem
Lower Bounds on the Length of Universal Traversal Sequences
Parallel Program Schemata
Program Schemata as Automata I
The g-extra connectivity of graph products
Regional cache organization for NoC based many-core processors
Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style
An effective recommender system by unifying user and item trust information for B2B applications
Leader election in ad hoc radio networks: A keen ear helps
Meanders and Their Applications in Lower Bounds Arguments
Querying websites using compact skeletons
Fair signature exchange via delegation on ubiquitous networks
The Equivalence Problem for DF0L Languages and Power Series
Provably secure threshold password-authenticated key exchange
NP-Complete Decision Problems for Binary Quadratics
List Ranking and List Scan on the CRAY C90
A multi-objective ant colony system algorithm for virtual machine placement in cloud computing
Decision problems for language equations
How to tamper with a Parliament: Strategic campaigns in apportionment elections
Dependency-preserving normalization of relational and XML data
An Unpredictability Approach to Finite-State Randomness
A faster polynomial-space algorithm for Max 2-CSP
Hellinger volume and number-on-the-forehead communication complexity
Linear Cellular Automata over Z_m
SAFIR: Secure access framework for IoT-enabled services on smart buildings
Special issue on database theory
Analysis of Petri Nets by Stepwise Refinements
Expressive power of entity-linking frameworks
Parameterized approaches to orthogonal compaction
A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm
Analysis of impersonation attacks on systems using RF fingerprinting and low-end receivers
The parameterized complexity of the minimum shared edges problem
Finding and counting patterns in sparse graphs
Agent-based framework for sensor-to-sensor personalization
River Routing in VLSI
The complexity of properly learning simple concept classes
Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
Completeness Results for Conflict-Free Vector Replacement Systems
An uncoordinated asynchronous checkpointing model for hierarchical scientific workflows
Operator precedence and the visibly pushdown property
Approximately covering vertices by order-5 or longer paths
The Isomorphism Conjecture Holds and One-Way Functions Exists Relative to an Oracle
Maintenance of Configurations in the Plane
Undecidability Results for Low Complexity Time Classes
Enforcing QoS in scientific workflow systems enacted over Cloud infrastructures
Decision Procedures for Elementary Sublanguages of Set Theory. V. Multilevel Syllogistic Extended by the General Union Operator
More efficient PAC-learning of DNF with membership queries under the uniform distribution
Hardness of optimal spaced seed design
Time-Space Trade-offs for Branching Programs
On Data Structures and Asymmetric Communication Complexity
The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries
A security framework in G-Hadoop for big data computing across distributed Cloud data centres
On the performance guarantee of First Fit for sum coloring
Fast algorithms for Abelian periods in words and greatest common divisor queries
Global reliable diagnosis of networks based on self-comparative diagnosis model and g-good-neighbor property
Strong computational lower bounds via parameterized complexity
Quadratic Automata
Characterizations of Learnability for Classes of {0, ..., n}-Valued Functions
On the Learnability of Rich Function Classes
On Minimal Augmentation of a Graph to Obtain an Interval Graph
The Random Oracle Hypothesis Is False
Ambient and context-aware services
A distributed multiple dimensional QoS constrained resource scheduling optimization policy in computational grid
Complexity Classes of Partial Recursive Functions
Semantics vs Syntax vs Computations: Machine Models for Type-2 Polynomial-Time Bounded Functionals
Learning with Discrete Multi-valued Neurons
An equational logic based approach to the security problem against inference attacks on object-oriented databases
A new general method to compute virtual channels occupancy probabilities in wormhole networks
On the Convergence of Nonlinear Simulaneous Displacements
Heterogeneous programming with Single Operation Multiple Data
Two Entropies of a Generalized Sorting Problem
Relationships Between Nondeterministic and Deterministic Tape Complexities
Nonlinear Optimal Controls
Derivation of algorithms for cutwidth and related graph layout parameters
On relevant equilibria in reachability games
What Do We Know about the Metropolis Algorithm?
Almost optimal query algorithm for hitting set using a subset query
A Semideterministic Approach to Object Creation and Nondeterminism in Database Queries
Queries and materialized views on probabilistic databases
Optimal Control for a Class of Distributed Parameter Systems Where the Cost Functions are Norms
Exact admission-control for integrated aperiodic and periodic tasks
Computing optimal outcomes under an expressive representation of settings with externalities
Linear time algorithms for finding and representing all the tandem repeats in a string
An adaptive mode control algorithm of a scalable intrusion tolerant architecture
On Fully Indecomposable Matrices
Dominator coloring and CD coloring in almost cluster graphs
An Algorithm for Imbedding Cubic Graphs in the Torus
Fault tolerance in cellular automata at low fault rates
Clustering overhead and convergence time analysis of the mobility-based multi-hop clustering algorithm for mobile ad hoc networks
Separator Based Sparsification. I. Planary Testing and Minimum Spanning Trees
How to achieve non-repudiation of origin with privacy protection in cloud computing
A 2k kernel for the cluster editing problem
A spatiotemporal compression based approach for efficient big data processing on Cloud
Matching and alpha-equivalence check for nominal terms
Some Convergence Results on the Method of Gradients for Ax = lambda Bx
Ramsey-type theorems for metric spaces with applications to online problems
Stack Languages and log n Space
Cloud BI: Future of business intelligence in the Cloud
Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms
Reducibility between Classes of Port Graph Grammar
On the Limits of Nonapproximability of Lattice Problems
Duality and the Regulator Problem for Linear Systems over Commutative Rings
Parameterizing above or below guaranteed values
Parameterized k -Clustering: Tractability island
Extracting Randomness: A Survey and New Constructions
Socialized ubiquitous personal study: Toward an individualized information portal
Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU
Almost 2-SAT is fixed-parameter tractable
Solitaire Automata
On Time versus Space II. (Turing Machines)
Absolutely Parallel Grammars and Two-Way Finite State Transducers
On decidability and complexity of low-dimensional robot games
A Constant-Factor Approximation Algorithm for the k -MST Problem
A Linear-Time Near-Optimum-Length Triangulation Algorithm for Convex Polygons
On the Complexity of Chess
On the exact amount of missing information that makes finding possible winners hard
Optimal aggregation algorithms for middleware
Universally Serializable Computation
Nonapproximability of the normalized information distance
On Topological Machines
An O(n^(log log n)) Learning Algorithm for DNT under the Uniform Distribution
TopCluster: A hybrid cluster model to support dynamic deployment in Grid
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Self-organizing Sequential Search and Hilbert's Inequalities
Greedy routing and the algorithmic small-world phenomenon
Representing real numbers in a generalized numeration system
Guest editorial: Special issue on database theory
On the Theory of the PTIME Degrees of the Recursive Sets
Propositional Dynamic Logic of Regular Programs
Balanced allocation on hypergraphs
A logical approach to locality in pictures languages
Communication delay analysis of fault-tolerant pipelined circuit switching in torus
Varieties of Ordered Algebras
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
On simple generators of recursively enumerable languages
Optimal outlier removal in high-dimensional spaces
Runtime analysis of probabilistic programs with unbounded recursion
Threshold Circuits of Bounded Depth
Automatic Kolmogorov complexity, normality, and finite-state dimension revisited
Pushdown Automata with Reversal-Bounded Counters
Corrigendum to "Prediction, learning, uniform convergence, and scale-sensitive dimensions" [J. Comput. Syst. Sci. 56 (2) (1998) 174-190]
A Tight Upper Bound on the Benefits of Replica Control Protocols
Backwards-reachability for cooperating multi-pushdown systems
Largest common prefix of a regular tree language
Average-case complexity of backtrack search for coloring sparse random graphs
Detecting correlation between server resources for system management
Meet and merge: Approximation algorithms for confluent flows
Some Remarks on Multiple-Entry Finite Automata
Clique-width and well-quasi-ordering of triangle-free graph classes
Time-approximation trade-offs for inapproximable problems
Minimality of an Automaton Cascade Decomposition for Learning System Environments
Formal Grammars and the Regeneration Capability of Biological Systems
Biconnectivity, st-numbering and other applications of DFS using O(n) bits
Succinct Representation of Regular Sets Using Gotos and Boolean Variables
Geometric Approach for Optimal Routing on a Mesh with Buses
Single Row Routing on Multilayers
A New Computing Technique in System Identification
Optimization, Approximation, and Complexity Classes
Markov chains and unambiguous automata
Locks: Picking key methods for a scalable quantitative analysis
Simple restriction in context-free rewriting
Equivalences among Logics of Programs
Compact distributed certification of geometric graph classes
Inference for Regular Bilanguages
The design and evaluation of fair scheduling in wireless mesh networks
Circuits, Matrices, and Nonassociative Computation
On Batch Scheduling of Jobs with Stochastic Service Times and Cost Structures on a Single Server
Nondeterminism and Boolean Operations in PDAs
On the Complexity of k-SAT
Competitive collaborative learning
Relations between Communication Complexity Classes
Technical note: Replication graphs revisited
The covering and boundedness problems for branching vector addition systems
Reconstructing semi-directed level-1 networks using few quarnets
A Lower Bound for Read-Once-Only Branching Programs
Space Complexity in On-Line Computation
Translating Regular Expressions into Small -Free Nondeterministic Finite Automata
PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data
Approximate Solutions and Error Bounds for Quasilinear Elliptic Boundary Value Problems
Computing the Betti numbers of arrangements via spectral sequences
Accurate and precise aggregation counting
Synthesis of succinct systems
Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs
Adapting stable matchings to forced and forbidden pairs
Translation of binary regular expressions into nondeterministic ε-free automata with transitions
Special Issue: Cloud Computing 2011
A linear lower bound on the unbounded error probabilistic communication complexity
Graph-based specification of access control policies
Subtyping in OODBs
A multivariate framework for weighted FPT algorithms
Complexity of stability
The complexity of synchronizing Markov decision processes
Interaction graphs of isomorphic automata networks II: Universal dynamics
Average Case Completeness
Forbidden patterns in temporal graphs resulting from encounters in a corridor
On the aggregation problem for synthesized Web services
A constant-factor approximation for directed latency in quasi-polynomial time
Hitting minors on bounded treewidth graphs. III. Lower bounds
Kernels in planar digraphs
Approximate CVP p in time 2 0.802 n
An axiomatic semantics for the synchronous language Gentzen
Algorithm Model for Penalty Functions-Type Iterative Procedures
NTS Languages Are Deterministic and Congruential
Online knapsack with removal and recourse
On Complements of Unary L Languages
Deterministic regular expressions with back-references
L p -norm Sauer-Shelah lemma for margin multi-category classifiers
Separation Results for Separated Apex NLC and NCE Graph Languages
Exploring learnability between exact and PAC
Ultra-succinct representation of ordered trees with applications
Guest editors' introduction: Special issue on learning theory
The Communication Complexity of Pointer Chasing
Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts
The implication problem for 'closest node' functional dependencies in complete XML documents
Approximating the SVP to within a Factor (1+1/dim xi ) Is NP-Hard under Randomized Reductions
On Periodicity of Sequential Machines
Optimal constructions for active diagnosis
Subword histories and Parikh matrices
Power Domains
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
Decomposing a Relation into a Tree of Binary Relations
Size-Estimation Framework with Applications to Transitive Closure and Reachability
Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
Security of the design of time-stamped signatures
Relational Data Graphs and Some Properties of Them
On the Multiplying Ability of Two-Way Automata
The Set of Minimal Words of a Context-Free Language is Context-Free
Turing Machines with Few Accepting Computations and Low Sets for PP
Estimation of the Domain of Attraction and the Convergence Rate of a Hopfield Associative Memory and an Application
Recursive Function Theory and Numerical Analysis
Mathematical Theory of Partial Correctness
{2,3}-Extraconnectivities of hypercube-like networks
Tape Bounds for Time-Bounded Turing Machines
A Spectrum of Time-Space Trade-Offs for Undirected s-t Connectivity
Some Results on Relativized Deterministic and Nondeterministic Time Hierarchies
A robust trust model for service-oriented systems
Complexity Classes of Provable Recursive Functions
Non-essential arcs in phylogenetic networks
Space-efficient informational redundancy
Query containment for data integration systems
Efficient Oblivious Branching Programs for Threshold and Mod Functions
Journal of Computer and System Sciences Special Issue on Reliability and Optimization for Wireless Networking and Cloud Computing
Memory lower bounds for XPath evaluation over XML streams
K One-Way Heads Cannot Do String-Matching
Call control with k rejections
On Incomparable Abstract Family of Languages (AFL)
A multivariate analysis of the strict terminal connection problem
Finite Languages for the Representation of Finite Graphs
Strategy improvement for concurrent reachability and turn-based stochastic safety games
k -Majority digraphs and the hardness of voting with a constant number of voters
On Unique Satisfiability and the Threshold Behavior of Randomized Reductions
Etherless Ethereum tokens: Simulating native tokens in Ethereum
Universal Realization
The Equivalence and Inclusion Problems for NTS Languages
On Limited Nondeterminism and the Complexity of the V-C Dimension
Solutions of Generalized Optimization Problems
Deterministic calibration and Nash equilibrium
The Performance of Multilective VLSI Algorithms
Special Issue on Cyber Security in the Critical Infrastructure: Advances and Future Directions
Constrained Shared Locks for Increased Concurrency in Databases
The use of Lists in the Study of Undecidable Problems in Automata Theory
An almost optimal approximation algorithm for monotone submodular multiple knapsack
Sylow's Theorem in Polynomial Time
Clocked population protocols
A Definition of Measures over Language Space
Resolution lower bounds for perfect matching principles
Covering Cubes by Random Half Cubes with Applications to Binary Neural Networks
Complexity of control in judgment aggregation for uniform premise-based quota rules
TAL Recognition in O(M(n»)) Time
Emptiness Problems of eNCE Graph Languages
Logical Query Optimization by Proff-Tree Transformation
Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions
Linear Dynamical Systems over Integral Domains
Oblivious Routing with Limited Buffer Capacity
Topological analysis of AOCD-based agent networks and experimental results
Size-Space Tradeoffs for Oblivious Computations
The Circuit Depth of Symmetric Boolean Functions
Honest Polynomial Time Reducibilities and the P = ? NP Problem
Querying Incomplete Information in Semistructured Data
Faster pattern matching with character classes using prime number encoding
The Closure of Monadic NP
The language of plain SO-tgds: Composition, inversion and structural properties
The Firing Squad Synchronization Problem for a Class of Polyautomata Networks
Communication-optimal eventually perfect failure detection in partially synchronous systems
Tessellation Structures for Reproduction of Arbitrary Patterns
Covering metric spaces by few trees
Extracting the workflow critical path from the extended well-formed workflow schema
Finite Automata on Directed Graphs
The Nested Universal Relation Data Model
Trustworthiness analysis of sensor data in cyber-physical systems
Network QoS games: stability vs optimality tradeoff
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
Structure identification of Boolean relations and plain bases for co-clones
Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
A simulator for adaptive parallel applications
Learning functions of k relevant variables
Verification by Augmented Abstraction: The Automata-Theoretic View
Corrections to "On the data complexity of consistent query answering over graph databases [Journal of Computer and System Sciences 88 (2017) 164-194]"
Clique Partitions, Graph Compression and Speeding-Up Algorithms
On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class
The web from a complex adaptive systems perspective
On making directed graphs transitive
Minimum-Complexity Pairing Functions
Automatic graphs and D0L-sequences of finite graphs
Editor's foreword: WoLLIC 2010
Hybrid model of content extraction
An efficiently computable characterization of stability and instability for linear cellular automata
Quantum multi-prover interactive proof systems with limited prior entanglement
Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems
Homomorphisms between Models of Parallel Computation
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems
A combinatorial characterization of resolution width
Complete binary trees embeddings in Möbius cubes
An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM
Inter-deriving semantic artifacts for object-oriented programming
Increasing the power of uniform inductive learners
De-anonymization attack on geolocated data
Minmax optimal list searching with log2⁡log2⁡n average cost
The longest common subsequence problem for sequences with nested arc annotations
Tree Correspondence Problems
Monadic Recursion Schemes: The Effect of Constants
A complexity question in justification logic
State Assignment for Realizing Modular Input-Free Sequential Logical Networks Without Invertors
Performance analysis and evaluation of parallel, cluster, and grid computing systems
Interpretation and inference with maximal referential terms
The k -F EATURE S ET problem is W [2]-complete
A lower bound for metric 1-median selection
Area-Period Tradeoffs for Multiplication of Rectangular Matrices
Fast String Matching with k Differences
Some Decision Problems Concerning Semilinearity and Commutation
Reduction rules for reset/inhibitor nets
Complexity of Algebraic Implementations for Abstract Data Types
Extractors from Reed-Muller codes
A characterization of definability of second-order generalized quantifiers with applications to non-definability
On Uniformity within NC¹
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems
Acyclic, star and injective colouring: A complexity picture for H-free graphs
What one has to know when attacking P vs. NP
Counting subset repairs with functional dependencies
Functions with Bounded Symmetric Communication Complexity, Programs over Commutative Monoids, and ACC
Prediction-Preserving Reducibility
Synthesis from scenario-based specifications
Counting Protocols for Reliable End-to-End Transmission
Dispatch sequences for embedded control models
On the Zero-Inequivalence Problem for Loop Programs
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
Triangle evacuation of 2 agents in the wireless model & the power of choosing a starting point
Tractability frontiers of the partner units configuration problem
The Invariant Problem for Binary String Structures and the Parallel Complexity Theory of Queries
Rewriting XPath queries using materialized XPath views
The Enumerability and Invariance of Complexity Classes
A Three-Party Communication Problem