scholarly journals Introduction

2015 ◽  
Vol 24 (4) ◽  
pp. 584-584
Author(s):  
PAUL BALISTER
Keyword(s):  
Computer Science ◽  
Theoretical Computer Science ◽  
Special Issue ◽  
Open Problems ◽  
Theoretical Computer ◽  
Discrete Probability ◽  
The Common

This special issue is devoted to papers from the meeting on Combinatorics and Probability, held at the Mathematisches Forschungsinstitut in Oberwolfach from the 14th to 20th April 2013. The lectures at this meeting focused on the common themes of Combinatorics and Discrete Probability, with many of the problems studied originating in Theoretical Computer Science. The lectures, many of which were given by young participants, stimulated fruitful discussions. The fact that the participants work in different and yet related topics, and the open problems session held during the meeting, encouraged interesting discussions and collaborations.

scholarly journals Introduction

2018 ◽  
Vol 27 (4) ◽  
pp. 441-441
Author(s):  
PAUL BALISTER ◽  
BÉLA BOLLOBÁS ◽  
IMRE LEADER ◽  
ROB MORRIS ◽  
OLIVER RIORDAN
Keyword(s):  
Computer Science ◽  
Theoretical Computer Science ◽  
Special Issue ◽  
Open Problems ◽  
Theoretical Computer ◽  
Discrete Probability ◽  
The Common

This special issue is devoted to papers from the meeting on Combinatorics and Probability, held at the Mathematisches Forschungsinstitut in Oberwolfach from the 17th to the 23rd April 2016. The lectures at this meeting focused on the common themes of Combinatorics and Discrete Probability, with many of the problems studied originating in Theoretical Computer Science. The lectures, many of which were given by young participants, stimulated fruitful discussions. The fact that the participants work in different and yet related topics, and the open problems session held during the meeting, encouraged interesting discussions and collaborations.

scholarly journals Introduction

2010 ◽  
Vol 19 (5-6) ◽  
pp. 641-641
Author(s):  
Noga Alon ◽  
Béla Bollobás
Keyword(s):  
Computer Science ◽  
Theoretical Computer Science ◽  
Special Issue ◽  
Open Problems ◽  
Theoretical Computer ◽  
Discrete Probability ◽  
The Common

This special issue is devoted to papers from the meeting on Combinatorics and Probability, held at the Mathematisches Forschungsinstitut in Oberwolfach from 26 April to 2 May. This meeting focused on the common themes of Combinatorics, Discrete Probability and Theoretical Computer Science, and the lectures, many of which were given by young participants, stimulated fruitful discussions. The open problems session held during the meeting, and the fact that the participants work in different and related topics, encouraged interesting discussions and collaborations.

scholarly journals SPECIAL ISSUE ON MEMBRANE COMPUTING, Seventh Brainstorming Week on Membrane Computing

2009 ◽  
Vol 4 (3) ◽  
pp. 204
Author(s):  
Giancarlo Mauri ◽  
Gheorghe Păun ◽  
Agustín Riscos-Núñez
Keyword(s):  
Computer Science ◽  
Membrane Computing ◽  
Science Volume ◽  
Theoretical Computer Science ◽  
Natural Computing ◽  
Special Issue ◽  
Theoretical Computer ◽  
Generation Computing ◽  
New Generation ◽  
Selection Of

<p>The present volume contains a selection of papers resulting from the Seventh Brainstorming Week on Membrane Computing (BWMC7), held in Sevilla, from February 2 to February 6, 2009. The meeting was organized by the Research Group on Natural Computing (RGNC) from Department of Computer Science and Artificial Intelligence of Sevilla University. The previous editions of this series of meetings were organized in Tarragona (2003), and Sevilla (2004 – 2008). After the first BWMC, a special issue of Natural Computing – volume 2, number 3, 2003, and a special issue of New Generation Computing – volume 22, number 4, 2004, were published; papers from the second BWMC have appeared in a special issue of Journal of Universal Computer Science – volume 10, number 5, 2004, as well as in a special issue of Soft Computing – volume 9, number 5, 2005; a selection of papers written during the third BWMC has appeared in a special issue of International Journal of Foundations of Computer Science – volume 17, number 1, 2006); after the fourth BWMC a special issue of Theoretical Computer Science was edited – volume 372, numbers 2-3, 2007; after the fifth edition, a special issue of International Journal of Unconventional Computing was edited – volume 5, number 5, 2009; finally, a selection of papers elaborated during the sixth BWMC has appeared in a special issue of Fundamenta Informaticae</p>

scholarly journals Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique''

2007 ◽  
Vol Vol. 9 no. 2 ◽  
Author(s):  
Véronique Bruyère ◽  
Michel Rigo
Keyword(s):  
Computer Science ◽  
Coding Theory ◽  
Theoretical Computer Science ◽  
Discrete Mathematics ◽  
Combinatorics On Words ◽  
Special Issue ◽  
Theoretical Computer ◽  
Universitair Centrum ◽  
Numeration Systems ◽  
The University

Held at the Institute of Mathematics of the University of Liège, Liège, September 8―11, 2004 International audience This special issue of Discrete Mathematics & Theoretical Computer Science is dedicated to the tenth "Journées montoises d'informatique théorique" conference (Mons theoretical computer science days) which was held, for the first time, at the Institute of Mathematics of the University of Liège, Belgium, From 8th to 11th September 2004. Previous editions of this conference took place in Mons 1990, 1992, 1994, 1998, in Rouen 1991, in Bordeaux 1993, Marseille 1995, Marne-La-Vallée 2000 and Montpellier 2002.<p> This tenth edition can be considered as a widely international one. We were lucky to have almost 85 participants from fourteen different countries: Austria, Belgium, Burkina Faso, Canada, Czech republic, Finland, France, Germany, Israel, Italy, Japan, Norway, Poland and Portugal. The main proportion of researchers participating to this event was coming from France and Italy where a long tradition of combinatorics on words is well established. During four days, 42 contributed talks and 7 invited talks were given, the main topics being combinatorics on words, numeration systems, automata and formal languages theory, coding theory, verification, bio-informatics, number theory, grammars, text algorithms, symbolic dynamics and tilings. The invited speakers were: J. Cassaigne (CNRS, Luminy-Marseille), D. Caucal (IRISIA-CNRS, Rennes), C. Frougny (LIAFA, Université Paris 8), T. Helleseth (University of Bergen), S. Langerman (FNRS, Université Libre de Bruxelles), F. Neven (Limburgs Universitair Centrum, Diepenbeek), M.-F. Sagot (Inria Rhône-Alpes, Université Lyon I).<p> We would like to thanks all the participants, the invited speakers and the anonymous referees who made possible this event and special issue. Each paper has been refereed using high scientific standard by two independent referees. Readers of this special issue may wonder why it took so long to obtain it. We have encountered some problems with the formerly chosen journal and for the benefit of the contributors to this issue, we have chosen Discrete Mathematics & Theoretical Computer Science to publish their work.

Preface to Special Issue devoted to the memory of Sauro Tulipani

2008 ◽  
Vol 18 (1) ◽  
pp. 1-4 ◽  
Author(s):  
FLAVIO CORRADINI ◽  
CARLO TOFFALORI
Keyword(s):  
Mathematical Logic ◽  
Computer Science ◽  
Crucial Role ◽  
Recursion Theory ◽  
Theoretical Computer Science ◽  
Special Issue ◽  
Nineteen Thirties ◽  
Theoretical Computer ◽  
The Subject ◽  
The Church

2006 was a special year for both mathematical logic and computer science, as it celebrated Gödel's centenary. Although Gödel's work was mainly concerned with mathematics and metamathematics, the crucial role it had in the foundation of modern theoretical computer science is undeniable: for instance, one only has to remember Gödel's contributions to the birth of recursion theory as well as his part in the debate in the nineteen thirties on the subject of the Church Thesis.

scholarly journals Introduction: special issue ICICTA 2012

2014 ◽  
Vol 24 (5) ◽  
Author(s):  
ZHIXIANG HOU
Keyword(s):  
Computer Science ◽  
Software Design ◽  
Category Theory ◽  
Theoretical Computer Science ◽  
Special Issue ◽  
Theoretical Computer ◽  
Mathematical Structures ◽  
And Mathematics

Mathematical Structures in Computer Science bridges the gap between theoretical computer science and software design. By publishing original perspectives from all areas of computing, the journal stresses applications from logic, algebra, geometry, category theory and other areas of logic and mathematics. Through issues such as this special issue, the journal also plans to play an occasional, but important role in the fields of intelligent computation and automation.

scholarly journals Preface

2015 ◽  
Vol 27 (2) ◽  
pp. 92-93
Author(s):  
MARIANGIOLA DEZANI ◽  
SABRINA MANTACI ◽  
MARINELLA SCIORTINO
Keyword(s):  
Data Structure ◽  
Computer Science ◽  
Programming Languages ◽  
European Association ◽  
Wide Spectrum ◽  
Theoretical Computer Science ◽  
Combinatorics On Words ◽  
Special Issue ◽  
Theoretical Computer ◽  
Mathematical Structures

This special issue of Mathematical Structures in Computer Science is devoted to the fourteenth Italian Conference on Theoretical Computer Science (ICTCS) held at University of Palermo, Italy, from 9th to 11th September 2013. ICTCS is the conference of the Italian Chapter of the European Association for Theoretical Computer Science and covers a wide spectrum of topics in Theoretical Computer Science, ranging from computational complexity to logic, from algorithms and data structure to programming languages, from combinatorics on words to distributed computing. For this reason, the contributions here included come from very different areas of Theoretical Computer Science. In fact this special issue is motivated by the desire to give people who have presented their ideas at the 14th ICTCS the opportunity to publish papers on their work. Submitted papers have been subject to a careful and severe reviewing process and 11 of them were selected for this special issue.

scholarly journals $2\times 2$ monotone grid classes are finitely based

2016 ◽  
Vol Vol. 18 no. 2, Permutation... (Permutation Patterns) ◽  
Author(s):  
Michael Albert ◽  
Robert Brignall
Keyword(s):  
Computer Science ◽  
General Result ◽  
Theoretical Computer Science ◽  
Discrete Mathematics ◽  
Finite Collection ◽  
Permutation Patterns ◽  
Finitely Based ◽  
Special Issue ◽  
Theoretical Computer

In this note, we prove that all $2 \times 2$ monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain $2 \times 2$ (generalized) grid classes having two monotone cells in the same row. Comment: 10 pages, 5 figures. To appear in Discrete Mathematics and Theoretical Computer Science, special issue for Permutation Patterns 2015

Sign in / Sign up

Export Citation Format

Share Document