DMTCS'01 Programme Programme for

Discrete Mathematics and Theoretical Computer Science 2001

``Ovidius" University of Constanta, Romania

2-6 July 2001, ``Ovidius" University of Constanta New Campus

Aleea Universitatii No 1, Constanta

Monday 2 July

09:00-10:00  Welcome and registration

Conference Opening:

Chair: Silviu Sburlan

10:00-10:30   Opening Session

10:30-11.00  Sergiu Rudeanu. Frank Harary at 80

11:00-11:30  Tea & Coffee Break

Morning Session:

Chair: Ioan Tomescu

11:30-12:30  Frank Harary. Early Computer Science Adventures of a Mathematician (Keynote Lecture)

12:30-15:00  Lunch Break

Early Afternoon Session:

Chair: Veronica Becher

15:00-15:30  Douglas S. Bridges. Dini's Theorem: a Constructive Case Study

15:30-16:00   Peter Schuster, Luminita Vîta and Douglas S. Bridges. Apartness as a Relation Between Subsets

16:00-16:30  Robert Rettinger, Xizhong Zheng Romain Gengler and Burchard von Braunmühl. Monotonically Computable Real Numbers

16:30-17:00  Tea & Coffee Break

Afternoon Session:

Chair: Sergiu Rudeanu

17:00-17:30   Daniel Hort and Jirí Rachunek. Lex Ideals of Generalized MV-Algebras

17:30-18:00  George Georgescu and Afrodita Iorgulescu. Pseudo-BCK Algebras: An Extension of BCK Algebras

20:00-22:00 Cocktail

Tuesday 3 July

Morning Session:

Chair: Piergiorgio Odifreddi

10:00-11:00  Hajime Ishihara. Sequentially Continuity in Constructive Mathematics (Invited Lecture)

11:00-11:30  Tea & Coffee Break

11:30-12:00  Bas Spitters. Unbounded Operators on Hilbert Spaces in Constructive Mathematics

12:00-12:30  Douglas Bridges and Gabriela Popa. Approximate Minima, Epigraphs, and Sections of Functions in Constructive Mathematics

12:30-14:30  Lunch Break

Early Afternoon Session:

Chair: Raluca Vernic

14:30-15:00  Jouni Järvinen. Armstrong Systems on Ordered Sets

15:00-15:30  Martin Platek, Tomas Holan and Vladislav Kubon. On Relax-ability of Word-Order by D-grammars

15:30-16:00   Vincent Vajnovszki. A Loopless Generation of Bitstrings without p Consecutive Ones

16:00-16:30  Gabriela Alexe, Sorin Alexe and Peter L. Hammer. Maximal Complete Bipartite Subgraph Enumeration and Recognition of Association Rules in Databases

16:30-17:00  Tea & Coffee Break

Afternoon Session:

Chair: Solomon Marcus

17:00-17:30  Nicholas Dudley Ward. Mathematics in the Financial World

17:30-18:00  Cristian S. Calude, Elena Calude. QED vs QD

18:00-18:30  D. Belostotski, D. Kravtsov, A. Shemshurenko, M. Sobol, A.N. Trahtman and Sh. Yakov. Locally, Locally Threshold and Piecewise Testable Languages. Some Implemented Algorithms

Wednesday 4 July

Morning Session:

Chair: Douglas S. Bridges

10:00-10:30  Lane A. Hemaspaandra and Harald Hempel. P-Immune Sets with Holes Lack Self-Reducibility Properties

10:30-11:00  Ludwig Staiger. How Large is the Set of Disjunctive Sequences?

11:00-11:30  Tea & Coffee Break

11:30-12:00  Solomon Marcus. Information: What Does it Mean?

12:00-14:00  Lunch Break

14:00-19:00  Excursion

Thursday 5 July

Morning Session:

Chair: Frank Harary

10:00-11:00  Ioan Tomescu. The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity (Invited Lecture)

11:00-11:30  Tea & Coffee Break

11:30-12:00  Vadim E. Levit and Eugen Mandrescu. Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings

12:00-12:30  Vitaly Voloshin. Greedy Algorithms for the Lower and Upper Chromatic Numbers

12:30-14:30  Lunch Break

Early Afternoon Session:

Chair: Ludwig Staiger

14:30-15:00  Gabriel Istrate. Phase Transitions in Combinatorial Problems and Their (Possible) Connections with Computational Complexity

15:00-15:30  Sorin Alexe and Peter L. Hammer. Accelerated Algorithm for Pattern Detection in the Logical Analysis of Data

15:30-16:00  Radu Gramatovici. Bounded Deterministic Go-through Automata

16:00-16:30  Marian Alexandru Baroni. Symmetry and Antisymmetry in Strings and Sequences

16:30-17:00  Tea & Coffee Break

Afternoon Session:

Chair: Martin Platek

17:00-17:30   Solomon Marcus. Languages, Infinite Words and their Interaction

17:30-18:00  Henning Fernau. Even Linear Simple Matrix Languages: Formal Language Aspects

18:00-18:30  Eugen Zaharescu. A High-Level Programming Language for Image Processing Using Mathematical Morphology

Friday 6 July

Morning Session:

Chair: Cristian S. Calude

10:00-11:00  Piergiorgio Odifreddi. Recursive Functions: An Archeological Look (Invited Lecture)

11:00-11:30  Tea & Coffee Break

11:30-12:00  Veronica Becher, Sergio Daicz and Gregory Chaitin. A Highly Random Number

12:00-12:30  Cristian Grozea. Relations Between Low Subrecursion Classes

12:30-14:30  Lunch Break

Early Afternoon Session:

Chair: Gheorghe Marin

14:30-15:00  Adrian Atanasiu and Carlos Martin-Vide. P-Systems and Context-Free Languages

15:00-15:30  Adriana Popovici and Dan Popovici. On the Structure of Linear Cellular Automata

15:30-16:00   Anatol Ursu. Sequential Systems Approximate States Identification Using Sequential Transition Specifications

16:00-16:30  Conference Closing

19:00-22:00  Conference Dinner

File translated from TEX by TTH, version 2.25.
On 7 Jun 2001, 07:47.