yusuke1997/dblp-id-title huggingface dataset:
Deciding probabilistic bisimilarity distance one for probabilistic automata
An improved approximation algorithm for the complementary maximal strip recovery problem
Discovering gene association networks by multi-objective evolutionary quantitative association rules
On Weisfeiler-Leman invariance: Subgraph counts and related graph properties
Drifting Games and Brownian Motion
Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs
A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets
A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees
Utility accrual object distribution in MPSoC real-time embedded systems
Blocking a transition in a free choice net and what it tells about its throughput
A Completeness Property of One-Dimensional Tessellation Automata
Maze Recognizing Automata and Nondeterministic Tape Complexity
Vector seeds: An extension to spaced seeds
Editing graphs to satisfy degree constraints: A parameterized approach
The computational power of parsing expression grammars
Using on-chip networks to implement polymorphism in the co-design of object-oriented embedded systems
Approximate Turing kernelization for problems parameterized by treewidth
On LL-Regular Grammars
All Solutions of a System of Recursion Equations in Infinite Trees and Other Contraction Theories
Regularity and Firing Sequences of Computation Graphs
The String Generating Power of Context-Free Hypergraph Grammars
Developing the Cloud-integrated data replication framework in decentralized online social networks
A Note on A.E. h-Complex Functions
Bounded fixed-parameter tractability and log 2 n nondeterministic bits
Space efficient representations of finite groups
Extrema Predicates in Deductive Databases
An AFPTAS for variable sized bin packing with general activation costs
The complexity of growing a graph
Editing to Eulerian graphs
Multiplicative Complexity and Algebraic Structure
Infinite-state high-level MSCs: Model-checking and realizability
An Improved Approximation Algorithm for MULTIWAY CUT
A generalization of Nemhauser and Trotterʼs local optimization theorem
A Characterization of Context-free Languages
WCOID-DG: An approach for case base maintenance based on Weighting, Clustering, Outliers, Internal Detection and Dbsan-Gmeans
Separating OR, SUM, and XOR circuits
Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds
Computation with perturbed dynamical systems
Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption
Remarks on Multihead Pushdown Automata and Multihead Stack Automata
There are Planar Graphs Almost as Good as the Complete Graph
A Characterization Theorem for n-Parallel Right Linear Languages
Linear time algorithms for Abelian group isomorphism and related problems
Minimum Error Bounds for Multidimensional Spline Approximation
A V log V Algorithm for Isomorphism of Triconnected Planar Graphs
Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers
Hardness of conjugacy, embedding and factorization of multidimensional subshifts
Full Intersection Types and Topologies in Lambda Calculus
Directed Drift: A New Linear Threshold Algorithm for Learning Binary Weights On-Line
Lower bounds for Boolean circuits of bounded negation width
Wire length as a circuit complexity measure
Upper Bounds for Time-Space Trade-Offs in Sorting and Selection
Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory
Robust learning--rich and poor
An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus
An Information-Theoretic Approach to Time Bounds for On-Line Computation
On the structure of Hamiltonian graphs with small independence number
Minimizing the operation cost of distributed green data centers with energy storage under carbon capping
Linking theorems for tree transducers
Learning the truth vector in high dimensions
Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths
Nondiamond Theorems for Polynomial Time Reducibility
Linear Realization of Finite Automata
Towards a unified complexity theory of total functions
Betweenness parameterized above tight lower bound
The Insensitivity Theorem for Nonreducing Reflexive Types
Radio communication in random graphs
Effective Choice Functions and Index Sets
Time-Varying Linear Sequential Machines I
A practical reputation system for pervasive social chatting
Dynamic Load Balancing by Random Matchings
On Inference Control in Semantic Data Models for Statistical Databases
Algorithms and estimators for summarization of unaggregated data streams
Parameter-Preserving Data Type Specifications
Inequalities for Shannon Entropy and Kolmogorov Complexity
Multi-group QoS consensus for web services
On minimum vertex bisection of random d-regular graphs
On Hiding Information from an Oracle
Algorithms for hierarchical and semi-partitioned parallel scheduling
Newton's Method under Mild Differential Conditions
An ontological engineering approach for automating inspection and quarantine at airports
A linear kernel for the complementary maximal strip recovery problem
Equivalence of Keyed Relational Schemas by Conjunctive Queries
Weighted group search on the disk & improved lower bounds for priority evacuation
Selectivity and Cost Estimation for Joins Based on Random Sampling
A parametric error analysis of Goldschmidt's division algorithm
Speeding-up verification of digital signatures
A spectral algorithm for learning mixture models
Performance evaluation of an intelligent CAC and routing framework for multimedia applications in broadband networks
The Node-Deletion Problem for Hereditary Properties is NP-Complete
Temporal Interactions of Intervals in Distributed Systems
Distribution of Attained Service in Time-Shared Systems
Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements
Approximations and Optimal Geometric Divide-an-Conquer
Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model
The Complexity of Total Order Structures
The complexity of transitively orienting temporal graphs
A Normal Form for Arithmetical Representation of NP-Sets
Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions
A New Proof of the Weak Pigeonhole Principle
A Representation of Strongly Connected Automata and its Applications
A Decomposition Method for Structured Quadratic Programming Problems
On the Equivalence of Mealy-Type and Moore-Type Automata and a Relation between Reducibility and Moore-Reducibility
Building a reputation-based bootstrapping mechanism for newcomers in collaborative alert systems
A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
Automaticity I: Properties of a Measure of Descriptional Complexity
On restricted context-free grammars
On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata
Intersection joins under updates
(A-)Synchronous (Non-)Deterministic Cell Spaces Simulating Each Other
The Primitive Recursive Analysis of Ordinary Differential Equations and the Complexity of Their Solutions
Schützenberger and Eilenberg theorems for words on linear orderings
A survey of emerging threats in cybersecurity
Performance guarantees for hierarchical clustering
Polynomial-Time Isomorphism of 1-L-Complete Sets
On-Line Maximum Likelihood Prediction with Respect to General Loss Functions
Graph Theoretic Analysis of PLA Folding Heuristics
Normalized information distance and the oscillation hierarchy
Computation by Assembly
When consensus meets self-stabilization
Stability of long-lived consensus
A Convex Programming Problem in Banach Spaces and Applications to Optimum Control Theory
The Decidability of Equivalence for Deterministic Finite Transducers
Memorial issue for Carl Smith
Connected Components in O (log^3/2 n) Parallel Time for the CREW PRAM
Transformation of modular robots by rotation: 3 + 1 musketeers for all orthogonally convex shapes
Interaction graphs of isomorphic automata networks I: Complete digraph and minimum in-degree
Generalized substring selectivity estimation
Efficient Evaluation of Polynomial Forms
Combined-semantics equivalence of conjunctive queries: Decidability and tractability results
On Self-Reducibility and Weak P-Selectivity
Orthogonally Convex Coverings of Orthogonal Polygons without Holes
Clone wars: Distributed detection of clone attacks in mobile WSNs
Effects of Updates on Optimality in Tries
Equivalences on Program Schemes
Fixed-point tile sets and their applications
Dominant point detection based on discrete curve structure and applications
General Properties of Star Height of Regular Events
Completeness Results for the Equivalence of Recursive Schemas
The Complexity of Elementary Algebra and Geometry
Feasibility interval for the transactional event handlers of P-FRP
Erratum to "Propagating XML constraints to relations" [JCSS 73 (2007) 316-361]
Hard Sets Are Hard to Find
Complexity of fixed point counting problems in Boolean networks
Computing with First-Order Logic
Technique for authenticating H.264/SVC and its performance evaluation over wireless mobile networks
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds
Tractable counting of the answers to conjunctive queries
Relational completeness of query languages for annotated databases
Remarks about Commutative Context-Free Languages
SVD-based incremental approaches for recommender systems
A study of performance and scalability metrics of a SIP proxy server - a practical approach
Low Complexity Variants of the Arrow Distributed Directory
On ET0L Systems with Rank
Expressiveness and the Completeness of Hoare's Logic
On notions of distortion and an almost minimum spanning tree with constant average distortion
Measuring what matters: A hybrid approach to dynamic programming with treewidth
Algorithms for Some Minimax Problems
Computing Lower Bounds on Tensor Rank over Finite Fields
Dynamic programming on bipartite tree decompositions
Stepwise refinement of sequence diagrams with soft real-time constraints
Polynomial kernels for weighted problems
Abstract geometrical computation 8: Small machines, accumulations & rationality
An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem
LDAC: A localized and decentralized algorithm for efficiently countering wormholes in mobile wireless networks
Finding Euler Tours in Parallel
Theory of omega-Languages. I. Characterizations of omega-Context-Free Languages
Bases of closure systems over residuated lattices
Self-regularized causal structure discovery for trajectory-based networks
Some Remarks on a Theorem of Sakarovitch
Systematic performance modeling and characterization of heterogeneous IP networks
Union and Actualization of Module Specifications: Some Compatibility Results
A-Transducers and the Monotonicity of IL Schemes
An Algebraic Characterization of Some Principal Regulated Rational Cones
The inapproximability of lattice and coding problems with preprocessing
Approximation and Learning of Convex Superpositions
Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes
Maximal and Minimal Solutions to Language Equations
A query privacy-enhanced and secure search scheme over encrypted data in cloud computing
Optimal separation in exact query complexities for Simon's problem
Decomposable Maps in General Tessellation Structures
On selective unboundedness of VASS
Modifications of the Program Scheme Model
Invariant Sets for Substitution
Normality and automata
Planar graph vertex partition for linear problem kernels
Privacy Preserving OLAP over Distributed XML Data: A Theoretically-Sound Secure-Multiparty-Computation Approach
Cost Functors and Optimal Realization
Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files
Extended Macro Grammars and Stack Controlled Machines
First-Order Spectra with One Variable
Computation Sequence Sets
Graph separators: a parameterized view
TCEP: Transitions in operator placement to adapt to dynamic network environments
Routing, Merging, and Sorting on Parallel Models of Computation
A strong provably secure IBE scheme without bilinear map
On Some Questions of Rationality and Decidability
Computing marginals using MapReduce
Facilitating an ant colony algorithm for multi-objective data-intensive service provision
Journal of Computer and System Science: 50 years of celebration. In memory of Professor Edward Blum
On Splitting Recursive Sets
Deterministic and Nondeterministic Flowchart Interpretations
Language Learning with Some Negative Information
A probabilistic approach to problems parameterized above or below tight bounds
Dynamic grey platform for efficient forecasting management
Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations
Methods of the Algebraic Theory of Machines. I: Decomposition Theorem for Generalized Machines; Properties Preserved under Series and Parallel Compositions of Machines
Time Bounds for Selection
Binary Trees and Uniform Distribution of Traffic Cutback
On some network design problems with degree constraints
An Efficient Algorithm for Hidden Surface Removal, II
On the Complexity of Some Two-Person Perfect-Information Games
Polynomial degree vs. quantum query complexity
Cutting Plane Algorithms and State Space Constrained Linear Optimal Control Problems
The Semigroup of an Algebra Automaton
Construction universality in purely asynchronous cellular automata
A spectral algorithm for learning Hidden Markov Models
Approximation algorithms for two extensions of min-k-union
Translatability of Schemas over Restricted Interpretations
P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP
Sigma_2 SPACE(n) is Closed under Complement
A constant-factor approximation for weighted bond cover
Integer programming based heterogeneous CPU-GPU cluster schedulers for SLURM resource manager
Communication Complexity and Combinatorial Lattice Theory
An intelligent approach for building a secure decentralized public key infrastructure in VANET
Linear-Consistency Testing
Pregroup grammars with letter promotions: Complexity and context-freeness
Non-deterministic weighted automata evaluated over Markov chains
DELFIN + : An efficient deadlock detection tool for CCS processes
Process-centric views of data-driven business artifacts
Trustworthy-based efficient data broadcast model for P2P interaction in resource-constrained wireless environments
On Polynomial Time Isomorphisms of Some New Complete Sets
What makes Some Language Theory Problems Undecidable
Computation Graphs for Actor Grammars
Special Issue: Dependable and Secure Computing
Finding Similar Regions in Many Sequences
Weighted hypertree decompositions and optimal query plans
Designing optimally multiplexed SNP genotyping assays
Converging to the chase - A tool for finite controllability
Proving Simultaneous Positivity of Linear Forms
On the minimization of XML Schemas and tree automata for unranked trees
A multi-parameter analysis of hard problems on deterministic finite automata
Precedence constrained scheduling in (2 - 7/(3p+1)) optimal
The Unsolvability of the Equality Problem for Sentential Forms of Context-Free Grammars
Undecidability of the First-Order Arithmetic A[P(x), 2x, x+1]
Ambiguity and Decision Problems for Local Adjunct Languages
Quasi-varieties in Abstract Algebraic Institutions
A model for managing interactions between tangible and virtual agents on an RFID interactive tabletop: Case study in traffic simulation
Medians in median graphs and their cube complexes in linear time
Scheduling lower bounds via AND subset sum
Editorial for the special issue on "Adaptivity in Heterogeneous Environments"
Learning DNF from random walks
More on change-making and related problems
A polynomial-time algorithm for Outerplanar Diameter Improvement
Determining model accuracy of network traces
Perpetual maintenance of machines with different urgency requirements
P-Selektive Sets and Reducing Search to Decision vs Self-Reducibility
Optimal spaced seeds for faster approximate string matching
The complexity of binary matrix completion under diameter constraints
Improving disk I/O performance in a virtualized system
Geometric Consistency Theorem for a Symbolic Perturbation Scheme
Improvement of assurance including security for wireless sensor networks using dispersed data transmission
Exploring gate-limited analytical models for high-performance network storage servers
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
The Interaction of Integrity Constraints in an Information System
Generalized satisfiability problems via operator assignments
A segmentation-free method for image classification based on pixel-wise matching
Min-rank conjecture for log-depth circuits
k -distinct in- and out-branchings in digraphs
Deterministic rendezvous with different maps
Multi-valued model checking games
The correlation between parity and quadratic polynomials mod 3
Polynomial time approximation schemes for clustering in low highway dimension graphs
The Dot-Depth Hierarchy of Star-Free Languages is Infinite
Learning intersections of halfspaces with a margin
A mobile RFID-based tour system with instant microblogging
Polymorphic Type Inference for the Relational Algebra
Principal AFL
Decomposing finite-valued two-way finite transducers
Lax extensions of coalgebra functors and their logic
Relating Refined Space Complexity Classes
Representation of One-One Degrees by Decision Problems for System Functions
Using decomposition-parameters for QBF: Mind the prefix!
On the parallel complexity of group isomorphism via Weisfeiler-Leman
Constraint satisfaction with bounded treewidth revisited
A comparative study of the smallest probability intervals for which a binary sequence is random
Computing Weighted Subset Odd Cycle Transversals in H -free graphs
PP Is Closed under Intersection
An efficient quasi-identifier index based approach for privacy preservation over incremental data sets on cloud
An improved approximation algorithm for vertex cover with hard capacities
EFADS: Efficient, flexible and anonymous data sharing protocol for cloud computing with proxy re-encryption
Optimization of Distributed Tree Queries
Transition Systems, Metric Spaces and Ready Sets in the Semantics of Uniform Concurrency
Online bin covering with limited migration
Non-deterministic Queue Operations
Graph properties checkable in linear time in the number of vertices
On low for speed oracles
Modeling energy-efficient secure communications in multi-mode wireless mobile devices
A Branching Time Logic with Past Operators
A novel design of 8-bit adder/subtractor by quantum-dot cellular automata
Tight approximation algorithm for connectivity augmentation problems
Blackout-tolerant temporal spanners
An effective algorithm for peptide de novo sequencing from MS/MS spectra
LR-Regular Grammars - an Extension of LR(k) Grammars
Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip
Rural postman parameterized by the number of components of required edges
Circuits and Expressions with Nonassociative Gates
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
Temporal flows in temporal networks
Relaxing the Uniformity and Independence Assumptions Using the Concept of Fractal Dimension
Special issue: 35th Annual ACM Symposium on Theory of Computing
Towards a Theory of Data Structures
Graph coloring with rejection
On the threshold of intractability
Combinatorial Equivalence of (0, 1) Circulant Matrices
Generic local computation
Deterministic Soliton Automata with at Most One Cycle
On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages
Visibly pushdown transducers
Some Considerations on Fuzzy Automata
An Accelerated Conjugate Direction Method to Solve Linearly Constrained Minimization Problems
Approximate testing with error relative to input size
Simple Characterizations of P(#P) and Complete Problems
Inductive Reasoning and Kolmogorov Complexity
A Note on Asynchronous Cellular Automata
Disjoint path covers with path length constraints in restricted hypercube-like graphs
The complexity of Boolean formula minimization
Special issue foreword: Advances in pervasive computing systems and applications
(De)randomized Construction of Small Sample Spaces in NC
Branching-time logics with path relativisation
A Fast Algorithm for Query Optimization in Universal-Relation Databases
Number of Quantifiers is Better Than Number of Tape Cells
BP H Space(S) subseteq DSPACE(S 3/2 )
The Tape-Complexity of Context-Independent Developmental Languages
Minimal DFA for testing divisibility
Differences of halting probabilities
Shared Global States in Distributed Computations
Pushdown Automata with Counters
The subsumption lattice and query learning
The complexity of the parity argument with potential
Process Complexity and Effective Random Tests
A near-linear kernel for bounded-state parsimony distance
The Halting Problem for Linear Turing Assemblers
p -Edge/vertex-connected vertex cover: Parameterized and approximation algorithms
Synchronous context-free grammars and optimal linear parsing strategies
Parameterized complexity dichotomy for Steiner Multicut
Dense graph partitioning on sparse and dense graphs
Dynamic class hierarchy management for multi-version ontology-based personalization
Decentralized deadlock-free enforcement of message orderings in message-based systems
Tight lower bounds on the ambiguity of strong, total, associative, one-way functions
Graph-Theoretic Properties in computational Complexity
The complexity of synthesizing elementary net systems relative to natural parameters
On the memory requirements of XPath evaluation over XML streams
Removing Randomness in Parallel Computation without a Processor Penalty
Generalized Upper Bounding Techniques
The tractability frontier for NFA minimization
Variations on the Technique of Duris and Galil
Deterministic protocols in the SINR model without knowledge of coordinates
Parallel modular exponentiation using load balancing without precomputation
Parallel Restructuring and Evaluation of Expressions
Fast factorization by similarity in formal concept analysis of data with fuzzy attributes
Reducing false positives of network anomaly detection by local adaptive multivariate smoothing
Connectivity and Inference Problems for Temporal Networks
Closure Properties and Witness Reduction
Two-server password-only authenticated key exchange
Foundations of the State-Space Theory of Continous Systems I
Quantum-assisted QD-CFS signatures
Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity
Information Retrieval, Decision Making Process and User Needs
Approximating the partition function of planar two-state spin systems
Tree Transducers, L Systems, and Two-Way Machines
Foundations of Semantic Web databases
Performance analysis of priority scheduling mechanisms under heterogeneous network traffic
Space Bounds for Processing Contentless Inputs
Learning Recursive Functions from Approximations
Holographic algorithms: From art to science
An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time
On the Covering of Parsable Grammars
Adaptive decentralized re-clustering protocol for wireless sensor networks
Hardness of approximating the Shortest Vector Problem in high l p norms
Properties of Code Events and Homomorphisms over Regular Events
Capturing model-based ontology evolution at the instance level: The case of DL-Lite
Shifting: One-inclusion mistake bounds and sample compression
Sharing the Cost of Multicast Transmissions
Deciding the point-to-fixed-point problem for skew tent maps on an interval
One-way permutations and self-witnessing languages
Participatory budgeting with project groups
Trustworthy data delivery in mobile P2P network
Boundary Graph Grammars with Dynamic Edge Relabeling
Homotopic properties of an MA -digitization of 2D Euclidean spaces