TCS / Research / Publications / 2004
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Publications in 2004

78Catharina Candolin. Information warfare and security in a network-centric environment. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Dec 2004.
Info
77Annikka Aalto. Automatic translation of SDL into high level Petri nets. Technical Report B21, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2004.
NOTE: Reprint of Master's thesis; see URL below.
PostScript (3 MB)
GZipped PostScript (488 kB)
PDF (782 kB)
Info
See www.tcs.hut.fi ...
76Catharina Candolin. Self healing networks against infrastructural warfare. In Proceedings of the 5th Australian Information Warfare & IT Security Conference, Fremantle, Australia, November 2004.
Info
75Mikko Särelä and Pekka Nikander. Applying host identity protocol to tactical networks. In Proceedings of IEEE Milcom 2004, Monterey, California, USA, Nov 2004.
Info
74Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple bounded LTL model checking. In Alan J. Hu and Andrew K. Martin, editors, Formal Methods in Computer-Aided Design 2004, 5th International Conference FMCAD'04, Austin, Texas, USA, volume 3312 of Lecture Notes in Computer Science, pages 186–200. Springer, nov 2004.
Info
See www.springerlink.com ...
73Malcolm Greig, Harri Haanpää, and Petteri Kaski. On the existence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. In Lars Døvling Andersen and Olav Geil, editors, Proceedings of the 8th Nordic Combinatorial Conference, pages 65–69, Aalborg, Denmark, October 2004. Department of Mathematical Sciences, Aalborg University. Extended summary.
Info
72Keijo Heljanko and Alin Ştefănescu. Complexity results for checking distributed implementability. Technical Report 05/2004, Institute of Formal Methods in Computer Science, University of Stuttgart, Stuttgart, Germany, October 2004.
Info
See www.tcs.hut.fi ...
71Tomi Janhunen, Toni Jussila, Matti Järvisalo, and Emilia Oikarinen. Teaching Smullyan's analytic tableaux in a scalable learning environment. In Ari Korhonen and Lauri Malmi, editors, Proceedings of the 4th Finnish/Baltic Sea Conference on Computer Science Education, pages 85–94, Joensuu, October 2004. Published in the report series of the Laboratory of Information Processing, TKO-A42/04.
Info
70Misa Keinänen. Obtaining memory efficient solutions to boolean equation systems. In J. Bicarregui A. Butterfield and A. Arenas, editors, Proceedings of the 9th International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2004), number SEA-SR-03 in Technical Report, pages 191–208, Linz, Austria, September 2004. Institute for systems Engineering & Automation, Kepler University Linz.
Info
69Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Parallel encodings of classical planning as satisfiability. In José Júlio Alferes and João Alexandre Leite, editors, Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA'04), volume 3229 of Lecture Notes in Computer Science, pages 307–319, Lisbon, Portugal, September 2004. Springer-Verlag.
Info
See www.tcs.hut.fi ...
68Tommi Syrjänen. Cardinality constraint programs. In Jose Julio Alferes and Joao Leite, editors, The 9th European Conference on Logics in Artificial Intelligence (JELIA'04), pages 187–200. Springer-Verlag, September 2004.
PostScript (322 kB)
GZipped PostScript (147 kB)
Info
67Tomi Janhunen and Emilia Oikarinen. Capturing parallel circumscription with disjunctive logic programs. In José Júlio Alferes and Jo ao Leite, editors, Proceedings of the 9th European Conference on Logics in Artificial Intelligence, JELIA'04, pages 134–146, Lisbon, Portugal, September 2004. Springer-Verlag. LNAI 3229.
Info
See www.springerlink.com ...
66Tuomo Pyhälä. Specification-based test selection in formal conformance testing. Research Report A93, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2004.
NOTE: Reprint of Master's thesis; see URL below.
PostScript (936 kB)
GZipped PostScript (355 kB)
PDF (456 kB)
Info
See www.tcs.hut.fi ...
65Tomi Janhunen. Representing normal programs with clauses. In Ramon López de Mántaras and Lorenza Saitta, editors, Proceedings of the 16th European Conference on Artificial Intelligence, pages 358–362, Valencia, Spain, August 2004. IOS Press.
Info
64Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple bounded LTL model checking. Research Report A92, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, July 2004.
PostScript (1 MB)
GZipped PostScript (312 kB)
PDF (369 kB)
Info
63Harri Haanpää, editor. Annual report for the year 2003. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, June 2004.
PostScript (475 kB)
GZipped PostScript (227 kB)
PDF (245 kB)
Info
62Pauli Aho and Catharina Candolin. Enabling network-centric warfare by securing the core infrastructure. In Proceedings of the 3rd European Conference on Information Warfare (ECIW'04), London, UK, June 2004.
Info
61Jan Friso Groote and Misa Keinänen. A sub-quadratic algorithm for conjunctive and disjunctive bess. CS-Report 04-13, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, Netherlands, June 2004.
Info
60Lasse Anderson, Johannes Helander, Keijo Heljanko, Tomi Janhunen, Robert Jürgens, Ismo Kangas, Kari J. Nurmela, Kenneth Oksanen, Olavi Pesonen, Marko Rauhamaa, James Reilly, Heikki Suonsivu, Kimmo Valkealahti, Kimmo Varpaaniemi, and Pauli Väisänen. PROD 3.4.00 — an advanced tool for efficient reachability analysis. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, June 2004. Software.
Info
See www.tcs.hut.fi ...
59Pekka Orponen and Satu Elisa Schaeffer. Efficient algorithms for sampling and clustering of large nonuniform networks. Technical Report cond-mat/0406048, arXiv.org, June 2004.
Info
See arxiv.org ...
58Pekka Orponen and Satu Elisa Schaeffer. Efficient algorithms for sampling and clustering of large nonuniform networks. Technical Report cond-mat/0406048, arXiv.org e-Print archive, http://arxiv.org/, June 2004.
Info
57Toni Jussila. BMC via dynamic atomicity analysis. In Proceedings of the International Conference on Application of Concurrency to System Design (ACSD'2004), Hamilton, Ontario, Canada, June 2004.
Info
56Mikko Särelä. Measuring the effects of mobility on reactive ad hoc routing protocols. Research Report A91, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, May 2004.
NOTE: Reprint of Master's thesis; see URL below.
PostScript (1 MB)
GZipped PostScript (325 kB)
PDF (425 kB)
Info
See www.tcs.hut.fi ...
55Jan Friso Groote and Misa Keinänen. Solving disjunctive/conjunctive boolean equation systems with alternating fixed points. In K. Jensen and A. Podelski, editors, Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2004), volume 2988 of Lecture Notes in Computer Science, pages 436–450, Barcelona, Spain, April 2004. Springer.
Info
54Misa Keinänen and Ilkka Niemelä. Solving alternating boolean equation systems in answer set programming. In U. Geske D. Seipel, M. Hanus and O. Bartenstein, editors, Proceedings of the 15th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2004), volume 327 of Technical Report, pages 255–264, Potsdam, Germany, April 2004. Bayerische Julius-Maximilians-Universität Würzburg, Institut für Informatik.
Info
53Matti Järvisalo. Proof complexity of cut-based tableaux for Boolean circuit satisfiability checking. Research Report A90, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2004.
NOTE: Reprint of Master's thesis; see URL below.
PostScript (781 kB)
GZipped PostScript (317 kB)
PDF (360 kB)
Info
See www.tcs.hut.fi ...
52Harri Haanpää and Patric R. J. Östergård. Sets in Abelian groups with distinct sums of pairs. Research Report A87, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2004.
PostScript (421 kB)
GZipped PostScript (210 kB)
PDF (151 kB)
Info
51Harri Haanpää. Minimum sum and difference covers of Abelian groups. Research Report A88, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2004.
PostScript (405 kB)
GZipped PostScript (204 kB)
PDF (138 kB)
Info
50Harri Haanpää. Constructing certain combinatorial structures by computational methods. Research Report A89, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2004. Doctoral dissertation.
NOTE: Papers available through URL below.
PostScript (568 kB)
GZipped PostScript (267 kB)
PDF (272 kB)
Info
See lib.hut.fi ...
49Harri Haanpää. Constructing Certain Combinatorial Structures by Computational Methods. Electronic version of doctoral thesis, Helsinki University of Technology, February 2004. http://lib.hut.fi/Diss/2004/isbn9512269422/.
Info
See lib.hut.fi ...
48Antti Autere. New online power-aware algorithms in wireless networks. In 12th International Conference on Software, Telecommunications and Computer Networks, pages 439–443, Split, Dubrovnik (Croatia), Venice (Italy), 2004. University of Split.
Info
47Catharina Candolin. Information warfare and security in a network-centric environment. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2004.
Info
46Erkki Ruponen. Integrointitestauksen EXIT-kriteerit Symbian-pohjaisessa ohjelmistotuotteessa. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2004.
Info
45Annikka Aalto. Automatic translation of SDL into high level Petri nets. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2004.
Info
See www.tcs.hut.fi ...
44Heikki Rantanen. Analyzing the Random-Walk algorithm for SAT. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2004.
PDF (512 kB)
Info
43Harriet Beaver. Using rule-based constraint programming to find MAPs for Bayesian networks. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2004.
Info
42Mikko Särelä. Measuring the effects of mobility on reactive ad hoc routing protocols. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2004.
Info
See www.tcs.hut.fi ...
41Matti Järvisalo. Proof complexity of cut-based tableaux for Boolean circuit satisfiability checking. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2004.
Info
See www.tcs.hut.fi ...
40Tuomo Pyhälä. genfacbm — a benchmark generator based on factoring for SAT and ASP solvers, 2004. Computer program.
Info
See www.tcs.hut.fi ...
39Technical aspects of network centric warfare, 2004. ISBN: 951-25-1499-0.
Info
38Janne Lundberg. A system for combining forward error correction and source authentication in wireless multicast networks. In Technical Aspects of Network Centric Warfare, Helsinki, Finland, 2004.
Info
37Janne Lundberg. Implementation of packet level authentication for Linux. In Technical Aspects of Network Centric Warfare, Helsinki, Finland, 2004.
Info
36Janne Lundberg. PLA – implementation of packet level authentication for Linux, 2004. Computer Program.
Info
35Janne Lundberg. MSEC – a secure and reliable multicast delivery engine for Linux, 2004. Computer Program.
Info
34Kimmo Varpaaniemi. Stubborn sets for priority nets. In Cevdet Aykanat, Tuğrul Dayar, and İbrahim Körpeoğlu, editors, Computer and Information Sciences — ISCIS 2004, 19th International Symposium, Kemer-Antalya, Turkey, October 27–29, 2004, Proceedings, volume 3280 of Lecture Notes in Computer Science, pages 574–583. Springer-Verlag, Berlin, Germany, 2004. © Springer-Verlag Berlin Heidelberg 2004.
Errata 
Info
See users.tkk.fi ...
33Emilia Oikarinen and Tomi Janhunen. Verifying the equivalence of logic programs in the disjunctive case. In V. Lifschitz and I. Niemelä, editors, Logic Programming and Nonmonotonic Reasoning, Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 2923 of Lecture Notes in Artificial Intelligence, pages 180–193, Fort Lauderdale, USA, January 2004. Springer-Verlag.
Info
See www.springerlink.com ...
32Harri Haanpää. Minimum sum and difference covers of Abelian groups. Journal of Integer Sequences, 7(2):article 04.1.8, 2004.
Info
See www.math.uwaterloo.ca ...
31Harri Haanpää, Antti Huima, and Patric R. J. Östergård. Sets in with distinct sums of pairs. Discrete Applied Mathematics, 138:99–106, 2004.
Info
See lib.hut.fi ...
30Victor Marek, Ilkka Niemelä, and Mirosław Truszczyński. Programs with monotone cardinality atoms. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 154–166. Springer-Verlag, 2004.
Info
See www.tcs.hut.fi ...
29Vladimir Lifschitz and Ilkka Niemelä, editors. Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Artificial Intelligence 2923. Springer-Verlag, 2004.
Info
28Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Parallel encodings of classical planning as satisfiability. Technical Report 198, Institute of Computer Science at Freiburg University, 2004.
Info
See www.informatik.uni-freiburg.de ...
27Gerhard Brewka, Ilkka Niemelä, and Tommi Syrjänen. Logic programs with ordered disjunction. Computational Intelligence, 20(2):333–357, 2004.
Info
See www.tcs.hut.fi ...
26Matti Järvisalo. Lauselogiikan toteutuvuustarkastus: käytännönläheistä teoriaa. Tietojenkäsittelytiede, 22:47–63, 2004. In Finnish.
PDF (119 kB)
Info
25Matti Järvisalo and Ilkka Niemelä. A compact reformulation of propositional satisfiability as binary constraint satisfaction. In Alan M. Frisch and Ian Miguel, editors, Proceedings of the 3rd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems: Towards Systemisation and Automation, pages 111–124, 2004. Proceedings available at http://www-users.cs.york.ac.uk/%7Efrisch/Reformulation/04/.
PostScript (357 kB)
GZipped PostScript (162 kB)
PDF (205 kB)
Info
24Matti Järvisalo. Todistuskompleksisuudesta Boolen piirien toteutuvuustarkastuksessa. In Pasi Fränti and Esko Marjomaa, editors, Tietojenkäsittelytieteen päivät 2004, volume 5 of International Proceedings Series of Department of Computer Science, University of Joensuu, pages 49–53. Joensuun yliopisto, 2004. In Finnish.
PostScript (204 kB)
GZipped PostScript (84 kB)
PDF (102 kB)
Info
23Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Unrestricted vs restricted cut in a tableau method for Boolean circuits. In 8th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, USA, January 4–6, 2004. Proceedings available at http://rutcor.rutgers.edu/%7Eamai/aimath04/.
Info
See www.tcs.hut.fi ...
22Emil Falck, Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Balanced data gathering in energy-constrained sensor networks. In S. Nikoletseas and J. D. P. Rolim, editors, Algorithmic Aspects of Wireless Sensor Networks: First International Workshop (ALGOSENSORS 2004, Turku, Finland, July 2004), volume 3121 of Lecture Notes in Computer Science, pages 59–70, Berlin Heidelberg, 2004. Springer-Verlag.
Info
See dx.doi.org ...
21Petteri Kaski and Patric R. J. Östergård. Enumeration of balanced ternary designs. Discrete Applied Mathematics, 138(1–2):133–141, 2004.
Info
See dx.doi.org ...
20Petteri Kaski and Patric R. J. Östergård. Miscellaneous classification results for 2-designs. Discrete Mathematics, 280(1–3):65–75, 2004.
Info
See dx.doi.org ...
19Petteri Kaski. Packing Steiner trees with identical terminal sets. Information Processing Letters, 91(1):1–5, 2004.
Info
See dx.doi.org ...
18Petteri Kaski and Patric R. J. Östergård. The Steiner triple systems of order 19. Mathematics of Computation, 73:2075–2092, 2004.
Info
See www.ams.org ...
17Petteri Kaski and Patric R. J. Östergård. There exist nonisomorphic STS(19) with equivalent point codes. Journal of Combinatorial Designs, 12(6):443–448, 2004.
Info
See dx.doi.org ...
16Satu Elisa Schaeffer, Jonathan C. Clemens, and Patrick Hamilton. Decision making in distributed sensor networks. In Proceedings of the Santa Fe Institute Complex Systems Summer School, Santa Fe, NM, USA, 2004. Santa Fe Institute.
PostScript (606 kB)
GZipped PostScript (168 kB)
PDF (165 kB)
Info
15Satu Elisa Virtanen and Pekka Nikander. Local clustering for hierarchical ad hoc networks. In Proceedings of WiOpt'04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, pages 404–405, Los Alamitos, CA, USA, 2004. IEEE Computer Society.
Info
14Sven Laur and Helger Lipmaa. On private similarity search protocols. In Sanna Liimatainen and Teemupekka Virtanen, editors, Proceedings of the 9th Nordic Workshop on Secure IT Systems (NordSec 2004), pages 73–77, 2004.
PDF (155 kB)
Info
13Bart Goethals, Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. On private scalar product computation for privacy-preserving data mining.. In Choonsik Park and Seongtaek Chee, editors, Information Security and Cryptology - ICISC 2004, 7th International Conference, Seoul, Korea, December 2-3, 2004, Revised Selected Papers, volume 3506 of Lecture Notes in Computer Science, pages 104–120. Springer, 2004.
Info
See dx.doi.org ...
12Timo Latvala. Nusmv-bpltl. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2004. Software.
Info
See www.tcs.hut.fi ...
11Timo Latvala. scheck1.2. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2004. Software.
Info
See www.tcs.hut.fi ...
10Timo Latvala and Heikki Tauriainen. Improved on-the-fly verification with testers. Nordic Journal of Computing, 11(2):148–164, 2004.
Info
9Timo Latvala and Marko Mäkelä. LTL model checking for modular Petri nets. In J. Cortadella and W. Reisig, editors, Application and Theory of Petri Nets 2004. 25th International Conference, ICATPN 2004., volume 3099 of LNCS, pages 298–311, 2004.
Info
See springerlink.metapress.com ...
8Tommi A. Junttila. New canonical representative marking algorithms for place/transition-nets. In J. Cortadella and W. Reisig, editors, Application and Theory of Petri Nets 2004, volume 3099 of Lecture Notes in Computer Science, pages 258–277. Springer, 2004.
Info
7Tommi A. Junttila. New orbit algorithms for data symmetries. In Application of Concurrency to System Design 2004, pages 175–184. IEEE, 2004.
Info
6Toni Jussila. Efficient bounded reachability through iterative strengthening. In Concurrency, Specification and Programming CS&P'2004, 2004.
Info
5Tomi Janhunen and Ilkka Niemelä. GnT – a solver for disjunctive logic programs. In Vladimir Lifschitz and Ilkka Niemelä, editors, Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 331–335, Fort Lauderdale, Florida, 2004. Springer-Verlag. LNAI 2923.
Info
See www.springerlink.com ...
4Tomi Janhunen and Emilia Oikarinen. lpeq and dlpeq – translators for automated equivalence testing of logic programs. In Vladimir Lifschitz and Ilkka Niemelä, editors, Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 336–340, Fort Lauderdale, Florida, 2004. Springer-Verlag. LNAI 2923.
Info
See www.springerlink.com ...
3Tomi Janhunen and Patrik Simons. GnT 2.1 — A tool for computing stable models for disjunctive logic programs. http://www.tcs.hut.fi/Software/gnt/, 2004. Computer Program.
Info
See www.tcs.hut.fi ...
2Ville Nuorvala, Henrik Petander, and Antti Tuominen. MIPL Mobile IPv6 for Linux, version 2.0 rc1, 2004.
Info
See www.mobile-ipv6.org ...
1Ville Nuorvala, Henrik Petander, and Antti Tuominen. MIPL Mobile IPv6 for Linux, version 1.1, 2004.
Info
See www.mobile-ipv6.org ...

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.