12.
Adam Roman
Genetic algorithm for synchronization
submitted
synchroGA source code

11.
Igor T. Podolak, Adam Roman
On the number of clusterings in a hierarchical classification model with overlapping clusters
submitted

10.
Adam Roman
A probabilistic approach to the Cerny Conjecture
manuscript

9.
Adam Roman
Experiments on synchronizing automata
submitted
cerny.cpp - source code
Compiled program CERNY.EXE
Full results of experiments

8.
Adam Roman
A note on Cerny Conjecture for automata over 3-letter alphabet
Journal of Automata, Languages and Combinatorics, 13 (2008) 2

7.
Adam Roman
Synchronizing Finite Automaton with Short Reset Words (extended version)
Applied Mathematics and Computation, to be published

6.
Piotr Kalita, Igor Podolak, Adam Roman, Bartosz Bierkowski
Algorithm for Intelligent Prediction of Requests in Business Systems
Lecture Notes in Computer Science 4910 (2008), 696-707

5.
Adam Roman, Wit Foryś
Lower bound for the length of synchronizing words in partially-synchronizing automata
Lecture Notes in Computer Science 4910 (2008), 448-459

4.
Adam Roman
Two simple methods for obtaining new classes of automata fulfilling Cerny Conjecture
Schedae Informaticae 16 (2007), 35-46

3.
Adam Roman
Merging states and synchronization problem
Schedae Informaticae 15 (2006), 95-108

2.
Adam Roman
Synchronizing Finite Automaton with Short Reset Words
Lect. Series on Computer and Computational Sciences 4 (2005), 492-495

1.
Adam Roman
New Algorithms for Finding Short Reset Sequences in Synchronizing Automata
Enformatika 7 (2005), 13 - 17

2.
Adam Roman (co-author)
Encyklopedia Matematyka
Wydawnictwo GREG, 439 pp. (2006), ISBN 83-7517-015-1

1.
Wit Foryś, Maria Foryś, Adam Roman
Języki, automaty, obliczenia
materiały do zajęć na platformie e-learningowej, http://wazniak.mimuw.edu.pl

10.
Workshop "Around the Cerny Conjecture"
Wroclaw, 2008

9.
SOFSEM '08, 34th International Conference on Current Trends in Theory and Practice of Computer Science
Novy Smokovec, Slovakia, 2008
(with B. Bierkowski, P. Kalita and I. Podolak) Algorithm for Intelligent Prediction of Requests in Business Systems

8.
SOFSEM '08, 34th International Conference on Current Trends in Theory and Practice of Computer Science
Novy Smokovec, Slovakia, 2008
(with WIt Foryś) Lower bound for the length of synchronizing words in partially-synchonizing automata

7.
Dni Matematyki Dyskretnej
Zakopane, Poland, 2007
(with W. Foryś) Uogólnione pojęcie automatu synchronizującego

6.
CSR '06, International Computer Science Symposium
St. Petersburg, Russia, 2006
Synchronization of finite automaton. Computations for different alphabet sizes

5.
ICCMSE '05, Int. Conf. on Computational Methods in Science and Engineering
Loutraki, Greece 2005
Synchronizing Finite Automata with Short Reset Words

4.
IEC '05, 5th International Enformatica Conference
Prague, Czech Republic, 2005
New Algorithms For Finding Short Reset Sequences in Finite Automata

3.
ICALP '04, International Colloquium on Automata, Languages and Programming
Turku, Finland, 2004
Merging states and synchronization problem

2.
Dni Matematyki Dyskretnej
Zakopane, 2004
Rola rozmiaru alfabetu w problemie synchronizacji

1.
XVIII Forum Informatyki Teoretycznej
Karpacz, 2004
Stany zawężające i synchronizacja automatów skończonych

5.
Dean Grant
2007

4.
6Th UE Framework Programme
Ambient Intelligent System of Agents for Knowledge-based and Integrated Services for Mobility Impaired users, participant
2007

3.
UE Grant for the best UJ PhD Students
Optymalizacja działania sieci miejskiej MPK w Krakowie przy użyciu algorytmów genetycznych
2006

2.
National Committee for Scientific Research, Grant No. 3T11 010 27
Wybrane problemy kodowania i teorii automatów
15.10.2004 - 14.10.2005

1.
Dean Grant
2004

Adam Roman
Problemy synchronizacji automatów skończonych
research and thesis done in the Jagiellonian University, Institute of Computer Science
iv 103 pp. (2006), in Polish, not published