yusuke1997/dblp-id-title huggingface dataset:
On the difficulty of approximately maximizing agreements
A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries
Taming teams with mind changes
Multi-route query processing and optimization
Reversal-Bounded Multipushdown Machines
Bidding mechanisms in graph games
The Decidability of the D0L-DT0L Equivalence Problem
Constructing small tree grammars and small circuits for formulas
Specification and verification of data-driven Web applications
The Derivation Language of a Phrase Structure Grammar
Routing few robots in a crowded network
Effect of Connectivity in an Associative Memory Model
The Hoare and Smith Power Domain Constructors Commute under Composition
Several extensions of the Parikh matrix L-morphism
Efficient enumeration of weighted tree languages over the tropical semiring
The Complexity of Regular DNLC Graph Languages
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph
Complexity of word problems for HNN-extensions
Modular SAT-based techniques for reasoning tasks in team semantics
Proving Assertions about Parallel Programs
On polymorphic types of untyped terms
Broadcasting in dynamic radio networks
A sharp threshold in proof complexity yields lower bounds for satisfiability search
Turing kernelization for finding long paths and cycles in restricted graph classes
The hardness of counting full words compatible with partial words
Temporal reachability minimization: Delaying vs. deleting
On the parameterized complexity of b-chromatic number
Incentive-based resource assignment and regulation for collaborative cloud services in community networks
Testing juntas
Determinism versus Nondeterminism for Linear Time RAMs with Memory Restrictions
Models of Nondeterministic Regular Expressions
Representation of left-computable ε-random reals
Refinements of Complexity Results on Type Consistency for Object-Oriented Databases
On Hausdorff and Topological Dimensions of the Kolmogorov Complexity of the Real Line
Discrete Tchebycheff Approximation for Multivariate Splines
Reconfiguration in bounded bandwidth and tree-depth
Displacement logic for anaphora
A Weak Version of the Blum, Shub, and Smale Model
Robust learning of automatic classes of languages
Multistage knapsack
New Trie Data Structures Which Support Very Fast Search Operations
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
The Correlation between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems
Computation of Boolean Functions on Networks of Binary Automata
A Polynomial-time Algorithm for the Bistable Roommates Problem
Embedding Planar Graphs in Four Pages
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
On the Approximation of Correlation Clustering and Consensus Clustering
Meta-kernelization with structural parameters
The maximal coordination principle in regulatory Boolean networks
Secure and flexible cloud-assisted association rule mining over horizontally partitioned databases
Intrinsic complexity of learning geometrical concepts from positive data
On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves
The Complexity of Parallel Search
Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time
Circular pattern matching with k mismatches
Groups, the Theory of Ends, and Context-Free Languages
An application of quantum finite automata to interactive proof systems
Fuzzy LINMAP method for multiattribute decision making under fuzzy environments
String analysis by sliding positioning strategy
MIX is a 2-MCFL and the word problem in Z 2 is captured by the IO and the OI hierarchies
Efficient algorithms for counting parameterized list H-colorings
On time-symmetry in cellular automata
Fast and Efficient Solution of Path Algebra Problems
Video streaming application over WEAC protocol in MANET
When Can We Sort in o(n log n) Time?
Improved IP lookup technology for trie-based data structures
A Turing kernelization dichotomy for structural parameterizations of F-Minor-Free Deletion
Special issue on learning theory
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
Proving a Compiler Correct: A Simple Approach
Factorization of Operators II: A Nonlinear Volterra Method for Numerical Solution of Linear Fredholm Equations
A linear delay algorithm in SD set system and its application to subgraph enumeration
Complexity of reachability problems for finite discrete dynamical systems
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
CDPS: A cryptographic data publishing system
Structure des Grammaires d'Ambiguïté Bornée
Group Actions and Learning for a Family of Automata
Fully Parallelized Multi-Prover Protocols for NEXP-Time
One-Layer Routing without Component Constraints
Reducing graph transversals via edge contractions
A Prime Decomposition Theorem for Grammatical Families
Parameterized complexity of graph planarity with restricted cyclic orders
Join and subgraph sampling under degree constraints
The Computational Complexity of a Set of Quadratic Functions
Dimension, entropy rates, and compression
Betweenness estimation in OLSR-based multi-hop networks for distributed filtering
Closure Properties and Languages Defined by Bilinear Automata
Multi-prover Encoding Schemes and Three-prover Proof Systems
Semantics and Expressive Power of Nondeterministic Constructs in Deductive Databases
A brief history of Edward K. Blum and the Journal of Computer and System Sciences
The Combinatorics of Cache Misses during Matrix Multiplication
On Flowchart Theories. I. The Deterministic Case
A Generalization of the Theory of Incompletely Specified Machines
Computing with Discrete Multi-Valued Neurons
Verification of multi-linked heaps
Vulnerability of super extra edge-connected graphs
A necessary and sufficient condition for transforming limited accuracy failure detectors
On explaining integer vectors by few homogeneous segments
An O(n) Algorithm for Abelian p-Group Isomorphism and an O(n log n) Algorithm for Abelian Group Isomorphism
Spatial Query Optimization: From Boolean Constraints to Range Queries
Selecting and using views to compute aggregate queries
Finding Level-Ancestors in Trees
Dynamics stability in wireless sensor networks active defense model
Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
Grammar-compressed indexes with logarithmic search time
Internet traffic clustering with side information
T^omega as a Universal Domain
Sequential predictions based on algorithmic complexity
Corrigendum to "Completeness results for graph isomorphism" [J. Comput. System Sci. 66(2003) 549-566]
A Simple Undecidable Problem: Existential Agreement of Inverses of Two Morphisms on a Regular Language
Simulated annealing in convex bodies and an O * ( n 4 ) volume algorithm
Induced minor models. I. Structural properties and algorithmic consequences
PSPACE Is Provable by Two Provers in One Round
The restriction mapping problem revisited
The maximal number of cubic runs in a word
Unbounded Fan-In Circuits and Associative Functions
Randomized diffusion for indivisible loads
Secure administration of cryptographic role-based access control for large-scale cloud storage systems
Uniform constant-depth threshold circuits for division and iterated multiplication
A Completeness Problem for Pattern Generation in Tessellation Automata
On the structure of bispecial Sturmian words
Attack and defense in the layered cyber-security model and their (1 ± ϵ )-approximation schemes
Testable and untestable classes of first-order formulae
The complexity of approximately counting stable roommate assignments
Bisimulation equivalence and regularity for real-time one-counter automata
Checking Automata and One-Way Stack Languages
Edge-Connectivity Augmentation Problems
Malware behavioural detection and vaccine development by using a support vector model classifier
Continuous Algebras Revisited
Thresholding random geometric graph properties motivated by ad hoc sensor networks
Core stability in additively separable hedonic games of low treewidth
Fair exchange of valuable information: A generalised framework
Approximating the existential theory of the reals
Practically-self-stabilizing virtual synchrony
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Advanced orthogonal RAID based on virtual disks
2-Testability and Relabelings Produce Everything
Two-Way Nested Stack Automata Are Equivalent to Two-Way Stack Automata
One-Way Weak-Stack-Counter Automata
The complexity of unions of disjoint sets
Auditing Boolean attributes
Probabilistic Complexity Classes and Lowness
Kernelization using structural parameters on sparse graph classes
Using views to generate efficient evaluation plans for queries
Complexity of the multilevel critical node problem
Stochastic Complexity in Learning
On Tape-Bounded Complexity Classes and Multihead Finite Automata
Mengerian graphs: Characterization and recognition
Parameterised temporal exploration problems
Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs
Attractors of Linear Cellular Automata
Lower bounds on the complexity of MSO 1 model-checking
Special issue on intelligent and innovative information systems
Faster algorithms for finding and counting subgraphs
Languages given by finite automata over the unary alphabet
Realizations by Stochastic Finite Automata
Trust enhanced distributed authorisation for web services
A Near-Optimal Method for Reasoning about Action
Indecomposable Parallel Maps in Tessellation Structures
Sorting nine inputs requires twenty-five comparisons
A Framework for Measuring Differences in Data Characteristics
Kernelizations for the hybridization number problem on multiple nonbinary trees
On Some Properties of the Free Monoids with Applications to Automata Theory
Isomorphism and canonization of tournaments and hypertournaments
Constant time parallel sorting: an empirical view
Finite-State omega-Languages
A methodology to develop awareness in computer supported collaborative work using policies
An FPT algorithm for timeline cover
Some Clarifications of the Concept of a Garden-of-Eden Configuration
Single-Valued a-Transducers
Arity Bounds in First-Order Incremental Evaluation and Definition of Polynomial Time Database Queries
Automorphisms of Linear Automata
Endomorphisms of Linear Automata
On the complexity of price equilibria
A Simulation Result for the Auxiliary Pushdown Automata
On Instance-Completeness for Database Query Languages involving Object Creation
Approximating Hyper-Rectangles: Learning and Pseudorandom Sets
Corrigendum: Space-Bounded Reducibility among Combinatorial Problems
Quantifying leakage in the presence of unreliable sources of information
The Complexity of Two-Player Games of Incomplete Information
Recursion and Iteration in Continuous Theories: The "M-Construction"
On the finite and general implication problems of independence atoms and keys
Controlling mean queuing delay under multi-class bursty and correlated traffic
Robust optimization in the presence of uncertainty: A generic approach
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Decidable and expressive classes of probabilistic automata
Approximation algorithms for clustering with dynamic points
Interfacing remote transaction services using UPnP
Online computation with untrusted advice
A Faster Algorithm Computing String Edit Distances
Fault Tolerant Cellular Spaces
On Maximal Order for Local and Global Numerical Problems
Learning intersections and thresholds of halfspaces
Randomness vs Time: Derandomization under a Uniform Assumption
On the Expressive Power of Temporal Logic
Inductive Definability in Formal Language Theory
SEMD: Secure and efficient message dissemination with policy enforcement in VANET
Adaps - A three-phase adaptive prediction system for the run-time of jobs based on user behaviour
A new temporal interpretation of cluster editing
A conditional independence algorithm for learning undirected graphical models
Macro Tree Transducers
Bounds on the OBDD-size of integer multiplication via universal hashing
Read-abortion (RA) based synchronization protocols to prevent illegal information flow
Inferring descriptive generalisations of formal languages
Chebyshev Solution of Large Linear Systems
The complexity of minimum-length path decompositions
Trading performance for stability in Markov decision processes
Matrix and Matricial Iteration Theories, Part I
On finding separators in temporal split and permutation graphs
On Transformations of Programs
Finding the Median Distributively
Time- and Tape-Bounded Turing Acceptors and AFLs
Learning with side information: PAC learning bounds
μ-Limit sets of cellular automata from a computational complexity perspective
The complexity of verbal languages over groups
Time-Space Tradeoffs for SAT on Nonuniform Machines
Revisiting path contraction and cycle contraction
Vacillatory Learning of Nearly Minimal Size Grammars
Injectivity and Surjectivity of Parallel Maps for Cellular Automata
A distributed multi-agent meeting scheduler
Sensitivity analysis and efficient method for identifying optimal spaced seeds
Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits
Model interoperability via Model Driven Development
Clustering with qualitative information
Classification of Noncounting Events
Temporal cliques admit sparse spanners
A Geometric Hierarchy of Languages
Data reductions and combinatorial bounds for improved approximation algorithms
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
Optimal Parallel Suffix Tree Construction
On Some Decision Problems for RAM Programs
Minimizing maximum fiber requirement in optical networks
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
Single-exponential FPT algorithms for enumerating secluded F-free subgraphs and deleting to scattered graph classes
On Denotational versus Predicative Semantics
A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems
Parameterized complexity of categorical clustering with size constraints
Pebbling meets coloring: Reversible pebble game on trees
Node placement for wireless mesh networks: Analysis of WMN-GA system simulation results for different parameters and distributions
A general dimension for query learning
Subrecursive Programming Languages. II. On Program Size
Implementation of Data Types by Algebraic Methods
Agnostic Learning of Geometric Patterns
A 43-approximation algorithm for the Maximum Internal Spanning Tree Problem
Nominal Lawvere Theories: A category theoretic account of equational theories with names
The complexity of weighted and unweighted #CSP
Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks
On the Fixpoints of Nondeterministic Recursive Definitions
Path-contractions, edge deletions and connectivity preservation
Understanding PPA-completeness
Learning Boolean Read-Once Formulas over Generalized Bases
Decomposition of quantum Markov chains and its applications
Relativized Counting Classes: Relations among Thresholds, Parity, and Mods
Incompressibility of H -free edge modification problems: Towards a dichotomy
Logic over Words on Denumerable Ordinals
Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets
Predicting user personality by mining social interactions in Facebook
The complexity of online manipulation of sequential elections
Geodesic stability for memoryless binary long-lived consensus
Pattern Reproduction in Tessellation Automata of Arbitrary Dimension
On the realisability of double-cross matrices by polylines in the plane
Aggregate Operators in Constraint Query Languages
On the Extension of Gladkij's Theorem and the Hierarchies of Languages
Approximate selection with unreliable comparisons in sublinear time
Listing Graphs That Satisfy First-Order Sentences
A fixed-parameter algorithm for minimum quartet inconsistency
"Natural" Properties of Flowchart Step-Counting Measures
Dynamics of Discrete Systems and Pattern Reproductions
Algorithms for Producing Grammars from Sample Derivations: A Common Problem of Formal Language Theory and Developmental Biology
Regular expressions for data words
The Equivalence of Several Initial Value Methods for Solving Integral Equations
Straight-Line Program Length as a Parameter for Complexity Analysis
Pseudorandom Sources for BPP
An information statistics approach to data stream and communication complexity
Correction to "Computational Complexity of Algebraic Functions"
The orchard visibility problem and some variants
Decoding turbo-like codes via linear programming
Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, II
A secure searchable encryption scheme for cloud using hash-based indexing
A local approach for temporal model checking of Java bytecode
Inclusion Problems in Parallel Learning and Games
Min-Wise Independent Permutations
A novel distributed framework for optimizing query routing trees in wireless sensor networks via optimal operator placement
A Parametric Method for Solving Certain Nonconcave Maximization Problems
Minimization of decision trees is hard to approximate
Every Discrete Input Machine is Linearly Simulatable
The relative worst-order ratio applied to paging
Erratum to "Languages not recognizable in real time by one-dimensional cellular automata" [J. Comput. System Sci 74 (7) (2008) 1095-1102]
Special issue on Algorithmic Theory of Dynamic Networks and Its Applications - Preface
Taking It to the Limit: On Infinite Variants of NP-Complete Problems
Online Learning of Binary and n-ary Relations over Clustered Domains
Learning with ordinal-bounded memory from positive data
Completeness Problem of One-Dimensional Binary Scope-3 Tessellation Automata
On the Complexity of Iterated Shuffle
Finding k -secluded trees faster
Optimization and Security Issues for Next Generation Networks - Editorial
Towards declarative comparabilities: Application to functional dependencies
A Completeness Theorem for the Expressive Power of Higher-Order Algebraic Specifications
A Computational Approach to the Maximum Principle
Model-driven development of adaptive web service processes with aspects and rules
On Alternating omega-Automata
Conditional Rewrite Rules: Confluence and Termination
Control complexity in Bucklin and fallback voting: A theoretical analysis
The GUHA method and its meaning for data mining
Online linear optimization and adaptive routing
The Normal Domination Game in graphs
An Efficient Interpreter for the Lambda-Calculus
Degree-Languages: A New Concept of Acceptance
Performance modeling and evaluation of heterogeneous computer networks
Theory and application of width bounded geometric separators
Interactive self-adaptive clutter-aware visualisation for mobile data mining
Corrigendum to "Another approach to the equivalence of measure-many one-way quantum infinite automata and its application" [J. Comput. Syst. Sci. 78(3) (2012) 807-821]
The complexity of the temporal logic with "until" over general linear time
Parallel Construction of Subdivision Hierarchies
Answering Queries Using Limited External Query Processors
Implicit B -trees: a new data structure for the dictionary problem
On the Complexity of Computing Bilinear Forms with {0, 1} Constants
Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
Algebraic Principles for the Analysis of a Biochemical System
Adherences of Languages
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
Specified Precision Polynomial Root Isolation Is in NC
Closure and nonclosure properties of the classes of compressible and rankable sets
Integrity constraints for XML
Fully dynamic all pairs shortest paths with real edge weights
Dependence logic with generalized quantifiers: Axiomatizations
Characterizations of Flowchartable Recursions
Global robust stability of delayed neural networks with a class of general activation functions
Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs
Reachability and connectivity queries in constraint databases
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
Local search: Is brute-force avoidable?
Complexity Metatheorems for Context-Free Grammar Problems
Disconnected cuts in claw-free graphs
Foreground Automata
Non-standard semantics of hybrid systems modelers
Finite automata for testing composition-based reconstructibility of sequences
Reliable energy-aware application mapping and voltage-frequency island partitioning for GALS-based NoC
On Comparison and Analysis of Algorithms for Multiplication in GF(2^m)
A Note on Structure and Looking Back Applied to the Complexity of Computable Functions
On Computational Reducibility
Finding diameter-reducing shortcuts in trees
Elasticity management of Streaming Data Analytics Flows on clouds
Multi-agent system for energy consumption optimisation in higher education institutions
An approach for lifetime reliability analysis using theorem proving
Orienting undirected phylogenetic networks
Hierarchical multi-label classification using local neural networks
Scalar and Vector Iteration
Heterogeneity and thermal aware adaptive heuristics for energy efficient consolidation of virtual machines in infrastructure clouds
Almost-natural proofs
Corrigendum to "Evaluating rail transit timetable using big passengers' data" [J. Comput. Syst. Sci. 82 (1, Part B) (2016) 144-155]
Space-Bounded Reducibility among Combinatorial Problems
New lower bounds for statistical query learning
Grammatical inference of directed acyclic graph languages with polynomial time complexity
Integer Circuit Evaluation Is PSPACE-Complete
Defending against wireless network intrusion
Sequencing by hybridization in few rounds
A 1.375-approximation algorithm for unsigned translocation sorting
The complexity of planar Boolean #CSP with complex weights
Compact samples for data dissemination
Automatic Generation of Test Data for Relational Queries
On finitary functors and their presentations
Division in Idealized Unit Cost RAMS
Adapting attackers and defenders patrolling strategies: A reinforcement learning approach for Stackelberg security games
Structural Properties of the String Statistics Problem
Translatability of Flowcharts into While Programs
Average parameterization and partial kernelization for computing medians
Practical Decidability
A note on approximating the min-max vertex disjoint paths on directed acyclic graphs
Methods for reconstructing the history of tandem repeats and their application to the human genome
Your rugby mates don't need to know your colleagues: Triadic closure with edge colors
Deciding the Vapnik-Červonenkis Dimension in ∑ p 3 -Complete
Planarity Testing in Parallel
Syntactic Operators on Full SemiAFLs
Temporal Connectives Versus Explicit Timestamps to Query Temporal Databases
Quantum Lower Bounds by Quantum Arguments
On the Perceptron Learning Algorithm on Data with High Precision
An effective signal strength-based wireless location estimation system for tracking indoor mobile users
Automatic learners with feedback queries
Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem
Secure deduplication storage systems supporting keyword search
When are different type-logical semantic definitions defining equivalent meanings?
A Constant-Factor Approximation Algorithm for the k-Median Problem
Predecessor Machines
Perfect correspondences between dot-depth and polynomial-time hierarchies
Semantics of Nondeterminism, Concurrency, and Communication
Global Exponential Stability and Periodic Solutions of Delayed Cellular Neural Networks
Performance modelling and evaluation of computer systems
An Algebra of Processes
Learning with errors in answers to membership queries
Program Schemes, Recursion Schemes, and Formal Languages