Browse by Person
 | Up a level |
Razgon, Igor and O’Sullivan, B. (2008) Almost 2-SAT is fixed-parameter tractable (extended abstract). In: Aceto, L. and Damgård, I. and Goldberg, L.A. and Halldórsson, M.M. and Ingólfsdóttir, A. and Walukiewicz, I. (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science 5125. Berlin, Germany: Springer Verlag, pp. 551-562. ISBN 9783540705758.
Ben-Sasson, E. and Harsha, P. and Lachish, Oded and Matsliah, A. (2008) Sound 3-query PCPPs are long. In: Aceto, L. and Damgård, I. and Goldberg, L.A. and Halldórsson, M.M. and Ingólfsdóttir, A. and Walukiewicz, I. (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science 5125. Berlin, Germany: Springer Verlag, pp. 686-697. ISBN 9783540705758.
Chen, Taolue and Fokkink, W.J. and Nain, S. (2006) On finite alphabets and infinite bases II: completed and ready simulation. In: Aceto, L. and Ingolfsdottir, A. (eds.) Foundations of Software Science and Computation Structures, 9th International Conference, {FOSSACS} 2006. Springer, pp. 1-15. ISBN 9783540330455.
Aceto, L. and Chen, Taolue and Fokkink, W.J. and Ingolfsdottir, A. (2006) On the axiomatizability of priority. In: Bugliesi, M. and Preneel, B. and Sassone, V. and Wegener, I. (eds.) ICALP 2006: Automata, Languages and Programming, 33rd International Colloquium. Lecture Notes in Computer Science 4052. Springer, pp. 480-491. ISBN 9783540359074.