|
73 | Antti Autere. Extensions and applications of the  algorithm. Research Report A98, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2005. Doctoral dissertation. |
|
|
72 | Misa Keinänen. Solving boolean equation systems. Research Report A99, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2005. |
|
|
71 | Catharina Candolin. Securing Military Decision Making in a Network-centric Environment. Doctoral dissertation, TKK Dissertations 20, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2005. |
|
|
70 | Hannu Kari Catharina Candolin, Janne Lundberg. Packet level authentication in military networks. In Proceedings of the 6th Australian Information Warfare & IT Security Conference, Geelong, Australia, November 2005. |
|
|
69 | Catharina Candolin. Securing Military Decision Making in a Network-centric Environment. Doctoral dissertation, TKK Dissertations 20, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2005. |
|
|
68 | Sven Laur and Kaisa Nyberg. Efficient mutual data authentication using manually authenticated strings. Report 2005/424, Cryptology ePrint Archive, November 2005. |
|
|
67 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Exact and approximate balanced data gathering in energy-constrained sensor networks. Theoretical Computer Science, 344(1):30–46, November 2005. |
|
|
66 | Toni Jussila. On bounded model checking of asynchronous systems. Research Report A97, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, October 2005. Doctoral dissertation. |
|
|
65 | Jan Friso Groote and Misa Keinänen. A sub-quadratic algorithm for conjunctive and disjunctive boolean equation systems. In D.V. Hung and M. Wirsing, editors, Theoretical Aspects of Computing – ICTAC 2005, volume 3722 of Lecture Notes in Computer Science, pages 545–558. Springer-Verlag, October 2005. |
|
|
64 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, and Roberto Sebastiani. MathSAT: Tight integration of SAT and mathematical decision procedures. Journal of Automated Reasoning, 35(1–3):265–293, October 2005. |
|
|
63 | Heikki Tauriainen. A note on the worst-case memory requirements of generalized nested depth-first search. Research Report A96, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, September 2005. |
|
|
62 | Emilia Oikarinen and Tomi Janhunen. CIRC2DLP — translating circumscription into disjunctive logic programming. In Chitta Baral, Gianluigi Grego, Nicola Leone, and Giorgio Terracina, editors, Logic Programming and Nonmonotonic Reasoning, Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 3662 of Lecture Notes in Artificial Intelligence, pages 405–409, Diamante, Italy, September 2005. Springer-Verlag. System Description. |
|
|
61 | Matti Järvisalo. rgen — a SAT benchmark generator, September 2005. Computer program. |
|
|
60 | Jean Gressmann, Tomi Janhunen, Robert Mercer, Torsten Schaub, Sven Thiele, and Richard Tichy. Platypus: A platform for distributed answer set solving. In Chitta Baral, Gianluigi Greco, Nicola Leone, and Giorgio Terracina, editors, Proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 227–239, Diamante, Italy, September 2005. Springer-Verlag. |
|
|
59 | Timo Latvala. Automata-theoretic and bounded model checking for linear temporal logic. Research Report A95, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2005. Doctoral dissertation. |
|
|
58 | Kimmo Varpaaniemi, editor. Annual report for the year 2004. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, July 2005. |
|
|
57 | Catharina Candolin. Ensuring decision making during information operations. In Proceedings of the 4th European Conference on Information Warfare (ECIW'05), University of Glamorgan, Wales, UK, July 2005. |
|
|
56 | Emilia Oikarinen. Translating parallel circumscription into disjunctive logic programming. In ICCL Summer School Student Workshop 2005, Dresden, Germany, July 2005. TU Dresden. |
|
|
55 | Gerd Brewka, Ilkka Niemelä, and Mirosław Truszczyński. Prioritized component systems. In Proceedings of the Twentieth National Conference on Artificial Intelligence, pages 596–601. AAAI Press, July 2005. |
|
|
54 | Keijo Heljanko, Tommi Junttila, and Timo Latvala. Incremental and complete bounded model checking for full PLTL. In Kousha Etessami and Sriram K. Rajamani, editors, Proceedings of the 17th International Conference on Computer Aided Verification (CAV'2005), volume 3576 of Lecture Notes in Computer Science, pages 98–111, Edinburgh, Scotland, United Kingdom, July 2005. Springer-Verlag. |
|
|
53 | Petteri Kaski. Algorithms for classification of combinatorial objects. Research Report A94, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2005. Doctoral dissertation. |
|
|
52 | Harri Haanpää and Petteri Kaski. The near resolvable 2-(13, 4, 3) designs and thirteen-player whist tournaments. Designs, Codes and Cryptography, 35(3):271–285, June 2005. |
|
|
51 | Keijo Heljanko and Alin Ştefănescu. Complexity results for checking distributed implementability. In Jörg Desel and Yosinori Watanabe, editors, Proceedings of the 5th International Conference on Application of Concurrency to System Design (ACSD'2005), pages 78–87, St Malo, France, June 2005. IEEE Computer Society. |
|
|
50 | Sakari Seitz, Mikko Alava, and Pekka Orponen. Focused local search for random 3-satisfiability. Journal of Statistical Mechanics: Theory and Experiment, P06006:1–27, June 2005. |
|
|
49 | Jiří Šíma and Satu Elisa Schaeffer. On the np-completeness of some graph cluster measures. Technical Report cs.CC/0506100, arXiv.org e-Print archive, http://arxiv.org/, June 2005. |
|
|
48 | Misa Keinänen. Obtaining memory efficient solutions to boolean equation systems. In Electronic Notes in Theoretical Computer Science, volume 133, pages 175–191. Elsevier, May 2005. |
|
|
47 | Maarit Hietalahti. Cooperation in clustered ad hoc networks. In Proceedings of the 5th Scandinavian Workshop on Wireless Ad-hoc Networks Adhoc'05, Stockholm, Sweden, May 2005. |
|
|
46 | Misa Kristian Keinänen. Solving Boolean Equation Systems. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, April 2005. |
|
|
45 | Evan Griffiths and Pekka Orponen. Optimization, block designs and No Free Lunch theorems. Information Processing Letters, 94(2):55–61, April 2005. |
|
|
44 | Janne Lundberg, Catharina Candolin, and Hannu Kari. Multicast source authentication for limited devices. In Proceedings of International Conference on Automation and Infor mation (ICAI'05), Buenos Aires, Argentina, March 2005. |
|
|
43 | Janne Lundberg, Catharina Candolin, and Hannu Kari. Multicast source authentication for limited devices. In Proceedings of International Conference on Automation and Information (ICAI'05), Buenos Aires, Argentina, March 2005. |
|
|
42 | Janne Lundberg. A Wireless Multicast Delivery Architecture for Mobile Terminals. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2005. |
|
|
41 | Misa Keinänen. Solving Boolean Equation Systems. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2005. |
|
|
40 | Ville Salmensuu. Feasibility of IPsec as a secure mobility management technology.. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2005. |
|
|
39 | Lasse Kiviluoto. Sperner capacity of directed graphs. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2005. |
|
|
38 | Tommi Vainikainen. Applying graph rewriting to model transformations. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2005. |
|
|
37 | Anssi Rajaniemi. Verkkopankin toimintavarmuuden turvaaminen tietoverkon näkökulmasta. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2005. |
|
|
36 | Antti Hyvärinen. SATU: A system for distributed propositional satisfiability checking in computational GRIDs. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2005. |
|
|
35 | Topi Pohjolainen. Model checking a client-server system with a scalable level of concurrency. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2005. |
|
|
34 | Stefano Marinoni. Performance of wireless ad hoc routing protocols — a simulation study in realistic environments. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2005. |
|
|
33 | Tuulia Kullberg. The effect of the access point selection method on reachability between a mobile ad hoc node and a fixed node. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2005. |
|
|
32 | Pauli Aho. Extending a generic constraint solver over polymorphic data. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2005. |
|
|
31 | Janne Lundberg, Catharina Candolin, and Hannu H. Kari. Multicast source authentication for limited devices. WSEAS Transactions on Computers, 4(4), 2005. |
|
|
30 | Misa 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, Applications of Declarative Programming and Knowledge Management, volume 3392 of Lecture Notes in Computer Science, pages 134–148. Springer-Verlag, 2005. |
|
|
29 | Janne Lundberg, Catharina Candolin, and Hannu H. Kari. Multicast source authentication for limited devices. WSEAS Transactions on Computers, 4(4), 2005. |
|
|
28 | Kimmo Varpaaniemi. On stubborn sets in the verification of linear time temporal properties. Formal Methods in System Design, 26(1):45–67, January 2005. © 2005 Springer Science + Business Media, Inc. (Norwell, MA, USA; Dordrecht, The Netherlands; Berlin, Germany). |
|
|
27 | Emilia Oikarinen. CIRC2DLP 1.1 — software for translating parallel circumscription to disjunctive logic programming, 2005. Computer Program. |
|
|
26 | Harri Haanpää. No 17-player triplewhist tournament has nontrivial automorphisms. Journal of Combinatorial Designs, 13:345–348, 2005. |
|
|
25 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence, 44(4):373–399, 2005. |
|
|
24 | Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski, , and Joost Vennekens, editors. 05171 Abstracts Collection – Nonmonotonic Reasoning, Answer Set Programming and Constraints, number 05171 in Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum (IBFI), Schloss Dagstuhl, Germany, 2005. |
|
|
23 | Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Planning as satisfiability: Parallel plans and algorithms for plan search. Technical Report 216, Institute of Computer Science, University of Freiburg, Freiburg, Germany, 2005. |
|
|
22 | Miia Hermelin. Deformation of a Thin Shell Under a Concentrated Load. Licentiate's thesis, Helsinki University of Technology, 2005. |
|
|
21 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä. SAT benchmarks based on 3-regular graphs, 2005. SAT Competition 2005 benchmark description. Benchmark set available at http://www.tcs.hut.fi/%7Emjj/benchmarks/. SAT Competition 2005 results available through http://www.satcompetition.org/2005/. |
|
|
20 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Lifetime maximization for multicasting in energy-constrained wireless networks. IEEE Journal on Selected Areas in Communications, 23(1):117–126, January 2005. |
|
|
19 | Pekka Orponen and Satu Elisa Schaeffer. Local clustering of large graphs by approximate Fiedler vectors. In S. Nikoletseas, editor, Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA'05, Santorini, Greece, May 2005), volume 3503 of Lecture Notes in Computer Science, pages 524–533, Berlin Heidelberg, 2005. Springer-Verlag. |
|
|
18 | Sakari Seitz, Mikko Alava, and Pekka Orponen. Threshold behaviour of WalkSAT and focused Metropolis search on random 3-satisfiability. In F. Bacchus and T. Walsh, editors, Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing (SAT'05, St. Andrews, Scotland, June 2005), volume 3569 of Lecture Notes in Computer Science, pages 475–481, Berlin Heidelberg, 2005. Springer-Verlag. |
|
|
17 | Petteri Kaski and Patric R. J. Östergård. One-factorizations of regular graphs of order 12. Electronic Journal of Combinatorics, 12:R2, 2005. |
|
|
16 | Petteri Kaski. Isomorph-free exhaustive generation of designs with prescribed groups of automorphisms. SIAM Journal on Discrete Mathematics, 19(3):664–690, 2005. |
|
|
15 | Petteri Kaski. Nonexistence of perfect Steiner triple systems of orders 19 and 21. Bayreuther Mathematische Schriften, 74:130–135, 2005. Proceedings of ALCOMA05, April 3–10, Thurnau, Germany. |
|
|
14 | Satu Elisa Schaeffer. Stochastic local clustering for massive graphs. In T. B. Ho, D. Cheung, and H. Liu, editors, Proceedings of the Ninth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-05), volume 3518 of Lecture Notes in Computer Science, pages 354–360, Berlin Heidelberg, Germany, 2005. Springer-Verlag GmbH. |
|
|
13 | Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. Private itemset support counting.. In Sihan Qing, Wenbo Mao, Javier Lopez, and Guilin Wang, editors, Information and Communications Security, 7th International Conference, ICICS 2005, Beijing, China, December 10-13, 2005, Proceedings, volume 3783 of Lecture Notes in Computer Science, pages 97–111. Springer, 2005. |
|
|
12 | Sven Laur and Helger Lipmaa. Additive conditional disclosure of secrets and applications. Cryptology ePrint Archive, Report 2005/378, 2005. Techical report. |
|
|
11 | Sven Laur, N. Asokan, and Kaisa Nyberg. Efficient mutual data authentication using manually authenticated strings: Preliminary version. Cryptology ePrint Archive, Report 2005/424, 2005. Shorter more compact version was published at CANS 2006. |
|
|
10 | Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple is better: Efficient bounded model checking for past LTL. In Radhia Cousot, editor, Verification, Model Checking and Abstract Interpretation 2005, 6th International Conference VMCAI'05, Paris, France, volume 3385 of Lecture Notes in Computer Science, pages 380–395. Springer, January 2005. |
|
|
9 | Tommi Junttila. Nusmv-2.2.3-cav2005. Computer program, 2005. |
|
|
8 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, and Roberto Sebastiani. An incremental and layered procedure for the satisfiability of linear arithmetic logic. In Nicolas Halbwachs and Lenore D. Zuck, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2005), volume 3440 of Lecture Notes in Computer Science, pages 317–333. Springer, 2005. |
|
|
7 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Silvio Ranise, Peter van Rossum, and Roberto Sebastiani. Efficient satisfiability modulo theories via delayed theory combination. In Kousha Etessami and Sriram K. Rajamani, editors, CAV 2005, volume 3576 of Lecture Notes in Computer Science, pages 335–349. Springer, 2005. |
|
|
6 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, and Roberto Sebastiani. The MathSAT 3 system. In Robert Nieuwenhuis, editor, Automated Deduction – CADE-20, volume 3632 of Lecture Notes in Artificial Intelligence, pages 315–321. Springer, 2005. |
|
|
5 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, and Roberto Sebastiani. MathSAT: Tight integration of SAT and mathematical decision procedures. In Enrico Giunchiglia and Toby Walsh, editors, SAT 2005; Satisfiability Research in the Year 2005, pages 265–293. Springer, 2005. Reprint of the same article in the number 1-3 of volume 25 of the Journal of Automated Reasoning, 2005. |
|
|
4 | Toni Jussila, Keijo Heljanko, and Ilkka Niemelä. BMC via on-the-fly determinization. International Journal on Software Tools for Technology Transfer, 7(2):89 – 101, 2005. |
|
|
3 | Ville Nuorvala and Antti Tuominen. MIPL Mobile IPv6 for Linux, version 2.0 rc3, 2005. |
|
|
2 | Ville Nuorvala, Henrik Petander, and Antti Tuominen. MIPL Mobile IPv6 for Linux, version 2.0 rc2, 2005. |
|
|
1 | Ville Nuorvala. NEPL NEmo Platform for Linux, version 0.1, 2005. |
|
