yusuke1997/dblp-id-title huggingface dataset:
Trace malicious source to guarantee cyber security for mass monitor critical infrastructure
Subexponential algorithms for variants of the homomorphism problem in string graphs
Verification of relational transducers for electronic commerce
Deciding equivalence of top-down XML transformations in polynomial time
Distributed agreement in dynamic peer-to-peer networks
Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017
Prediction and dimension
A general framework for secure sharing of personal health records in cloud system
Bisection of bounded treewidth graphs by convolutions
Recurrence relations, succession rules and the positivity problem
Duality Theory for Discrete-Time Linear Systems
On the determinacy of concurrent games on event structures with infinite winning sets
Collapsing Degrees via Strong Computation
Exact and parameterized algorithms for the independent cutset problem
On Parikh Slender Languages and Power Series
Every Semilinear Set is a Finite Union of Disjoint Linear Sets
Additive approximation algorithms for modularity maximization
Multiattribute decision making models and methods using intuitionistic fuzzy sets
Minimum separator reconfiguration
A dichotomy in the complexity of counting database repairs
Complexity-Class-Encoding Sets
Fingerprints in compressed strings
New inapproximability bounds for TSP
Belief revision within fragments of propositional logic
Measuring nondeterminism in pushdown automata
Time Bounded Random Access Machines
Probabilistic Communication Complexity
Verification of object-oriented programs: A transformational approach
Omega-Computations on Deterministic Pushdown Machines
Optimal Parallel Selection has Complexity O(Log Log n)
User popularity-based packet scheduling for congestion control in ad-hoc social networks
A framework for adaptive collective communications for heterogeneous hierarchical computing systems
Dynamic Dictionary Matching
An improved accuracy measure for rough sets
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
Optimal Order for Approximation of Derivatives
SLA-based admission control for a Software-as-a-Service provider in Cloud computing environments
On bounded block decomposition problems for under-specified systems of equations
Theoretical and practical aspects of warehousing, querying and mining sensor and streaming data
Invertible Linear Cellular Automata over Z m : Algorithmic and Dynamical Aspects
Parallelizing XML data-streaming workflows via MapReduce
k+1 Heads Are Better than k for PDAs
New Hash Functions and Their Use in Authentication and Set Equality
On pebble automata for data languages with decidable emptiness problem
The exact complexity of projective image matching
Distributed XML Processing and Management: Theory and Practice
Gap preserving reductions between reconfiguration problems
Trees and learning
An Interpretation-Oriented Theorem Prover over Integers
Worst-case optimal algorithm for XPath evaluation over XML streams
Maximum (s, t)-Flows in Planar Networks in O(|V|log|V|)-Time
A Decomposition Method for Structured Linear and Nonlinear Programs
Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes
Parameterized complexity of firefighting
Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs
Tight Lower Bounds on the Size of Sweeping Automata
The Complexity of Restricted Regular Expressions and the Synthesis Problem for Finite Automata
Some Properties of the Class of L Languages with Interactions
Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures
Reducing mechanism design to algorithm design via machine learning
Concurrent Operations on B*-Trees with Overtaking
Generating Quasi-random Sequences from Semi-random Sources
Causal graphs and structurally restricted planning
AdapBlinker: Robust adaptive median filter approach to detect subtle eye blinks
On the approximability of clique and related maximization problems
Synthesis of Reactive(1) designs
Non-Deterministic Communication Complexity with Few Witnesses
Games Against Nature
Size complexity of rotating and sweeping automata
Selective monitoring
Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words
Combinatorial filter reduction: Special cases, approximation, and fixed-parameter tractability
Parametrization for Order-Sorted Algebraic Specification
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
A Characterization of Finite fd-Acyclicity
Quantum cooperative search algorithm for 3-SAT
Context Free Normal Systems and ETOL Systems
Applications of Range Query Theory to Relational Data Base Join and Selection Operations
Unification Modulo an Equality Theory for Equational Logic Programming
Direct or Cascade Product of Pushdown Automata
Interactive Languages
Time-sharing scheduling with tolerance capacities
Improving a fixed parameter tractability time bound for the shadow problem
The Set Coincidence Game: Complexity, Attainability, and Symmetric Strategies
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Rejecting jobs to minimize load and maximum flow-time
Completely inapproximable monotone and antimonotone parameterized problems
The power of verification for one-parameter agents
A lightweight dynamic pseudonym identity based authentication and key agreement protocol without verification tables for multi-server architecture
Foundations of System Theory: The Hankel Matrix
Parameterized approximation via fidelity preserving transformations
Competitive k-Server Algorithms
Petri Nets and Regular Languages
Sliding window temporal graph coloring
Les 1-Convexes du Monoïde Commutatif N^n
Distributed reconfiguration of maximal independent sets
Independence Results in Computer Science?
The Lob-Pass Problem
Complexity of regular functions
Solution of Eigenvalue Problems in Hilbert Spaces by a Gradient Method
A Fault-Tolerance Model for Multiprocessor Real-Time Systems
On Causal omega^2-Systems
Conversion of Programs Between Computers: Interpreters, Simulators and Compilers
Lower Bounds on the Size of Deterministic Parsers
Derivatives and partial derivatives for regular shuffle expressions
A Theory of Type Polymorphism in Programming
A 5/4 Linear Time Bin Packing Algorithm
Algebras of Iteration Theories
Stability and performance analysis of randomly deployed wireless networks
With Probability One, a Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy
Tests for the LR-, LL-, and LC-Regular Conditions
Simple picture processing based on finite automata and regular grammars
Dynamic Algebras with Test
On the parameterized complexity of clustering problems for incomplete data
Autonomous and adaptive resource allocation among multiple nodes and multiple applications in heterogeneous wireless networks
Lower Bounds for Language Recognition on Two-Dimensional Alternating Multihead Machines
Domino-Tiling Games
Near-optimal dispersion on arbitrary anonymous graphs
Rooted Branching Bisimulation as a Congruence
Complexity of Certain Decision Problems about Congruential Languages
Bounds on the cover time of parallel rotor walks
Sparse regression learning by aggregation and Langevin Monte-Carlo
Expressive Completeness Failure in Branching Time Structures
Combining decomposition and reduction for state space analysis of a self-stabilizing system
Procedural Languages for Database Queries and Updates
On a generalization of Nemhauser and Trotter's local optimization theorem
The Relation Between Derivations and Syntactical Structures in Phrase-Structure Grammars
Inclusion dependencies and their interaction with functional dependencies in SQL
Relaxed multi-way trees with group updates
Multi-round cooperative search games with multiple players
An improved algorithm for the minmax regret path centdian problem on trees
Combining polynomial running time and fast convergence for the disk-covering method
The Equivalence of RE Program Schemes and Data Flow Schemes
From symmetry to asymmetry: Generalizing TSP approximations by parametrization
Game semantics approach to higher-order complexity
Specification and Top-Down Design of Distributed Systems
Complete Geometric Query Languages
Conjunctive query containment over trees
Foreword from the guest editors
On the Complexity of Computations under Varying Sets of Primitives
How to Emulate Shared Memory
Gaussian-Gamma collaborative filtering: A hierarchical Bayesian model for recommender systems
Difunctionally Induced State Machines
Bin packing with fixed number of bins revisited
Optimal-depth sorting networks
An analytical model for loss estimation in network traffic analysis systems
On the Parallel Complexity of Gaussian Elimination with Pivoting
Expressiveness and static analysis of extended conjunctive regular path queries
Multi-version Concurrency Control Scheme for a Database System
A cross layer optimization modeling for a periodic WSN application
Efficient approximation of convex recolorings
Unilateral Context Sensitive Grammars and Left-to-Right Parsing
AC 0 ∘MOD 2 lower bounds for the Boolean Inner Product
Linear Positive Machines
Database Theory 2004
On Rearrangeable and Non-Blocking Switching Networks
Intrinsically universal n-dimensional quantum cellular automata
An induced OWA operator in coal mine safety evaluation
Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings
On complexity of single-minded auction
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
Edge-Contraction Problems
Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes
Growth Patterns of Ordered Cellular Automata
Sufficient Conditions for the Convergence of Monotonic Mathematical Programming Algorithms
Datalog vs First-Order Logic
Upper Bounds for Static Resource Allocation in a Distributed System
Combinatorial Techniques for Universal Hashing
Hide and seek with repetitions
Completeness of Context-Free Grammar Forms
Competitive Algorithms for Distributed Data Management
On the Power of Alternation in Automata Theory
Axiomatizations for downward XPath on data trees
Classifying invariant structures of step traces
Enabling device independent co-browsing through adaptive view points
Bounded Budget Connection (BBC) games or how to make friends and influence people, on a budget
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
Uniform generation in spatial constraint databases and applications
Once and for all
A 1.75-approximation algorithm for unsigned translocation distance
The gap in circumventing the impossibility of consensus
On sets without k-term arithmetic progression
Towards time domain invariant QoS measures for queues with correlated traffic
Implementing set objects in dynamic distributed systems
On the No-Z-Cycle Property in Distributed Executions
A Bound on the Multiplicative Efficiency of Iteration
The complexity of satisfiability problems: Refining Schaefer's theorem
Counting and enumerating tree-child networks and their subclasses
Improved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach
Systematic Approach to Reduction and Minimization in Automata and System Theory
An extension of the Moran process using type-specific connection graphs
General constructions for information-theoretic private information retrieval
Learning about the Parameter of the Bernoulli Model
Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds
Solving parity games in big steps
A linear algorithm for radio k-coloring of powers of paths having small diameters
Improved algorithms for feedback vertex set problems
Approximability of constrained LCS
Subquadratic non-adaptive threshold group testing
Solutions to the anti-piracy problem in oblivious transfer
Renaissance : A self-stabilizing distributed SDN control plane using in-band communications
Randomness is Linear in Space
A counterexample to Thiagarajan's conjecture on regular event structures
The Constructibility of a Configuration in a Cellular automaton
The Markov Algorithm as a Language Parser - Linear Bounds
On the complexity of rainbow vertex colouring diametral path graphs
Real object-oriented communication method for ad hoc networks
A secure self-destructing scheme for electronic data
On the Equivalence between Matrix Riccati Equations and Fredholm Resolvents
Weighted online search
On the Structure of Abelian Automata
Another Proof of the Theorem on Pattern Reproduction in Tessellation Structures
The chromatic number of the plane: The bounded case
Edge-Label Controlled Graph Grammars
Integer valued betting strategies and Turing degrees
A Measure of Relativized Space Which Is Faithful With Respect to Depth
Learning Regular Languages from Counterexamples
Effective Operators with No Strong Gaps
Comparing job allocation schemes where service demand is unknown
Self-adaptive federated authorization infrastructures
Scheduling multicasts on unit-capacity trees and meshes
The complexity of computing optimum labelings for temporal connectivity
Star Height of Certain Families of Regular Events
Bounded incentives in manipulating the probabilistic serial rule
Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges
Query Strategies for Priced Information
Sequentially swapping tokens: Further on graph classes
Modeling the dynamics of worm propagation using two-dimensional cellular automata in smartphones
Special Issue: Learning Theory 2006
Discrete-Time Machines in Closed Monoidal Categories. I
On Finding Minimal Length Superstrings
Semantic annotation of digital music
Comment on the Paper "Error Detection in Formal Languages"
Guest Editor's Forword
On polynomial kernels for sparse integer linear programs
Amalgamation of Graph Transformations: A Synchronization Mechanism
Partition Triples: A Tool for Reduction of Data Sets
Zigzag Decodable codes: Linear-time erasure codes with applications to data storage
A Generalized Nexttime Operator in Temporal Logic
Regular Description of Context-Free Graph Languages
LWPP and WPP are not uniformly gap-definable
Characterizing Language Identification by Standardizing Operations
Strict Deterministic Grammars
Bivariate B-splines from convex configurations
Finding the smallest binarization of a CFG is NP-hard
A Characterization of Semilinear Sets
Finding Smooth Integers in Short Intervals Using CRT Decoding
An improved two-party identity-based authenticated key agreement protocol using pairings
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents
Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms
Induced Disjoint Paths in AT-free graphs
Priority-grouping method for parallel multi-scheduling in Grid
Sparse approximation is provably hard under coherent dictionaries
What can be verified locally?
Maximal repetitions in strings
Undecidability of Safety for the Schematic Protection Model with Cyclic Creates
First-Order Logic and Star-Free Sets
Algebraic Structures in Linear Systems Theory
Optimization of LR(k) Parsers
Quantum random access stored-program machines
Infinite vs. finite size-bounded randomized computations
Stack Cooperation in Multistack Pushdown Automata
Recursion-theoretic ranking and compression
Optimized routing for video streaming in multi-hop wireless networks using analytical capacity estimation
A New Interpretation for Null Values in the Weak Instance Model
Certain Relations between Properties of Maps of Tessellation Automata
Interval Consistency of Asynchronous Distributed Computations
On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization
Fast processing of graph queries on a large database of small and medium-sized data graphs
Nonerasing Stack Automata
Multitape One-Way Nonwriting Automata
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In
Ambiguity in the Developmental Systems of Lindenmayer
Language equations, maximality and error-detection
A password authentication scheme over insecure networks
Combinatorial bandits
Hypergrammars: An Extension of Macrogrammars
A Kleene-like Characterization of Languages Accepted by Systolic Tree Automata
Optimizing large data transfers in parity-declustered data layouts
Partially ordered regular languages for graph queries
Branching-time model-checking of probabilistic pushdown automata
A 4 + ϵ approximation for k -connected subgraphs
The 2D Dependency Pair Framework for conditional rewrite systems. Part I: Definition and basic processors
DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization
Portfolio and investment risk analysis on global grids
The equivalence problem of multidimensional multitape automata
Fully Abstract Submodels of Typed Lambda Calculi
Solovay functions and their applications in algorithmic randomness
Paging Against a Distribution and IP Networking
Deciding definability by deterministic regular expressions
Symmetric polynomials over Z m and simultaneous communication protocols
Formal Software Specification with Refinements and Modules of Typed Graph Transformation Systems
Parameterized shifted combinatorial optimization
Energy-efficient wireless information retrieval
A Characterization of Automata and a Direct Product Decomposition
Cyclic Decomposition of Finite Stochastic Systems
On groups generated by bi-reversible automata: The two-state case over a changing alphabet
Dual power assignment via second Hamiltonian cycle
Complementing Deterministic Büchi Automata in Polynomial Time
Real-valued multiple-instance learning with queries
Copyless cost-register automata: Structure, expressiveness, and closure properties
Advanced topics on cloud computing
Path Constraints in Semistructured Databases
Generalized modal satisfiability
Maximizing data locality in distributed systems
Extracting fuzzy if-then rules by using the information matrix technique
Communication algorithms with advice
A method based on induced aggregation operators and distance measures to multiple attribute decision making under 2-tuple linguistic environment
An approximation trichotomy for Boolean #CSP
Probabilistic Encryption
A Minimum 3-Connectivity Augmentation of a Graph
ABE with improved auxiliary input for big data security
Conditional Grammars
The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies
Handle-Rewriting Hypergraph Grammars
A taxonomy for region queries in spatial databases
On the complexity of Newman's community finding approach for biological and social networks
Bounded AFLs
Generalized Sequential Machine Maps
Learning a hidden graph using O(logn) queries per edge
Languages not recognizable in real time by one-dimensional cellular automata
Building access control policy model for privacy preserving and testing policy conflicting problems
A Platform-Independent Component Modeling Language for Distributed Real-time and Embedded Systems
Cryptanalysis of a password authentication scheme over insecure networks
A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix
Autoreducibility, mitoticity, and immunity
Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models
P2P-MapReduce: Parallel data processing in dynamic Cloud environments
Towards a theoretical foundation for Laplacian-based manifold methods
Decision Trees with Boolean Threshold Queries
Web Grammars and Several Graphs
Prediction of short-lived TCP transfer latency on bandwidth asymmetric links
Learning finite cover automata from queries
Finding and fixing faults
Containment of queries for graphs with data
Maintaining awareness using policies; Enabling agents to identify relevance of information
DNA Models and Algorithms for NP-Complete Problems
Finding even subgraphs even faster
Improving network intrusion detection system performance through quality of service configuration and parallel technology
Regularizing conjunctive features for classification
The Equivalence Problem for Two DPDA's, One of Which is a Finite-Turn or One-Counter Machine
Efficient Symbolic Analysis of Programs
On the Family of Finite Index Matrix Languages
Effective Proper Procedures and Universal Classes of Program Schemata
Time-Space Tradeoffs for Algebraic Problems on General Sequential Machines
On Computing Serial Dependency Relations
Using the doubling dimension to analyze the generalization of learning algorithms
Indecomposable Maps in Tessellation Structures of Arbitrary Dimension
On the combinatorial design of data centre network topologies
On the Computational Complexity of Finite Cellular Automata
Object digitization up to a translation
On the NP-Isomorphism Problem with Respect to Random Instances
Does adding more agents make a difference? A case study of cover time for the rotor-router
Logics for unordered trees with data constraints
Complexity Tailored Design: A New Design Methodology for Databases With Incomplete Information
Performance analysis of multimedia based web traffic with QoS constraints
Can Datalog Be Approximated?
The Structure of Context-Free Grammatical Families
Approximating Steiner trees and forests with minimum number of Steiner points
Querying a graph database - language selection and performance considerations
Equivalence checking of quantum finite-state machines
Membership for Growing Context-Sensitive Grammars is Polynomial
Parameterized complexity of connected even/odd subgraph problems
Efficient Asynchronous Simulation of a Class of Synchronous Parallel Algorithms
Analysis and application of adaptive sampling
An Hierarchy Between Context-Free and Context-Sensitive Languages
A parallel computing method using blocked format with optimal partitioning for SpMV on GPU
Fault tolerance in cellular automata at high fault rates
Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
Uniform parsing for hyperedge replacement grammars
A Finite Step-Size Procedure for the F-W Method
View-based query answering in Description Logics: Semantics and complexity
Quantum Neural Networks
On LLP(k) Parsers
Undecidability of the structure of the Solovay degrees of c.e. reals
Distributions of Queue Lengths and Waiting Times in a Loop with Two-Way Traffic
A Logic Programming with Complex Objects
On Formalised Computer Programs
On the existence of subexponential parameterized algorithms
Behavior-based reputation management in P2P file-sharing networks
Network-aware heuristics for inter-domain meta-scheduling in Grids
An algorithm for accuracy enhancement of license plate recognition
Depth-Bounded Computation
Secure and efficient protection of consumer privacy in Advanced Metering Infrastructure supporting fine-grained data analysis
Asymptotic Miss Ratios over Independent References
Comment on "A strong provably secure IBE scheme without bilinear map" by M. Zheng, Y. Xiang and H. Zhou [J. Comput. Syst. Sci. 81 (2015) 125-131]
Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors
Normality in non-integer bases and polynomial time randomness
EV-Linker: Mapping eavesdropped Wi-Fi packets to individuals via electronic and visual signal matching
Outfix and Infix Codes and Related Classes of Languages
The Relational Model of Data and Cylindric Algebras
Query complexity of approximate equilibria in anonymous games
Formal verification of stability and chaos in periodic optical systems
A new approach to model virtual channels in interconnection networks
On the performance-driven load distribution for heterogeneous computational grids
A Nivat theorem for weighted picture automata and weighted MSO logics
Petri Nets and Regular Processes
Linear kernels for separating a graph into components of bounded size
Efficient parallel factorization and solution of structured and unstructured linear systems