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

Division is in uniform TC°HESSE, William.Lecture notes in computer science. 2001, pp 104-114, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Quick k-Median, k-Center, and facility location for sparse graphsTHORUP, Mikkel.Lecture notes in computer science. 2001, pp 249-260, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Reasoning about sequential and branching behaviours of message sequence graphsMADHUSUDAN, P.Lecture notes in computer science. 2001, pp 809-820, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Weisfeiler-Lehman refinement requires at least a linear number of iterationsFÜRER, Martin.Lecture notes in computer science. 2001, pp 322-333, issn 0302-9743, isbn 3-540-42287-0Conference Paper

A new method for balancing binary search treesROURA, Salvador.Lecture notes in computer science. 2001, pp 469-480, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Symbolic trace analysis of cryptographic protocolsBOREALE, Michele.Lecture notes in computer science. 2001, pp 667-681, issn 0302-9743, isbn 3-540-42287-0Conference Paper

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

Performance aspects of distributed caches using TTL-based consistencyCOHEN, Edith; HALPERIN, Eran; KAPLAN, Haim et al.Theoretical computer science. 2005, Vol 331, Num 1, pp 73-96, issn 0304-3975, 24 p.Conference Paper

Complexity of evolving interactive systemsVERBAAN, Peter; VAN LEEUWEN, Jan; WIEDERMANN, Jiri et al.Theory is forever : essays dedicated to Arto Salomaa on the occasion of this 70th birthday. Lecture notes in computer science. 2004, pp 268-281, issn 0302-9743, isbn 3-540-22393-2, 14 p.Book Chapter

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