yusuke1997/dblp-id-title huggingface dataset:
Free Semiring-Representations and Nondeterminism
A General Class of Resource Tradeoffs
On the reducibility of sets inside NP to sets with low information content
An efficient time-free solution to SAT problem by P systems with proteins on membranes
Solving large FPT problems on coarse-grained parallel machines
On the design of time-stamped signatures
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
Language Theoretic and Algorithmic Properties of d-dimensional Collages and Patterns in a Grid
From-below approximations in Boolean matrix factorization: Geometry and new algorithm
A refined search tree technique for Dominating Set on planar graphs
Vulnerability aware graphs for RFID protocol security benchmarking
Fast Algorithms for Bin Packing
Discrete geometry and topology and their applications to imaging sciences
Preimage problems for deterministic finite automata
New efficient velocity-aware probabilistic route discovery schemes for high mobility Ad hoc networks
Fast Modular Transforms
Circuits over PP and PL
Delay-insensitive computation in asynchronous cellular automata
Numberings optimal for learning
Approximating total flow time on parallel machines
A Slight Sharpening of LMN
A Theory of Orbital Behavior in a Class of Nonlinear Systems: Chaos and a Signature-Based Approach
On Two-Tape Real-Time Computation and Queues
On the Equality of Grammatical Families
Sequences, Datalog, and Transducers
The Complexity of Monadic Recursion Schemes: Exponential Time Bounds
Characterizing Rational Versus Exponential learning Curves
Vector Addition Systems and Regular Languages
Optimal Bounds for the Predecessor Problem and Related Problems
Why not Negation by Fixpoint?
A physically universal Turing machine
Equivalence and generalization in a layered network model
Coverability and multi-scale coverability on infinite pictures
Structural characterizations of the navigational expressiveness of relation algebras on a tree
Gust Editor's Foreword
On the complexity of the storyplan problem
A framework for discovering and classifying ubiquitous services in digital health ecosystems
Deletion to scattered graph classes I - Case of finite number of graph classes
Hypergraph Languages of Bounded Degree
Secure-channel free searchable encryption with multiple keywords: A generic construction, an instantiation, and its implementation
Branching Program Size Is Almost Linear in Formula Size
A Note on Decision Rules for Stochastic Programs
20th workshop on logic, language, information and computation - WoLLIC 2013
Processes of Transforming Structures
Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis
The Computation of Eigenvalues and Eigenvectors of a Completetly Continuous Self-Adjoint Operator
Exponentially more concise quantum recognition of non-RMM regular languages
On the advice complexity of the k-server problem
State Estimation for Infinite-Dimensional Systems
A Taxonomy of Complexity Classes of Functions
Variable and value elimination in binary constraint satisfaction via forbidden patterns
An n log n Algorithm for Determining the Congruity of Polyhedra
Bounded Arity Datalog (not-)Queries on Graphs
Better bounds for minimizing SONET ADMs
The Complexity of the Evaluation of Complex Algebra Expressions
New Algorithms for the LCS Problem
On the Isomorphism Conjecture for Weak Reducibilities
Software control flow error detection and correlation with system performance deviation
Minimalism, Justification and Non-Monotonicity in Deductive Databases
Complete simulation of automata networks
Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies
Special Issue on Mobile Social Networking and computing in Proximity (MSNP)
The inclusion problem for regular expressions
On the complexity of the spaced seeds
Editing to a planar graph of given degrees
HAMS: Scalable peer-to-peer multimedia streaming model in heterogeneous networks
Synchronous to Asynchronous Transformation of Polyautomata
Why a Single Parallelization Strategy Is Not Enough in Knowledge Bases
On the complexity of two-dimensional signed majority cellular automata
Weak Equivalence in a Class of Structured Program Schemes
Temporal Reachability Dominating Sets: Contagion in temporal graphs
The Surjectivity Problem for 2D Cellular Automata
Exploration of graphs with excluded minors
Homomorphism preservation on quasi-wide classes
Candidate Keys for Relations
Coping with Errors in Binary Search Procedures
Subword balance, position indices and power sums
Corrigendum: Topologically Sweeping an Arrangement
Minimum Disclosure Proofs of Knowledge
Affine Dynamical Systems
Multi-category classifiers and sample width
Deleting edges to restrict the size of an epidemic in temporal networks
An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log² n) Time
State complexity of operations on input-driven pushdown automata
Picture Iteration and Picture Ambiguity
On asymptotic gate complexity and depth of reversible circuits without additional memory
Corrigendum to "Uniform constant-depth threshold circuits for division and iterated multiplication" [J. Comput. System Sci. 65(4) (2002) 695-716]
A Self-Stabilizing Algorithm for Detecting Fundamental Cycles in a Graph
ETOL Forms
Data Structures for Distributed Counting
Special Issue: Learning Theory 2003
Faster compressed quadtrees
The Complexity of Recognizing Polyhedral Scenes
On the structural parameterized complexity of defective coloring
Maximal Machine Learnable Classes
Least Fixed Point of a Functor
Tree Acceptors and Some of Their Applications
Determinacy and rewriting of functional top-down and MSO tree transformations
LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata
Convergence with Hilbert's Space Filling Curve
A Matching Problem in the Plane
Computing maximal-exponent factors in an overlap-free word
Finite-state independence and normal sequences
On Recursion in ET0L Systems
Reliable agnostic learning
Sorting in Linear Time?
Multilevel Nested Relational Structures
A Low and a High Hierarchy within NP
Fast convolution and Fast Fourier Transform under interval and fuzzy uncertainty
A linear time algorithm for the induced disjoint paths problem in planar graphs
On the formal semantics of IF-like logics
Optimizing adaptive multi-route query processing via time-partitioned indices
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression
How fast can we reach a target vertex in stochastic temporal graphs?
Fault Tolerant Cellular Automata
Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength
Factoring Multivariate Polynomials over Finite Fields
Revisiting the complexity of and/or graph solution
The many faces of a translation
Cyclic-routing of Unmanned Aerial Vehicles
Sorting Using Networks of Deques
Deciding Bisimilarity and Similarity for Probabilistic Processes
A Note on Sparse Oracles for NP
Extensions of Asynchronous Circuits and the Delay Problem. Part II: Spike-Free Extensions and the Delay Problem of the Second Kind
Bipartite 3-regular counting problems with mixed signs
Proper learning of k -term DNF formulas from satisfying assignments
On the complexity of approximating the VC dimension
Classical complexity and quantum entanglement
Reversible pushdown automata
Peak power modeling for join algorithms in DBMS
A Framework for Testing Safety and Effective Computability
Communication in Concurrent Dynamic Logic
Bootstrap analysis of multiple repetitions of experiments using an interval-valued multiple comparison procedure
Parameterized results on acyclic matchings with implications for related problems
Special issue on computational learning theory
On predictive accuracy and risk minimization in pairwise label ranking
Lower Bounds for Linearly Transformed OBDDs and FBDDs
Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems
Approximation algorithms for covering/packing integer programs
Distributional learning of conjunctive grammars and contextual binary feature grammars
On the complexity of regular-grammars with integer attributes
On Locating Minimum Feedback Vertex Sets
HEX: Scaling honeycombs is easier than scaling clock trees
Faster exact algorithms for some terminal set problems
XML data update management in XML-enabled database
Every Finite Sequential Machine is Linearly Realizable
On the optimality of exact and approximation algorithms for scheduling problems
On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates
Another approach to the equivalence of measure-many one-way quantum finite automata and its application
A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets
On abstract resource semantics and computability logic
On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints
The power of knowledge in linear search for an escaping target
Competitive Paging with Locality of Reference
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
Faster Graph bipartization
Trajectory databases: Data models, uncertainty and complete query languages
Writing Pushdown Acceptors
Probabilistic Counting Algorithms for Data Base Applications
Deciding unique decodability of bigram counts via finite automata
Group Structured Linear Cellular Automata over Zm
Exponential Bounds for the Running Time of a Selection Algorithm
The parameterized complexity of the survivable network design problem
Bringing memory to Boolean networks: A unifying framework
Optimal Circular Arc Representations: Properties, Recognition, and Construction
Theories of Automata on omega-Tapes: A Simplified Approach
The Tree Projection Theorem and Relational Query Processing
An Exponential Lower Bound for the Size of Monotone Real Circuits
The complexity of online bribery in sequential elections
Overlaps in Free Partially Commutative Monoids
The Discrete Logarithm Modulo a Composite Hides O(n) Bits
Typechecking for XML transformers
Monotonic Aggregation in Deductive Database
On Cancellation Properties of Languages which are Supports of Ration Power Series
A small minimal aperiodic reversible Turing machine
Cluster-based topologies for 3D Networks-on-Chip using advanced inter-layer bus architecture
Serializability Theory for Replicated Databases
Hierarchies of Hyper-AFLs
A Generator of Contex-Sensitive Languages
Scheduling loosely connected task graphs
Datalog Extensions for Database Queries and Updates
Solving mesh router nodes placement problem in Wireless Mesh Networks by Tabu Search algorithm
The Correctness of Programs
Special Issue on the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)
Graph Isomorphism and Identification Matrices: Sequential Algorithms
Regular Sequence Operations and Their Use in Database Queries
Monotone Separation of Logarithmic Space from Logarithmic Depth
Preprocessing to reduce the search space: Antler structures for feedback vertex set
Foreword: Selected papers from the 22nd International Symposium on Fundamentals of Computation Theory (FCT 2019)
Universal stability in multi-hop radio networks
What's Decidable about Hybrid Automata?
Efficient genetic based topological mapping using analytical models for on-chip networks
Proof theory of higher-order equations: conservativity, normal forms and term rewriting
Minimizing Access Pointers into Trees and Arrays
A formal analysis of information disclosure in data exchange
On the computational power of circuits of spiking neurons
How similar are two elections?
Individual communication complexity
Approximate shortest paths in weighted graphs
Increasing the Resilience of Distributed and Replicated Database Systems
Editorial: Special Issue on Theory and Applications in Parallel and Distributed Computing Systems
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
The Verso Algebra or How to Answer Queries with Fewer Joins
An Optimal Algorithm for Scheduling Interval Ordered Tasks with Communication on N Processors
Reconfiguration on sparse graphs
Irreducibility of Multivariate Polynomials
Subcomplete Generalizations of Graph Isomorphism
The Complexity of Problems in Systems of Communicating Sequential Processes
The Riccati Equation and Its Bounds
What is decidable about partially observable Markov decision processes with ω-regular objectives
On Homomorphisms, Correctness, Termination, Unfoldments, and Equivalence of Flow Diagram Programs
A Note on Multiple-Entry Finite Automata
An n 2 -bound for the ultimate equivalence problem of certain D0L systems over an n -letter alphabet
Lifting query complexity to time-space complexity for two-way finite automata
Concurrent Histories: A Basis for Observing Distributed Systems
On the Computational Complexity of Path Cover Problems
Editorial - Special issue on Concurrency Theory (CONCUR 2018)
Complexity of road coloring with prescribed reset words
Balanced energy allocation scheme for a solar-powered sensor system and its effects on network-wide performance
Efficient algorithms for the inverse sorting problem with bound constraints under the l ∞ -norm and the Hamming distance
On Commutative Context-Free Languages
The tight asymptotic approximation ratio of First Fit for bin packing with cardinality constraints
The most probable annotation problem in HMMs and its application to bioinformatics
Space complexity of reachability testing in labelled graphs
Graph Grammars and Applications to Specialization and Evolution in Biology
Deterministic Multitape Automata Computations
Approximation of satisfactory bisection problems
An Adaptive Dynamic Grid-Based approach to DDM for large-scale distributed simulation systems
Homomorphic Images of Linear Sequential Machines
Towards a heterogeneous and adaptive parallel Branch-and-Bound algorithm
Evaluating rail transit timetable using big passengers' data
Special Issue: FOCS 2003
Improved approximation algorithms for Directed Steiner Forest
Foreword: Intelligent data analysis
Special issue on energy efficient methods and systems in the emerging cloud era
Analysing distributed Internet worm attacks using continuous state-space approximation of process algebra models
Markov network based ontology matching
On multi-processor speed scaling with migration
Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique
Multicut in trees viewed through the eyes of vertex cover
Complete Problems in the First-Order Predicate Calculus
A Note on Batch and Incremental Learnability
Publicly verifiable databases with efficient insertion/deletion operations
Relativized Alternation and Space-Bounded Computation
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Remarks on permutive cellular automata
Multicriteria fuzzy decision-making methods based on intuitionistic fuzzy sets
Improved Bounds on the Sample Complexity of Learning
Performance evaluation of supercomputers using HPCC and IMB Benchmarks
Some generalized dependent aggregation operators with intuitionistic linguistic numbers and their application to group decision making
Many-one Degrees Associated with Semi-Thue Systems
Learning with stochastic inputs and adversarial outputs
Monitoring the edges of a graph using distances with given girth
Boolean dependence logic and partially-ordered connectives
Scaled dimension and nonuniform complexity
Algorithmic Approximations
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
Algebraic Properties of Derivation Words
Realization of Finite Automata with Linear Parts
Correctness Proofs of Syntax-Directed Processing Descriptions by Attributes
Genomorphisms of Semi-Modular Lattices
Corrigendum to "Homomorphism preservation on quasi-wide classes" [J. Comput. Syst. Sci. 76 (5) (2010) 324-332]
On AFL Generators for Finitely Encoded AFA
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases
Fixed points in conjunctive networks and maximal independent sets in graph contractions
Marked Directed Graphs
Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits
Maximal margin classification for metric spaces
Generation of Near-Optimal Universal Boolean Functions
Corrigendum to "Shifting: One-inclusion mistake bounds and sample compression" [J. Comput. System Sci 75 (1) (2009) 37-59]
Fast and succinct population protocols for Presburger arithmetic
A data intensive heuristic approach to the two-stage streaming scheduling problem
Scalable load balancing congestion-aware Network-on-Chip router architecture
A distributed concurrency control mechanism for XML data
Unlabeled sample compression schemes and corner peelings for ample and maximum classes
Consistency in Nondeterministic Storage
An O ( n 2 ) algorithm for signed translocation
From Lawvere to Brandenburger-Keisler: Interactive forms of diagonalization and self-reference
Topological analysis of voxelized objects by discrete geodesic Reeb graph
TARD: Temporary Access Rights Delegation for guest network devices
Simple Counter Machines and Number-Theoretic Problems
Theory of omega-Languages. II. A Study of Various Models of omega-Type Generation and Recognition
Propositional Dynamic Logic of Nonregular Programs
Tolerant property testing and distance approximation
Learning Binary Perceptrons Perfectly Efficiently
Counting minimal transversals of β -acyclic hypergraphs
Finding the Median
On Approximate Nearest Neighbors under l infinity Norm
Bankrupting Sybil despite churn
Localising temporal constraints in scientific workflows
The Complexity of Connectivity Problems on Context-Free Graph Languages
A uniquely ergodic cellular automaton
Minimizing nfa's and regular expressions
Planar graphs, negative weight edges, shortest paths, and near linear time
Classifying Regular Events in Symbolic Logic
When are epsilon-nets small?
Computing Geodesic Furthest Neighbors in Simple Polygons
The complexity of routing with collision avoidance
Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, I
An improved algorithm for the minmax regret path center problem on trees
Better spaced seeds using Quadratic Residues
Learning Fixed Point Patterns by Recurrent Networks
On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence
Limitedness Theorem on Finite Automata with Distance Functions
Real-Time Language Recognition by One-Dimensional Cellular Automata
The parameterised complexity of counting connected subgraphs and graph motifs
Space and speed tradeoffs in TCAM hierarchical packet classification
Polynomial anonymous dynamic distributed computing without a unique leader
The complexity of equivalence, entailment, and minimization in existential positive logic
On the degrees of non-regularity and non-context-freeness
On the Isolation of the Roots of a Non-Linear Operator
Parameterized aspects of triangle enumeration
Operation-Preserving Functions and Autononous Factors of Finite Automata
Editors' foreword for JCSS WoLLIC 2008
Unit interval vertex deletion: Fewer vertices are relevant
The Steiner Tree Problem in Orientation Metrics
Exact Classification with Two-Layer Neural Nets
Implicit branching and parameterized partial cover problems
Correctness of Recursive Parallel Nondeterministic Flow Programs
Efficiently supporting secure and reliable collaboration in scientific workflows
Evaluation of struggle strategy in Genetic Algorithms for ground stations scheduling problem
A representation independent language for planar spatial databases with Euclidean distance
Bounding the number of reticulation events for displaying multiple trees in a phylogenetic network
Context-Free Grammars with Graph-Controlled Tables
Resource Bounds for Parallel Computation of Threshold and Symmetric Functions
Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform on any General Sequential Random-Access Computer
Port Automata and the Algebra of Concurrent Processes
Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs
An Application of Cohen's Result on Star Height to the Theory of Control Structures
A unified theory of structural tractability for constraint satisfaction problems
Eccentricity terrain of δ -hyperbolic graphs
Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis
Criticisms of modelling packet traffic using long-range dependence (extended version)
On Storing Concatenable Arrays
A dichotomy for bounded degree graph homomorphisms with nonnegative weights
Deterministic non-adaptive contention resolution on a shared channel
On approximating weighted sums with exponentially many terms
Propagating XML constraints to relations
Computational capabilities of analog and evolving neural networks over infinite input streams
P-Selektive Self-Reducible Sets: A New Characterization of P
Query Languages for Bags and Aggregate Functions
Connected facility location via random facility sampling and core detouring
Verifying of interface assertions for infinite state Mealy machines
New Lowness Results for ZPPNP and Other Complexity Classes
Absolute convergence and error thresholds in non-active adaptive sampling
Locally Testable Languages
Stateless data concealment for distributed systems
A single-exponential FPT algorithm for the K 4 -minor cover problem
Establishing evolutionary game models for CYBer security information EXchange (CYBEX)
Reducing the vertex cover number via edge contractions
Deterministic Stack Automata and the Quotient Operator
Intercalation Lemmas for Tree Transducer Languages
Comparing Complexity Classes
Driver behaviour detection and vehicle rating using multi-UAV coordinated vehicular networks
Unique end of potential line
Frequency of Decomposability among Machines with a Large Number of States
A two-class parallel system with general service times of the parallel class
46th International Colloquium on Automata, Languages and Programming (ICALP 2019) - Track C: Foundations of networks and multi-agent systems
Recursion-Closed Algebraic Theories
Langages à un Compteur
Some measures of dissimilarity in intuitionistic fuzzy structures
Learning with belief levels
Incremental Learning from Positive Data
1-Way Stack Automaton with Jumps
Remarks on Recursion versus Diagonalization and Exponentially Difficult Problems
On the parameterized complexity of computing good edge-labelings
Tape-Reversal Bounded Turing Machine Computations
Modeling and performance evaluation of stealthy false data injection attacks on smart grid in the presence of corrupted measurements
Unsupervised traffic classification using flow statistical properties and IP packet payload
On injectivity of quantum finite automata
Collaborative clustering of XML documents
Task-specific information retrieval systems for software engineers
A Duality Theory for Decomposable Systems in a Category
Energy efficient ant colony algorithms for data aggregation in wireless sensor networks
I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration
An elastic and resiliency defense against DDoS attacks on the critical DNS authoritative infrastructure
A survey on reliability in distributed systems
Succinct representation for (non)deterministic finite automata
Observations on the Complexity of Regular Expression Problems
Parallel Solutions to Geometric Problems in the Scan Model of Computation
A conceptual framework for trajectory-based medical analytics with IoT contexts
Cryptographic hardness for learning intersections of halfspaces
Statistical Zero-Knowledge Languages can be Recognized in Two Rounds
Decision implication canonical basis: a logical perspective
On parallel attribute-efficient learning
On Some Classes of Interpretations
Computable Queries for Relational Data Bases
Provably secure and efficient identification and key agreement protocol with user anonymity
Context-Free Grammar Forms with Strict Interpretations
Surpassing the Information Theoretic Bound with Fusion Trees
The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited
On problems without polynomial kernels