Automata, languages and programmingOREJAS, Fernando; VAN LEEUWEN, Jan.Theoretical computer science. 2005, Vol 331, Num 1, issn 0304-3975, 249 p.Conference Proceedings

Automata, languages and programming (Crete, 8-12 July 2001)Orejas, Fernando; Spirakis, Paul G; van Leeuwen, Jan et al.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42287-0, XIV, 1083 p, isbn 3-540-42287-0Conference Proceedings

Beyond the Alder-Strassen boundBLÄSER, Markus.Theoretical computer science. 2005, Vol 331, Num 1, pp 3-21, issn 0304-3975, 19 p.Conference Paper

Emergence of a super-turing computational potential in artificial living systemsWIEDERMANN, Jiri; VAN LEEUWEN, Jan.Lecture notes in computer science. 2001, pp 55-65, issn 0302-9743, isbn 3-540-42567-5Conference Paper

Beyond the Turing limit : Evolving interactive systemsVAN LEEUWEN, Jan; WIEDERMANN, Jiri.Lecture notes in computer science. 2001, pp 90-109, issn 0302-9743, isbn 3-540-42912-3Conference Paper

Performance ratios of the Karmarkar-Karp differencing methodMICHIELS, Wil; KORST, Jan; AARTS, Emile et al.Journal of combinatorial optimization. 2007, Vol 13, Num 1, pp 19-32, issn 1382-6905, 14 p.Article

New imperfect random source with applications to coin-flippingDODIS, Yevgeniy.Lecture notes in computer science. 2001, pp 297-309, issn 0302-9743, isbn 3-540-42287-0Conference Paper

The trace coding problem is undecidableKUNC, Michal.Lecture notes in computer science. 2001, pp 603-614, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Improvements of the alder-strassen bound: Algebras with nonzero radicalBLÄSER, Markus.Lecture notes in computer science. 2001, pp 79-91, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Languages, rewriting systems, and verification of infinite-state systemsBOUAJJANI, Ahmed.Lecture notes in computer science. 2001, pp 24-39, issn 0302-9743, isbn 3-540-42287-0Conference Paper

A set-theoretic framework for assume-guarantee reasoningMAIER, Patrick.Lecture notes in computer science. 2001, pp 821-834, issn 0302-9743, isbn 3-540-42287-0Conference Paper

The star problem in trace monoids: Reductions beyond C4KIRSTEN, Daniel.Lecture notes in computer science. 2001, pp 591-602, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Theoretical aspects of evolutionary algorithmsWEGENER, Ingo.Lecture notes in computer science. 2001, pp 64-78, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Modelling with partial orders - why and why not?NIELSEN, Mogens.Lecture notes in computer science. 2001, pp 61-63, issn 0302-9743, isbn 3-540-42287-0Conference Paper

All-pairs shortest paths computation in the BSP modelTISKIN, Alexandre.Lecture notes in computer science. 2001, pp 178-189, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Testing hypergraph colorabilityCZUMAJ, Artur; SOHLER, Christian.Theoretical computer science. 2005, Vol 331, Num 1, pp 37-52, issn 0304-3975, 16 p.Conference Paper

Realizability and verification of MSC graphsALUR, Rajeev; ETESSAMI, Kousha; YANNAKAKIS, Mihalis et al.Theoretical computer science. 2005, Vol 331, Num 1, pp 97-114, issn 0304-3975, 18 p.Conference Paper

Relativistic computers and non-uniform complexity theoryWIEDERMANN, Jiri; VAN LEEUWEN, Jan.Lecture notes in computer science. 2002, pp 287-299, issn 0302-9743, isbn 3-540-44311-8, 13 p.Conference Paper

A behavioural pseudometric for probabilistic transition systemsVAN BREUGEL, Franck; WORRELL, James.Theoretical computer science. 2005, Vol 331, Num 1, pp 115-142, issn 0304-3975, 28 p.Conference Paper

Tree automata with one memory set constraints and cryptographic protocolsCOMON, Hubert; CORTIER, Vérornque.Theoretical computer science. 2005, Vol 331, Num 1, pp 143-214, issn 0304-3975, 72 p.Conference Paper

Finding a Δ-regular supergraph of minimum orderBODLAENDER, Hans L; TAN, Richard B; VAN LEEUWEN, Jan et al.Discrete applied mathematics. 2003, Vol 131, Num 1, pp 3-9, issn 0166-218X, 7 p.Conference Paper

Faster gossiping on butterfly networksSIBEYN, Jop F.Theoretical computer science. 2005, Vol 331, Num 1, pp 53-72, issn 0304-3975, 20 p.Conference Paper

Performance ratios for the Differencing method applied to the balanced number partitioning problemMICHIELS, Wil; KORST, Jan; AARTS, Emile et al.Lecture notes in computer science. 2003, pp 583-595, issn 0302-9743, isbn 3-540-00623-0, 13 p.Conference Paper

Automata, circuits, and hybrids: Facets of continuous timeTRAKHTENBROT, Boris A.Lecture notes in computer science. 2001, pp 4-23, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Approximation algorithms for partial covering problemsGANDHI, Rajiv; KHULLER, Samir; SRINIVASA, Aravind et al.Lecture notes in computer science. 2001, pp 225-236, issn 0302-9743, isbn 3-540-42287-0Conference Paper