yusuke1997/dblp-id-title huggingface dataset:
The vertex-pancyclicity of data center networks
Compositions of Deterministic Bottom-Up, Top-Down, and Regular Look-Ahead Tree Transformations
Selection from read-only memory with limited workspace
Figaro: Yet Another Constraint Programming Library
Analysis of Program Optimization Possibilities and Further Development
The firing squad synchronization problem on Cayley graphs
Simplification of a complex signal transduction model using invariants and flow equivalent servers
Tiling the Morse Sequence
Operational Techniques in PVS - A Preliminary Evaluation
Sequential sampling techniques for algorithmic learning theory
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. Part II: The Algebra G[u]/<u^n>
On quasi-unilateral universal Turing machines
On Logic Programs That Do Not Fail
On the parameterized complexity of some optimization problems related to multiple-interval graphs
Topological properties of Hausdorff discretization, and comparison to other discretization schemes
Orienteering problem with time-windows and updating delay
A computation model with automatic functions and relations as primitive operations
Addendum to "Finding all maximally-matchable edges in a bipartite graph" [Theoret. Comput. Sci. 423 (2012) 50-58]
Ruleset optimization on isomorphic oritatami systems
The connected p-center problem on block graphs with forbidden vertices
Representation of Nondeterministic Information
Tree Structure for Distributive Lattices and its Applications
Octal games on graphs: The game 0.33 on subdivided stars and bistars
Recursive Assertions are not enough - or are they?
Automata and differentiable words
Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars
The Italian Conference on Theoretical Computer Science
An algorithm for reporting maximal c -cliques
On the abelian complexity of generalized Thue-Morse sequences
Comparing notions of randomness
HRNCE Grammars - a Hypergraph Generating System with an eNCE Way of Rewriting
A greedy approximation for minimum connected dominating sets
Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
Testing Shift-Equivalence of Polynomials by Deterministic, Probabilistic and Quantum Machines
Is DNA computing viable for 3-SAT problems?
On canonical number systems
Paid exchanges are worth the price
Exact matching of RNA secondary structure patterns
Graded Hypothesis Theories
Powerdomains and Zero Finding
Mirror substitutions and palindromic sequences
The free process algebra generated by δ, ϵ and τ
Modern Algebra - Foreword
Towards transitive-free digraphs
Self-similarity of communities of the ABCD model
Reaching agreement in the presence of contention-related crash failures
Determining and Stationary Sets for Some Classes of Partial Recursive Functions
Operational state complexity of unary NFAs with finite nondeterminism
Simple and cumulative regret for continuous noisy optimization
Scoped Dynamic Rewrite Rules
Uniformly Growing k-TH Power-Free Homomorphisms
Parallel Contextual Array Insertion Deletion Grammars, Pure 2D Context-Free Grammars and Associated P Systems
On generalized highly potential words
On the existence of funneled orientations for classes of rooted phylogenetic networks
Remarks on Blind and Partially Blind One-Way Multicounter Machines
Abstract Data Types with Exception Handling: An Initial Approach Based on a Distinction Between Exceptions and Errors
On the existence of prime decompositions
Singular value decomposition assisted multicarrier continuous-variable quantum key distribution
Kernel bounds for disjoint cycles and disjoint paths
Pseudorandom generators from regular one-way functions: New constructions with improved parameters
Tight bounds on sensitivity and block sensitivity of some classes of transitive functions
Diameter of colorings under Kempe changes
Finding optimal non-datapath caching strategies via network flow
Continuous Semilattices
Disjunctive optimization, max-separable problems and extremal algebras
The accepting power of unary string logic programs
Detecting Degenerate Behaviors in First Order Algebraic Differential Equations
Monadic Thue Systems
Formal specification and verification of the C# thread model
A substring-substring LCS data structure
One-Way Cellular Automata on Cayley Graphs
Gacs - Kucera theorem
On the Paging-Complexity of Periodic Arrangements
A conversion algorithm based on the technique of singularization
Concurrent nets: A study of prefixing in process calculi
Synthesis of sup-interpretations: A survey
Inventories of Unavoidable Languages and the Word-Extension Conjecture
Applying IsRewritten criterion on Buchberger algorithm
Alternation, sparsity and sensitivity: Bounds and exponential gaps
Exact and approximate equilibria for optimal group network formation
Considerations for parameter configuration on Vortex Particle Swarm Optimization
Combined super-/substring and super-/subsequence problems
Language operations with regular expressions of polynomial size
Multi-modal scenarios revisited: A net-based representation
Switched PIOA: Parallel composition via distributed scheduling
Extensions of rich words
A Theory for Program and Data Type Specification
Correctnes of Programs with Pascal-Like Procedures without Global Variables
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
Vertex coloring (4 K 1 , hole-twin, 5-wheel)-free graphs
Train tracks with gaps: Applying the probabilistic method to trains
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton
The untyped computational λ -calculus and its intersection type discipline
Computational self-assembly
A refinement on the structure of vertex-critical ( P 5 , gem)-free graphs
Additive models of probabilistic processes
Simulations in coalgebra
Investigating the existence and the regularity of Logarithmic Harary Graphs
A behavioural pseudometric for probabilistic transition systems
Structural Equivalence and ET0L Grammars
Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae
An Analysis of Fixed-Point Queries on Binary Trees
Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure
Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions
A General Method to Construct Oracles Realizing Given Relationships Between Complexity Classes
How to improve snap-stabilizing point-to-point communication space complexity?
Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
An analysis for proving probabilistic termination of biological systems
Approximate pattern matching and transitive closure logics
Prequential randomness and probability
Modular rewritable Petri nets: An efficient model for dynamic distributed systems
Fourier Analysis of Genetic Algorithms
Corrigendum to "A second look at counting triangles in graph streams" [Theoret. Comput. Sci. 552 (2014) 44-51]
Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations
Exact and approximation algorithms for error-detecting even codes
Robustness for biochemical networks: Step-by-step approach
Ergodic Characterization of Linear Cellular Automata over Z m
Word assembly through minimal forbidden words
Modular Tree Transducers
Uniform bipartition in the population protocol model with arbitrary graphs
Independent minimum length programs to translate between given strings
Online dynamic power management with hard real-time guarantees
Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
A hidden agenda
Effectively given Domains
Counter machines, Petri Nets, and consensual computation
A formal approach to open multiparty interactions
Analysis of a clock synchronization protocol for wireless sensor networks
Bounded Existentials and Minimal Typing
On Some Decision Problems for Trace Codings
On the Relations between Distributive Computability and the BSS Model
Question answering by humans and machines: A complexity-theoretic view
Rewriting P systems: improved hierarchies
Analysis of multiple quickselect variants
Reconstructing hv-convex multi-coloured polyominoes
Model checking differentially private properties
L 1 shortest path queries in simple polygons
Nonterminal Separation in Graph Grammars
The pruning-grafting lattice of binary trees
Preface: Theoretical Computer Science in Australia and New Zealand
Approximations for Subset Interconnection Designs
Computational complexity of determining which statements about causality hold in different space-time models
Many aspects of defect theorems
On shuffling and splitting automata
Pseudo-cyclic renewal systems
The hitting and cover times of Metropolis walks
Revisiting the parameterized complexity of Maximum-Duo Preservation String Mapping
Elimination of annotation dependencies in validation for Modern JSON Schema
Approximation algorithms for parallel machine scheduling with linear deterioration
The Picker-Chooser diameter game
Langages Infinitaires et Produit de Mixage
Towards compatible triangulations
Order of weak M -relation and Parikh matrices
Quasi-Linear Truth-Table Reductions to p-Selective Sets
Universal computation is 'almost surely' chaotic
A q -enumeration of convex polyominoes by the festoon approach
Weakening the perfect encryption assumption in Dolev-Yao adversaries
Modulated string searching
Private computation using a PEZ dispenser
Solving NP-hard problems on GaTEx graphs: Linear-time algorithms for perfect orderings, cliques, colorings, and independent sets
Automated constraint-based addition of nonmasking and stabilizing fault-tolerance
Towards an Algebra for Timed Behaviours
Binary-decision-diagram-based decomposition of Boolean functions into reversible logic elements
Closure and decidability properties of some language classes with respect to ciliate bio-operations
Revocable hierarchical identity-based encryption with adaptive security
An atlas of limit set dynamics for asynchronous elementary cellular automata
Just-in-time: On Strategy Annotations
Location functions for self-stabilizing byzantine tolerant swarms
Selected articles from the 25th International Colloquium on Structural Information and Communication Complexity
Predicate Transformers and Higher-Order Programs
Opérations polynomiales et hiérarchies de concaténation
From Antonio's former students
The metabolic algorithm for P systems: Principles and applications
Représentation symbolique d'espèces moléculaires
Infinite permutations of lowest maximal pattern complexity
Notes on Congruence Relations and Factor Pumping Conditions for Rational Languages
Local distance constrained bribery in voting
A new algorithm for sparse interpolation of multivariate polynomials
Utilizing sources of evidence in relevance feedback through geometry
A Direct Characterization of Completion
Schedules for marketing products with negative externalities
Quantum algorithm for finding the optimal variable ordering for binary decision diagrams
The security number of strong grid-like graphs
Approximating the selected-internal Steiner tree
Recursive stochastic games with positive rewards
Satisfiability threshold for power law random 2-SAT in configuration model
Induced packing of odd cycles in planar graphs
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
Infinite Hypergraphs I. Basic Properties
Learning multiple languages in groups
Short tightly secure signatures for signing a vector of group elements: A new approach
Faster and simpler approximation algorithms for mixed packing and covering problems
Multiagent learning for competitive opinion optimization
Some Complexity Results on Transition Systems and Elementary Net Systems
LinUCB applied to Monte Carlo tree search
Average Case Analysis of Greedy Algorithms for Optimisation Problems on Set Systems
Scheduling multiple two-stage flowshops with a deadline
Minimax - or feared value - L 1 /L ∞ control
Additive Complexity in Directed Computations
Approximation by lexicographically maximal solutions in matching and matroid intersection problems
A Coalgebraic presentation of structured transition systems
On strong normalization and type inference in the intersection type discipline
Specular sets
Bounded semantics
Approximation algorithms for cycle and path partitions in complete graphs
The Complexity of Grigorchuk Groups with Application to Cryptography
Parsing as abstract interpretation of grammar semantics
Approximating source location and star survivable network problems
The decidability of the intensional fragment of classical linear logic
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
Recent results on approximating the Steiner tree problem and its generalizations
The Theory of Ends, Pushdown Automata, and Second-Order Logic
Shape preserving top-down tree transducers
An almost-confluent congruential language which is not Church-Rosser congruential
Integrating information visualization and retrieval for WWW information discovery
The distributed algorithms for the lower-bounded k-center clustering in metric space
Dépendance de systèmes de numération associés à des puissances d'un nombre de Pisot
Implicit surface visualization of reconstructed biological molecules
On the complexity of dominating set problems related to the minimum all-ones problem
Randomized OBDD-based graph algorithms
On solving the double loading problem using a modified particle swarm optimization
A disambiguation algorithm for weighted automata
Parameterized complexity of vertex splitting to pathwidth at most 1
Compact visibility representation of 4-connected plane graphs
A bijection of plane increasing trees with relaxed binary trees of right height at most one
On the elimination of quantifier-free cuts
On the maximality of languages with combined types of code properties
Rank-maximal matchings - structure and algorithms
The Inf Function in the System F
Maximum flow under proportional delay constraint
Parallel randomized load balancing: A lower bound for a more general model
Complexity in Mechanized Hypothesis Formation
On queuing lengths in on-line switching
Discrete mathematical structures: From dynamics to complexity
On Gödel Speed-Up and Succinctness of Language Representations
Computing equality-free and repetitive string factorisations
Compact zero-knowledge arguments for Blum integers
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems
Structural and Behavioral Equivalence Relations in Automata Networks
Some Results about Centralized PC Grammar Systems
A fixed point theorem in rough semi-linear uniform spaces
Approximation schemes for subset-sums ratio problems
Visibility extension via reflection
Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time
Approximating the restricted 1-center in graphs
A PTAS for the minimization of polynomials of fixed degree over the simplex
Infinite unfair shuffles and associativity
Linear-time online algorithm for inferring the shortest path graph from a walk label
Implementation and Application of Automata (CIAA 2013)
Dcpo-completion of posets
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems
On priority-proportional payments in financial networks
Coordination mechanisms for selfish scheduling
Hierarchical cost-parity games
Optimal serial broadcast of successive chunks
Induction and Recursion on the Partial Real Line with Applications to Real PCF
A logarithmic-sized accountable ring signature scheme in the standard model
On permuted super-secondary structures of transmembrane β-barrel proteins
Theoretical design of decentralized auction framework under mobile crowdsourcing environment
Algorithms for optimal replica placement under correlated failure in hierarchical failure domains
Concurrent games with tail objectives
Coding rotations on intervals
Une Application de la Representation Matricielle des Transductions
Tight competitive analyses of online car-sharing problems
Maximum matching in multi-interface networks
Schützenberger's theorem on formal power series follows from Kleene's theorem
On the Number of Partially Abelian Square-Free Words on a Three-Letter Alphabet
A generalization of the Curtis-Hedlund theorem
Evolving novelty strategies for the Iterated Prisoner's Dilemma in deceptive tournaments
The (conditional) matroidal connectivity of varietal hypercube
Applications of the representation of finite fields by matrices
Watson-Crick D0L systems with regular triggers
Communications in unknown networks: Preserving the secret of topology
Efficient algorithm for stochastic rumor blocking problem in social networks during safety accident period
Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings
Domination Games on Infinite Graphs
On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups
A description based on languages of the final non-deterministic automaton
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
Periodic scheduling with obligatory vacations
On the hierarchy of generalizations of one-unambiguous regular languages
The 2nd-order conditional 3-coloring of claw-free graphs
Graph classes with structured neighborhoods and algorithmic applications
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
Verification of Boolean programs with unbounded thread creation
More on the Complexity of Common Superstring and Supersequence Problems
Phase transitions and symmetry breaking in genetic algorithms with crossover
An interface theory for service-oriented design
On the minimum eccentricity shortest path problem
Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
The distributed wireless gathering problem
Approximation of grammar-based compression via recompression
On the Shyr-Yu theorem
Interval routing in some planar networks
General design of reversible sequential machines based on reversible logic elements
Nominal unification
Enhancing fault tolerance of balanced hypercube networks by the edge partition method
P systems with proteins on membranes characterize PSPACE
Modular modelling of signalling pathways and their cross-talk
Two Recognizable String-Matching Problems Over Free Partially Commutative Monoids
An Introduction to Commutative and Noncommutative Gröbner Bases
Turing machines with two-level memory: New computational models for analyzing the input/output complexity
On the P-NP problem over real matrix rings
Languages and formations generated by D 4 and Q 8
A Wiener-type attack on an RSA-like cryptosystem constructed from cubic Pell equations
An efficient oracle for counting shortest paths in planar graphs
A structural approach to reversible computation
Hybrid and generalized marked systems
Quasi-polynomials, linear Diophantine equations and semi-linear sets
Differentially-private learning of low dimensional manifolds
On the uniqueness of shuffle on words and finite languages
The stack-size of tries: a combinatorial study
A semantic measure of the execution time in linear logic
G-Networks with Multiple Classes of Negative and Positive Customers
Graph Grammars with Path-Controlled Embedding
Vertex Nim played on graphs
Parameterized complexity of happy coloring problems
MGS: a Rule-Based Programming Language for Complex Objects and Collections
On the complexity of computing the profinite closure of a rational language
Implementing First-Order Rewriting with Constructor Systems
An improved approximation algorithm for capacitated multicast routings in networks
The regular-language semantics of second-order idealized A LGOL
An Algorithm for the Decomposition of Semisimple Lie Algebras
Byzantine fault-tolerant protocols for (n,f)-evacuation from a circle
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
On the clique partitioning problem in weighted interval graphs
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three
Lambda-dropping: transforming recursive equations into programs with block structure
A generalization of the Fibonacci word fractal and the Fibonacci snowflake
Quantum Query as a state decomposition
Hoare's Logic for Programming Languages with two Data Types
Approximation of function evaluation over sequence arguments via specialized data structures
Functions Over Free Algebras Definable in the Simply Typed lambda Calculus
Expressive Power of Typed and Type-Free Programming Languages
Data Refinement of Predicate Transformers
On the complexity of inducing categorical and quantitative association rules
Graph convexity impartial games: Complexity and winning strategies
Parallel-machine scheduling with deteriorating jobs and rejection
Genetic subsystem-based reliability analysis of godan graphs
Monodic fragments of probabilistic first-order temporal logic with bounded semantics
Upper powerdomains of quasicontinuous dcpos
A Theory of Processes with Durational Actions
Effective Category and Measure in Abstract Complexity Theory
Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System
Generating Java code pairing with ChatGPT
Random lattices, threshold phenomena and efficient reduction algorithms
Exact Average Message Complexity Values for Distributed Election on Bidirectional Rings of Processors
Online computation with advice
Asynchronous deterministic rendezvous in graphs
Analyzing the quality of local and global multidimensional projections using performance evaluation planning
A process algebraic approach to reaction systems
A Multiparameter Analysis of Domino Tiling with an Application to Concurrent Systems
Preface: Hybrid automata and oscillatory behaviour in biological systems
Tracing where and who provenance in Linked Data: A calculus
Note on the game chromatic index of trees
A characterization of alternating log time by ramified recurrence
On the bipanpositionable bipanconnectedness of hypercubes
On the variance of the internal path length of generalized digital trees - The Mellin convolution approach
A comparative study of the effects of cultural differences on the adoption of mobile learning
Investigating the impact of teacher education strategies on preservice teachers' TPACK
Artificial intelligence in educational software: has its time come?
Computer-supported knowledge building to enhance reading motivation and comprehension
Making sense of models: How teachers use agent-based modeling to advance mechanistic reasoning
Using computer-based cognitive mapping to improve students' divergent thinking for creativity development
E-learning groups and communities - David McConnell
Students' experiences with and preferences for using information technology in music learning in Shanghai's secondary schools
The effects of active versus reflective learning style on the processes of critical discourse in computer-supported collaborative argumentation
Pre-service teachers' intention to adopt mobile learning: A motivational model
The interviewer
The coaching handbook
The impact of membership of a virtual learning community on individual learning careers and professional identity
Robot programming versus block play in early childhood education: Effects on computational thinking, sequencing ability, and self-regulation
Communication in a web-based conferencing system: the quality of computer-mediated interactions
Simulations for assessment, training and development
Editorial: Rhetoric and reality - the present and future of ICT in education
Computing education in children's early years: A call for debate