| 2008 |
|---|
| 18 | EE | Joanna Jedrzejowicz,
Piotr Jedrzejowicz:
GEP-Induced Expression Trees as Weak Classifiers.
ICDM 2008: 129-141 |
| 2007 |
|---|
| 17 | EE | Joanna Jedrzejowicz,
Piotr Jedrzejowicz:
An Investigation of Agent-Based Hybrid Approach to Solve Flowshop and Job-Shop Scheduling Problems.
KES (1) 2007: 172-179 |
| 2006 |
|---|
| 16 | EE | Joanna Jedrzejowicz,
Piotr Jedrzejowicz:
Agent-Based Approach to Solving Difficult Scheduling Problems.
IEA/AIE 2006: 24-33 |
| 2005 |
|---|
| 15 | | Joanna Jedrzejowicz,
Andrzej Szepietowski:
Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings
Springer 2005 |
| 14 | EE | Joanna Jedrzejowicz,
Piotr Jedrzejowicz:
New Upper Bounds for the Permutation Flowshop Scheduling Problem.
IEA/AIE 2005: 232-235 |
| 2003 |
|---|
| 13 | EE | Joanna Jedrzejowicz,
Piotr Jedrzejowicz:
Population-Based Approach to Multiprocessor Task Scheduling in Multistage Hybrid Flowshops.
KES 2003: 279-286 |
| 2002 |
|---|
| 12 | | Joanna Jedrzejowicz,
Piotr Jedrzejowicz:
Experimental Evaluation of the PLA-Based Permutation-Scheduling.
HIS 2002: 241-250 |
| 2001 |
|---|
| 11 | EE | Joanna Jedrzejowicz,
Andrzej Szepietowski:
On the expressive power of the shuffle operator matched with intersection by regular sets.
ITA 35(4): 379-388 (2001) |
| 10 | EE | Joanna Jedrzejowicz,
Andrzej Szepietowski:
Shuffle languages are in P.
Theor. Comput. Sci. 250(1-2): 31-53 (2001) |
| 1999 |
|---|
| 9 | | Joanna Jedrzejowicz:
Structural Properties of Shuffle Automata.
Grammars 2(1): 35-51 (1999) |
| 1996 |
|---|
| 8 | | Joanna Jedrzejowicz:
Undecidability Results for Shuffle Languages.
Journal of Automata, Languages and Combinatorics 1(2): 147-164 (1996) |
| 1995 |
|---|
| 7 | | Joanna Jedrzejowicz:
An Undecidable Problem for Shuffle Languages.
Developments in Language Theory 1995: 112-118 |
| 1993 |
|---|
| 6 | | Joanna Jedrzejowicz:
Remark on shuffle indentities.
Bulletin of the EATCS 50: 222 (1993) |
| 1990 |
|---|
| 5 | | Joanna Jedrzejowicz:
Infinite Hierarchy of Shuffle Expressions Over a Finite Alphabet.
Inf. Process. Lett. 36(1): 13-17 (1990) |
| 1988 |
|---|
| 4 | | Joanna Jedrzejowicz:
Infinite Hierarchy of Expressions Containing Shuffle Closure Operator.
Inf. Process. Lett. 28(1): 33-37 (1988) |
| 1987 |
|---|
| 3 | | Joanna Jedrzejowicz:
Nesting of Shuffle Closure is Important.
Inf. Process. Lett. 25(6): 363-368 (1987) |
| 1983 |
|---|
| 2 | | Joanna Jedrzejowicz:
On the Enlargement of the Class of Regular Languages by the Shuffle Closure.
Inf. Process. Lett. 16(2): 51-54 (1983) |
| 1976 |
|---|
| 1 | | Joanna Jedrzejowicz:
One-One Degrees of Turing Machines Decision Problems.
MFCS 1976: 385-389 |
