yusuke1997/dblp-id-title huggingface dataset:
Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem
Distributed Catenation Versus Shuffle
A Note on Extended H Systems with Permitting/Forbidding Contexts of Radius One
The Blockchain Consensus Layer and BFT
Conference Spotlight: ITCS and SODA
Shuffling and Unshuffling
Report on NCMA 2022: 12th International Workshop on Non-Classical Models of Automata and Applications
Strategic Directions in Computing Research-Concurrency Working Group Report
Some Recent Results on Contextual Languages
Counting digraphs and hypergraphs
Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk")
Recognizable subsets of a group: finite extensions and the abelian case
The EATCS Award 2021 - Call for Nominations
Report from DCFS 2012
The Language of Primitive Words in not Regular: Two Simple Proofs
Who needs category theory?
Some Nuances of Many-sorted Universal Algebra: A Review
Crossing the Bridge at Night
The Impact and Future Role of Algebraic Specification
Report on NII Shonan Meeting 2013-018
Development of a Bacteria Computer: From in silico Finite Automata to in virto AND in vivo
Unampiguous automata
The Golden Ticket P, NP, and the Search for the Impossible
Know the Person behind the Papers: Christos Papadimitriou
If you have parents, you can learn recursion
2023 Goedel Prize
Approximation bounds for centrality maximization problems
On the Algebraic Structure of Petri Nets
For Helmut Veith (1971-2016) "I have this idea"
Computation Geometry Research in Japan
On Extended Attribute Grammars
Divergence of the Knuth-Bendix Completion Procedure and Termination Orderings
Convergence Issues in Congestion Games
The Sequential ASM Thesis
On the Role of Formal Specification Techniques: From TAPSOFT 1985 to ETAPS 2000
Annotated Bibliography on Counting Networks
Why is Selecting the Simplest Hypothesis (Consistent with Data) a Good Idea? A Simple Explanation
The H-index can be Easily Manipulated
On the solution of Ehrenfeucht's conjecture
In Memoriam Sheng Yu (1950-2012)
Report on DCFS 2018
Kolmogorov Complexity Justifies Software Engineering Heuristics
A undecidability result for regular anguages and its applications to regulated rewriting
THe non-existence of finite test sets for set-equivalence of finite substitions
Closure properties of EOL-regular matrix languages
Introducing: Reasonable Complete Programming Languages
EATCS Golden Jubilee: How EATCS was born 50 years ago and why it is still alive and well
The Presburger Award 2021 - Laudatio for Shayan Oveis Gharan
MFCS 2019 - First Call for Papers
Lower Bounds on Quantum Query Complexity
Using Quantum Computing to Learn Physics
Is #P Closed under Substraction?
Valence grammars on a free generated group
Progress in Descriptive Complexity
Aspects of Systems of Logic Programming
An Implicit Representation of Infinite Sequences of Terms
Tree-Decompositions and the Model-Checking Problem
A generalized Ogden's lema for linear conteext-free languages
Real-time recognition of some languages by trellis and cellular automata and full scan Turing machines
Why are Modal Logics so Robustly Decidable?
Web Services, Mobile Processes and Types
A New Zero-One Law and Strong Extension Axioms
Failure-Divergence Semantics as a Formal Basis for an Object-Oriented Integrated Formal Method
Report on the Workshop on Languages, Algorithms and Complexity, Minneapolis, USA, 12 April 1997
Biomolecular Automata
Obituary for Gerhard Woeginger
A Formalism for Representing Orderings
Message from Academia Europaea
A Game on a Distributed Network
A note about minimal non-deterministic automata
Lower Bounds and Impossibility Results for Transactional Memory Computing
On Constructing Obstruction Sets of Words
Learn to Program? Program to Learn!
Circuits: An abstract viewpoint
Applying Concurrency Research in Industry Report on a Strategic Workshop
Neural Computation: A Research Topic for Theoretical Computer Science? Some Thoughts and Pointers
OPODIS 2006 Report
Sampling from Discrete Distributions and Computing Frechet Distances
One-round Walks in Linear Congestion Games
Another Characterization of Sturmian Words
Enumeration of Formal Languages
Report on NWPT 2015
A New Column: Information Security
A Simple Completeness Proof for the Axiomatisations of Weak Behavioural Equivalences
2023 Alonzo Church Award for Outstanding Contributions to Logic and Computation
Formal Language Theory Column - Two-way Thue
Revie of Dines Bjørner's Textbooks Software Engineering 1-3
On Langford-Lyndon-Thue sequences
The generalized prefix property
Report on ICALP 2022 - 49th EATCS International Colloquium on Automata, Languages and Programming
Teaching Formal Foundations of Computer Science with Iltis
Recent Progress on Arithmetic Circuit Lower Bounds
Ackermann Award 2021
Infinite (Almost Periodic) Words, Formal Languages and Dynamical Systems
Russian Chapter of European Association for Theoretical Computer Science
Report on MCU 2022: 9th International Conference on Machines, Computations, and Universality
The Structural Complexity Column, guest authors
A quarter of a century of CONCUR - Report on the 2014 and 2015 editions of the Conference on Concurrency Theory
FLEX: A Flexible Extension and Integration Concept for Software Development in SORSo and COMPASS
Augur - A Tool for the Analysis of Graph Transformation Systems
Some Problems around Traveling Salesmen, Dart Boards, and Euro-coins
How to Base Probability Theory on Perfect-Information Games
Introducing The Theory Blogs Column
Anatomy and Empirical Evaluation of Modern SAT Solvers
A Few Lessons I've Learned
EATCS Fellows 2017 - Call for Nominations
When is A=B?
A Machine Model for NP-Approximation Problems and the Revenge of the Boolean Hierarchy
Networks of Language Processors: Parallel Communicating Systems
A Counter Example to a Conjecture Concerning Synchronizing Words in Finite Automata
The EATCS Award 2013
More on minimal finite automata
Some Algorithmic Questions About Nash Equilibria
ESF-concepts linked with algebraic module specifications
Net Transformations for Petri Net Technology
Constant Time Generation of Binary Unordered Trees
Towards Global Computations Guided by Concurrency Theory
Bead-Sort: A Natural Sorting Algorithm
A Grand Challenge for Computing: Towards Full Reactive Modeling of A Multi-Cellular Animal
The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
Lowness results: the next generation
Why some physicists are excited about the undecidability of the spectral gap problem and why should we
A remark on variations of power domains
Attacking the Busy Beaver 5
Building Reliable Systems from Unreliable Components and the DNA Computing Paradigm
Causal-Consistent Reversibility
A Representation Theorem for Languages Accepted by Watson-Crick Finite Automata
On the Rectilinear Steiner Problem
Understanding the Mulmuley-Sohoni Approach to P vs. NP
A Review of Algebraic Specification and Component Techniques at TU Berlin
Communication Lower Bounds Using Dual Polynomials
The Presburger Award 2022 - Laudatio for Dor Minzer
Query-Competitive Algorithms for Computing with Uncertainty
Are you Interested in Theoretical Computer Science? (How Not???) I Have Some Advice for You
From Basic Views and Aspects to Integration of Specification Formalisms
In the prehistory of formal language theory: Gauss Languages
Report on POPL' 2025
On a measure of intelligence
Algorithmic Thinking from the Start
A non-deterministic algorithm and its analysis
The DFG Priority Programme "Integration of Software Specification Techniques for Applications in Engineering"
A Simple Example of an omega-Language Topologically
Bounded Petri nets of finite dimension have only finitely many reachable markings
A look at concurrency semantics through "lattice glasses"
Closure Properties of Ordered Languages
On Pariki-boundedness of matrix languages
Algorithms for Overlay Networks
A note on the "Comuunication Complexity" paper by Papadimitriou and Sipser
Formal Languages via Theories over Strings: An Overview of Some Recent Results
A view of structural complexity theory
Formal Modeling and Analysis of Mobile Ad Hoc Networks and Communication Based Systems using Graph and Net Technologies
On the Weight of Computations
Choosing a Physical Model: Why Symmetries?
On Chains of Word Equations and Test Sets
In Memoriam Manfred Kudlek (1940-2012)
Solvable problems with conflicting relativizations
The Bridge Crossing Problem
Algorithms vs. Machines
On graph rewritings
A searching algorithm for finite embedded D-graphs with no more than k regions
Challenges in Business Process Management: Verification of Business Processing Using Petri Nets
Report on BCTCS 2012
Branching Programs - An Efficient Data Structure for Computer-Aided Circuit Design
Mastering the Master Theorem
A candidate for nonlinear lower bound on the combinatorial complexity
Composable Error Recovery With Transactional Memory
Process Congruences from Reaction Rules (Column: Concurrency)
Recent Results in Population Protocols for Exact Majority and Leader Election
A Short Note on Analysing P Systems with Antiport Rules
Computer Science at the Gran Sasso Science Institute
Wavelength Routing in All-Optical Tree Networks: A Survey
The Freudenthal Problem and its Ramifications (Part III)
An Introduction to Query Order
Minimally Unsatisfiable CNF Formulas
Sessions, from Types to Programming Languages
Report on SEA 2018
Generating functions of trace languages
Hartmut Ehrig (1944-2016)
Overview of Algebraic Specification Languages Environments and Tools, and Algebraic Specifications of Software Systems
An Application of the Monotone Linearizability Lemma
A simple proof that connectivity of finite graphs is not first-order definable
IWOCA 2015 in Verona, Italy
Model Transformations should be Functors
Reconfiguring Replicated Atomic Storage: A Tutorial
Joseph Goguen (1941-2006)
Report on BCTCS 2022
Simple language Equations
IWOCA 2020 in Bordeaux (Oops! On-Line!)
Report on ICALP 2013
EATCS Distinguished Dissertation Award 2018 - Call for Nominations
Algorithms for Biological Graphs: Analysis and Enumeration
Report on ICE-TCS Theory Day 2018
On Average Bit Complexity of Interval Arithmetic
Model Transformations by Graph Transformation are Functors
Interview with Stephen Brookes and Peter W. O'Hearn Recipients of the 2016 Godel Prize
Programmer-Centric Memory Consistency Modeling
Lower Bounds for Transactional Memory
State Complexity of Finite and Infinite Regular Languages
Courses on Concurrency
Types, Induction, and Incompleteness
Proof Interpretations and the Computational Content of Proofs in Mathematics
Report on NCMA 2018
Binary Words with Few Squares
OR-Parallellism in Theorem Proving: Speedups versus Timeout
The EATCS Award 2018 - Call for Nominations
Obituary, Nadia Busi (1968-2007)
On Maximal Prefix Codes
Negative Probability
The EATCS Award 2023 - Laudatio for Amos Fiat
Concurrent versus sequential - the rough sets perspective
Optimization Techniques for Algorithmic Debugging
Distributed Computation Meets Design Theory: Local Scheduling for Disconnected Cooperation
Informatics - New Basic Subject
Background of Computation
Algebreic high-level net transformation systems: a survey over theory and applications
Maximal derivation lengths of acyclic CFGs
Primitive Words and Languages Associated to PCP
Report on Highlights 2013
Report on CIAA 2018
Obituary for Tom Head
Time-Bounded Kolmogorov Complexity May Help in Search for Extra Terrestrial Intelligence (SETI)
Helmut Veith (1971-2016) by Richard Zach
Secret Selling of Secrets with Several Buyers
A Threshold Property Concerning Words Containing All Short Factors
A Program to Compute Gödel-Löb Fixpoints
Report on ICALP 2018
Navigation in XML Trees
A Broader Research Agenda for Theory
Logarithmic signal propagation delay and the efficiency of VLSI circuits
Application of Kolmogorov Complexity to Image Compression: It Is Possible to Have a Better Compression, But It Is Not Possible to Have the Best One
The EATCS Award 2017 - Laudatio for Eva Tardos
Flattening of Generalized Algebraic High-Level Nets
The Tautologies over a Finite Set are Context-Free
The Logic in Computer Science Column Functions versus Algorithms
A Topological View of the Kowalski - Van Emden Theorem
The Power of Constructing Bad Inputs
A new representation for the regular languages
Robust Oracle Machines revisited
Simple Words in Equality Sets
Algorithm engineering, Algorithmics Column
The Presburger Award for Young Scientists 2023 - Call for Nominations
EATCS Fellows 2023 - Call for Nominations
EATCS-IPEC Nerode Prize - Call for Nominations
Behaviour Simulation and Equivalence of Systems Modelled by Graph Transformation
Report on ACCAT Workshop at ETAPS 2006: Applied and Computational Category Theory
Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders
Mapping the complexity of counting problems
Report on The Graph Isomorphism Problem
EATCS-Fellows 2023
Maurice Herlihy's 60th Birthday Celebration
Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results
The EATCS Award 2012
Edsger W. Dijkstra Prize in Distributed Computing 2019 - Call for Nominations
An Alternative Formulation of Cocke-Younger-Kasami's Algorithm
Subword complexities and iteration
Computing with Membranes: A Correction, Two Problems, and Some Bibliographical Remarks
Monoids as Storage Mechanisms
Some Classes of Graphs with Bounded Treewidth
On Minimising P Finite State Automata
Cospan DPO Approach: An Alternative for DPO Graph Transformations
Current Challenges in Reliable and Secure Clock Synchronization
If You're Not Writing a Program, Don't Use a Programming Language
Logic in Computer Science Column
The evidence theory and decision tables
Open problems in the theory of scheduling
What is Branching time semantics and why to use it?
Security Analysis using Flow Logics
The nearest common ancestor in a dynamic tree
Categorical Frameworks for Graph Transformation and HLR Systems Based on the DPO Approach
Report on UCNC 2014
Classes of Algorithms: Formalization and Comparison
Fine and Wilf's Theorem for Abelian Periods
Do the Zeros of Riemann's Zeta-Function Form a Random Sequence?
Multivariate Algorithmics for NP-Hard String Problems
Obituary for Rolf Niedermeier
Which tasks of a job are susceptible to computerization?
Report on BCTCS 2024
Left-linear Right-ground Term Rewrite Systems and Ground Term Rewrite Systems
A General Definition of the O-notation for Algorithm Analysis
Silver Jubilee of EATCS
A Note on (EOL-EOL) array systems
Sublinear-Time Algorithms
On Regularity-Preserving Functions
Special Variants of P Systems Inducing an Infinite Hierarchy with Respect to the Number of Membranes
Biomolecular computing in silico, Natural Computing Column
Lower bounds based on the Exponential Time Hypothesis
Alonzo Church Award 2018 - Call for Nominations
Know the Person behind the Papers: Eva Rotenberg
Detecting and Correcting Operation Errors of Distributed Systems
Anatomy of conflics
Overview of algebraic specification languages, enviroments and tools, and algebraic specifications of software systems(Part 3)
Nondeterminism fairness and a fundamental analogy
Remarks on remarks on many-sorted algebras with possibly emtpay carrier sets
Henkin Quantifiers: Logic, Games, and Computation
Computation Counts - An Introduction to Analytic Concepts in Computer Science
Process Calculi in a Biological Context
On minimal finite automata - corrigenda
Attributed Graphs and Typing: Reationshi between Different Representations (Column: Formal Specification)
Style-Based Architectural Reconfigurations
The Fractal Dimension of a Computable Figure is the Average Normalized Complexity of its Points
Report on CPM 2014
A note on the paper "Systolic tree acceptors" by K. Culik II, A. Salomaa and D. Wood
EPR Paradox and Bell Inequalitites
Computational Aspects of Packing Problems
Report on DCFS 2019
Report on WS25CCC
The Renaming Problem: Recent Developments and Open Questions
Linear searching for a square in a word
Conferences WORDS, years 1997-2017: Open Problems and Conjectures
Relativization: a revisionistic retrospective
Calculi for Mobile Processes - Bibliography and Web Pages
Assertional and Behavioral Approaches to Concurrency
IPEC Nerode Prize 2023 - Call for Nominations
String-matching and periods
Decision Logik
On the various high-level Petri Nets and their invariatnts
Ultra-loose algebraic specifications
Concurrency without Homotopy
Promoting Theoretical Computer Science on Social Media, A Conversation with Clément Canonne
On the equivalence problem for DTOL systems
Obituary: Robin Milner (1934-2010)
SIROCCO Prize for Innovation in Distributed Computing - Laudatio for Boaz Patt-Shamir
Propositional Proof Complexity: Past, Present and Future
AutoMathA: From Mathematics to Applications
Dynamic Spatial Logics: A Tutorial Survey
Computational Tractability: The View From Mars
On the finite completion of codes
Computational Complementarity for Mealy Automata
A short Oxford survey of order sorted algebra.
Know the Person behind the Papers: Grzegorz Rozenberg
Understanding Non-Uniform Failure Models
Interview with Alexandra Silva Recipient of the 2017 Presburger Award
Characterizing Confusion
The Complexity of Planar Graph Isomorphism
An Algebraic View on Petri Nets
A Note on Minimal Cover-Automata for Finite Languages
Accepting Cooperating Distributed Grammar Systems with Terminal Derivation
EATCS Distinguished Dissertation Award for 2020
Temporal logic with past is exponentially more succinct, Concurrency Column
Notes on a star mystery
Some Relationships between the FOIES and S1 Arity Hierarchies
Alternative composition does not imply non-determinism
On a generalization of a conjecture of Ehrenfeucht
The Ehrenfeucht conjecture: a proof for language theorists
Notations for Rewting
A new approach to the jeep problem
EATCS Fellows 2015 - Call for Nominations
Report on ICALP 2015
A case against using Stirling's formula (unless you really need it)
Salomaa Prize in Automata Theory, Formal Languages and related topics
The EATCS Award 2019 - Call for Nominations
More Words on Trajectories
Meta-Modelling and Graph Transformation for the Simulation of Systems
Bebras: Inspiring Informatics Education Across the Globe
A negative result for Büchi's automata
Rūsiņš Mārtiņš Freivalds (1942-2016)
Complativle graph properties are decidable for hypergraph replacement graph languages
ETAPS Award Laudatio for Kohei Honda
An effect solution to the DOL periodicity problem in the binary case
Zero-One Laws: Thesauri and Parametric Conditions
Selected open problems in Matching Under Preferences
On Iterated Scattered Deletion
Decision procedures for elementary sublanguages of set theory, XVI, Multilevel syllogistic extended by singleton, rank comparison and unary intersection
About Gauss codes
The Big Ideas in Computer Science for K-12 Curricula
An Appealing Computational Mechanism Drawn from Bacterial Quorum Sensing
Regular control on NLC grammars
On Some Recent Projection Switching Lemmas for Small Depth Circuits
How tough is toughness?
Concurrent Structures in Game Semantics
EATCS Distinguished Dissertation Award 2014 - Call for Nominations
On DAG Languages and DAG Transducers
On the Complexity of Resolution-based Proof Systems
Structural Complexity Columns in Sparse complete sets for NP and the optimal collpase of the polynomial hierarchy
More Infinite Results
Relabeling and the Independence Theorem in the Double-Pushout Approach to Graph Transformations
The Salomaa Prize 2019 was given to Dr. Artur Jez
Reducing the Number of Rules in Intelligent Control: A New Application Area for Algebraic Complexity Techniques
How not to sweep infoxes u nder the carpet
The Pi-Calculus: Notes on Labelled Semantic
Obituary: Yuri Manin
Interdisciplinary Education in Mathematics and Informatics at Swiss High Schools
Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand
Circuit pedantry
Report on CALCO 2013
The Presburguer Award 2012
Report on UCNC 2015
An Exercise in Weakest Preconditions
Algorithmics of Matching Under Preferences
A physics-free introduction to the quantum computation model, Computational Complexity Column
Complexity of Model Checking for Logics over Kripke models
Obituary Robert McNaughton 1924 - 2014
Linking Schemas and Module Specifications: A Proposal
On the Future of Decentralized Computing
Algorithmic Aspects of Cartogram Computation
Bridges between Algebraic Automata Theory and Complexity Theory
Recreational Formal Methods: Designing Vacuum Cleaning Trajectories
Recognition of EOL by polynomial Boolean circuits
Visual Modelling and Analysis of Model Transformations based on Graph Transformation
A completeness result for SLDNF resoultion
The D0L Problem Revisited
The Flow of Time into Logic - and Computer Science (Column: Logic in Computer Science)
Robust Simulation of Shared Memory: 20 Years After
An alternative definition of NP
Report on NCMA 2019
Descriptional complexity measures suggested by Hartmann's error recovery scheme
Bringing Research-Life to Centerstage
Multilinear Polynomials Modulo Composites
Know the Person behind the Papers: Paul Spirakis
EATCS Distinguished Dissertation Award 2017 - Call for Nominations
Remarks on defining the complement of a language
Computing with Membranes: One More Collapsing Hierarchy
Improving tablog
Dynamic Graphs, End-to-End: Containers, Frameworks, and Benchmarks
EATCS Distinguished Dissertation Award for 2022
Shared Memory Synchronization
Bisimulation as cointersection
Yet Antother Cautionary Note on Conservative Extensions: a Simple Case with a Computing Flavour
The Splendour of an Old Ballad: Aad van Wijngaarden Grammars
Complexity in Ideals of Polynomials: Questions on Algebraic Complexity of Circuits and Proofs
A simple method for solving 2-dimensional static range searching
Reality and Virtual Reality in Mathematics
Distributed Communication Algorithms
A tutorial for computer scientists on finite extensive games with perfect information
The Relationship between APSP and Matrix Multiplication in Congested Clique
Language Generating by Means of Membrane Systems
Ten Conferences WORDS and their Contribution to the Field of Combinatorics on WORDS
Addenda to the Survey of Layout Problems
Representation of Regular Languages by Equality Sets
Alonzo Church Award 2016 - Call for Nominations
Interview with Murdoch J. Gabbay and Andrew M. Pitts, 2019 Alonzo Church Award Recipients
About the Nature of the Computer Science
The Dimensions of Petri Nets: The Petri Net Cube
Large-scale Graph Generation and Big Data: An Overview on Recent Results
On the equivalence of grammars inferred from derivation
In Memoriam Lars Arge ∗ 8.10.1967 - † 23.12.2020
A compelte axiomatization for full join dependencies in relations
Higher-Order Concurrency: Expressiveness and Decidability
Wilfried Brauer (1937-2014) in memoriam
From Invariants to Canonization
The formal Language Theory Column
Primes in P (Without Assumptions)
The EATCS Award 2016 - Call for Nominations
Obituary for Luca Trevisan
On Language Equations with Deletion
On the average performanve of some algorithms for one-line-packing
2021 Alonzo Church Award for Outstanding Contributions to Logic and Computation
Informatics in Swiss Primary Schools: A Case for Interdisciplinarity
Secure Computation Under Network and Physical Attacks
How to Find a Coin: Propositional Program Logics Made Easy
A Note on a Parameterized Version of the Well-Founded Induction Pricible
Sudo-Lyndon
The EATCS Award 2013. Call for nominations
Should conferences still require mandatory attendance? A column by Theoretical Computer Scientists for Future (TCS4F)
Fast Algorithms for Structured Sparsity
Thoughts on Alan Selman (1941-2021)
Combinatorial Pawn Power
The EATCS Award 2021 - Laudatio for Toniann (Toni) Pitassi
VALENCES: Increasing the power of grammars, tranducers grammar systems
Reusing Space: Techniques and Open Problems
Hilbert's Tenth Problem for Fixed d and n
On the construction of unifying terms modulo a set of substitutions
Algebraic Techniques in Software Development
Prime implicants and parallel complexity
A Liniear lower bound for the size of threshold circuits
Recursion Theorems and Self-Replication Via Text Register Machine Programs
The EATCS Award 2020 - Laudatio for Mihalis Yannakakis
Report on the General Assembly 2013