to appear |
|
902 | Joo Yeon Cho. Linear cryptanalysis of reduced-round PRESENT. In Topics in Cryptology - CT-RSA 2010, The Cryptographers' Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Springer, to appear. |
|
|
901 | Joo Yeon Cho and Miia Hermelin. Improved linear cryptanalysis of SOSEMANUK. In The 12th International Conference on Information Security and Cryptology 2009, ICISC '09, Seoul, Korea, Lecture Notes in Computer Science, to appear. |
|
|
900 | Kimmo Järvinen, Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. Embedded SFE: Offloading server and network using hardware tokens. In Proceedings of the 14th International Conference on Financial Cryptography and Data Security, FC'10, to appear. |
|
|
899 | Joo Yeon Cho and Miia Hermelin. Improved linear cryptanalysis of SOSEMANUK. In In The 12th International Conference on Information Security and Cryptology 2009, ICISC '09, Seoul, Korea,. Lecture Notes in Computer Science, to appear. |
|
|
898 | Zahra Ahmadian, Javad Mohajeri, Mahmoud Salmasizadeh, Risto Hakala, and Kaisa Nyberg. A practical distinguisher for the Shannon cipher. Journal of Systems and Software, to appear. |
|
|
897 | Harri Haanpää, André Schumacher, and Pekka Orponen. Distributed algorithms for lifetime maximization in sensor networks via min-max spanning subgraphs. Wireless Networks, to appear. |
|
to apear |
|
896 | María Naya-Plasencia, Andrea Röck, Jean-Philippe Aumasson, Yann Laigle-Chapuy, Gaëtan Leurent, Willi Meier, and Thomas Peyrin. Cryptanalysis of ESSENCE. In Fast Software Encryption - FSE 2010, Lecture Notes in Computer Science. Springer, to apear. |
|
2010 |
|
895 | Billy Bob Brumley and Kimmo U. Järvinen. Conversion algorithms and implementations for Koblitz curve cryptography. IEEE Transactions on Computers, 59(1):81–92, January 2010. |
|
|
894 | Miia Hermelin and Kaisa Nyberg. Dependent linear approximations - the algorithm of Biryukov and others revisited. In J. Pieprzyk, editor, CT-RSA'10, volume 5985 of Lecture Notes in Computer Science, pages 318–333. Springer, 2010. |
|
2009 |
|
893 | Kimmo Järvinen, Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. Embedded SFE: Offloading server and network using hardware tokens. Report 2009/591, Cryptology ePrint Archive, December 2009. Extended version of the paper appearing in FC'10. |
|
|
892 | Kari Kähkönen. Automated test generation for software components. Technical Report TKK-ICS-R26, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, December 2009. |
|
|
891 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Partitioning search spaces of a randomized search. Technical Report TKK-ICS-R22, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, November 2009. |
|
|
890 | María Naya-Plasencia, Andrea Röck, Jean-Philippe Aumasson, Yann Laigle-Chapuy, Gaëtan Leurent, Willi Meier, and Thomas Peyrin. Cryptanalysis of ESSENCE. Report 2009/302, Cryptology ePrint Archive, September 2009. |
|
|
889 | Tomi Janhunen, Ilkka Niemelä, and Mark Sevalnev. Computing stable models via reductions to difference logic. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 5753 of Lecture Notes in Computer Science, pages 142–154, Potsdam, Germany, September 2009. Springer-Verlag. |
|
|
888 | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, and Stefan Woltran. Modularity aspects of disjunctive stable models. Journal of Artificial Intelligence Research, 35:813–857, August 2009. |
|
|
887 | Kim Björkman, Juho Frits, Janne Valkonen, Jussi Lahtinen, Keijo Heljanko, Ilkka Niemelä, and Jari J. Hämäläinen. Verification of safety logic designs by model checking. In Proceedings of the Sixth American Nuclear Society International Topical Meeting on Nuclear Plant Instrumentation, Control, and Human-Machine Interface Technologies NPIC&HMIT 2009, Knoxville, Tennessee, April 2009. |
|
|
886 | Jori Dubrovin. Checking bounded reachability in asynchronous systems by symbolic event tracing. Technical Report TKK-ICS-R14, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, April 2009. |
|
|
885 | Kim Björkman, Juho Frits, Janne Valkonen, Jussi Lahtinen, Keijo Heljanko, Ilkka Niemelä, and Jari J. Hämäläinen. Verification of safety logic designs by model checking. In Proceedings of the Sixth American Nuclear Society International Topical Meeting on Nuclear Plant Instrumentation, Control, and Human-Machine Interface Technologies NPIC&HMIT 2009, Knoxville, Tennessee, April 2009. |
|
|
884 | Rolf Drechsler, Tommi Junttila, and Ilkka Niemelä. Non-clausal SAT and ATPG. In Armin Biere, Marijn J. H. Heule, Hans van Maaren, and Toby Walsh, editors, Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, chapter 21, pages 655–693. IOS Press, February 2009. |
|
|
883 | Rolf Drechsler, Tommi Junttila, and Ilkka Niemelä. Non-clausal SAT and ATPG. In Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors, Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, chapter 21, pages 655–693. IOS Press, February 2009. |
|
|
882 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Incorporating clause learning in grid-based randomized SAT solving. Journal on Satisfiability, Boolean Modeling and Computation, 6:223–244, 2009. |
|
|
881 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Partitioning search spaces of a randomized search. In AI*IA 2009, volume 5883 of Lecture Notes in Artificial Intelligence, pages 243–252. Springer, 2009. |
|
|
880 | Andrea Röck and Cédric Lauradoux. Parallel generation of l-sequences (extended abstract). In Helena Handschuh, Stefan Lucks, Bart Preneel, and Phillip Rogaway, editors, Symmetric Cryptography, number 09031 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, 2009. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. |
|
|
879 | Billy Bob Brumley and Kaisa Nyberg. On modular decomposition of integers. In Progress in Cryptology—AFRICACRYPT 2009, volume 5580 of Lecture Notes in Computer Science, pages 386–402. Springer-Verlag, 2009. |
|
|
878 | Billy Bob Brumley and Risto M. Hakala. Cache-timing template attacks. In Advances in Cryptology—ASIACRYPT 2009, volume 5912 of Lecture Notes in Computer Science, pages 667–684. Springer-Verlag, 2009. |
|
|
877 | Tommi Syrjänen. Logic Programs and Cardinality Constraints: Theory and Practice. Doctoral dissertation, TKK Dissertations in Information and Computer Science TKK-ICS-D12, Helsinki University of Technology, Faculty of Information and Natural Sciences, Department of Information and Computer Science, Espoo, Finland, 2009. |
|
|
876 | Antti E.J. Hyvärinen. Approaches to Grid-Based SAT Solving. Licentiate's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2009. |
|
|
875 | Emilia Oikarinen and Tomi Janhunen. A translation-based approach to the verification of modular equivalence. Journal of Logic and Computation, 19(4):591–613, 2009. |
|
|
874 | Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä. A module-based framework for multi-language constraint modeling. In Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2009), 2009. |
|
|
873 | Emilia Oikarinen and Matti Järvisalo. Max-ASP: Maximum satisfiability of answer set programs. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), volume 5753 of Lecture Notes in Artificial Intelligence, pages 236–249. Springer, 2009. |
|
|
872 | Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä. A module-based framework for multi-language constraint modeling. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), volume 5753 of Lecture Notes in Artificial Intelligence, pages 155–169. Springer, 2009. |
|
|
871 | Harri Haanpää, André Schumacher, and Pekka Orponen. Distributed algorithms for lifetime maximization in sensor networks via min-max spanning subgraphs. Wireless Networks, 2009. To appear. |
|
|
870 | Kim Björkmann, Juho Frits, Janne Valkonen, Keijo Heljanko, and Ilkka Niemelä. Model-based analysis of a stepwise shutdown logic. VTT Working Papers 115, VTT Technical Research Centre of Finland, Espoo, 2009. |
|
|
869 | Janne Valkonen, Matti Koskimies, Kim Björkman, Keijo Heljanko, Ilkka Niemelä, and Jari J. Hämäläinen. Formal verification of safety automation logic designs. In Automaatio XVIII 2009 Seminaari, 2009. |
|
|
868 | Ilkka Niemelä. Integrating answer set programming and satisfiability modulo theories. In Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009, volume 5753 of Lecture Notes in Computer Science, page 3, 2009. |
|
|
867 | Jani Suomalainen, Jukka Valkonen, and N. Asokan. Standards for security associations in personal networks: a comparative analysis. International Journal of Security and Networks (IJSN), 4(1/2):87–100, 2009. |
|
|
866 | Alessandro Cimatti, Jori Dubrovin, Tommi Junttila, and Marco Roveri. Structure-aware computation of predicate abstraction. In Armin Biere and Carl Pixley, editors, Proceedings of the 9th International Conference on Formal Methods in Computer Aided Design (FMCAD'09), pages 9–16. IEEE, 2009. |
|
|
865 | Kim Björkman, Juho Frits, Janne Valkonen, Keijo Heljanko, and Ilkka Niemelä. Model-based analysis of a stepwise shutdown logic. VTT Working Papers 115, VTT Technical Research Centre of Finland, Espoo, 2009. |
|
|
864 | Kimmo U. Järvinen. On repeated squarings in binary fields. In Proceedings of the 16th International Workshop on Selected Areas in Cryptography, SAC 2009, volume 5867 of Lecture Notes in Computer Science, pages 331–349. Springer-Verlag, 2009. |
|
|
863 | Kaisa Nyberg. Methods for Symmetric Key Cryptography and Cryptanalysis. In EWM PhD Summer School, Turku, Finland, June 2009, 2009. |
|
|
862 | René Mayrhofer, Kaisa Nyberg, and Tim Kindberg. Secure Spontaneous Interaction, Special issue, International Journal of Security and Networks Volume 4 Nos. 1/2. Inderscience, 2009. |
|
|
861 | N. Asokan and Kaisa Nyberg. Security associations for wireless devices. In Stefanos Gritzalis, Tom Karygiannis, and Charalabos Skianis, editors, Security and Privacy in Mobile and Wireless Networking. Troubador Publishing Ltd, Leicester, UK, 2009. |
|
|
860 | Kari Kähkönen, Jani Lampinen, Keijo Heljanko, and Ilkka Niemelä. The LIME interface specification language and runtime monitoring tool. In Saddek Bensalem and Doron Peled, editors, RV, volume 5779 of Lecture Notes in Computer Science, pages 93–100, 2009. |
|
|
859 | Miia Hermelin, Joo Yeon Cho, and Kaisa Nyberg. Statistical Tests for Key Recovery Using Multidimensional Extension of Matsui's Algorithm 1. In Helena Handschuh, Stefan Lucks, Bart Preneel, and Phillip Rogaway, editors, Symmetric Cryptography, number 09031 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, 2009. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. |
|
|
858 | Miia Hermelin, Joo Yeon Cho, and Kaisa Nyberg. Multidimensional Extension of Matsui's Algorithm 2. In Orr Dunkelman, editor, Fast Software Encryption 2009, volume 5665 of Lecture Notes in Computer Science, pages 209–227. Springer, 2009. |
|
|
857 | Miia Hermelin, Joo Yeon Cho, and Kaisa Nyberg. Statistical Tests for Key Recovery Using Multidimensional Extension of Matsui's Algorithm 1. EUROCRYPT'09 POSTERSESSION, 2009. |
|
|
856 | Matti Järvisalo. Structure-based satisfiability checking: Analyzing and harnessing the potential. AI Communications, 22(2):117–119, 2009. Thesis summary. |
|
|
855 | Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. Constraints, 14(3):325–356, 2009. |
|
|
854 | Risto Hakala and Kaisa Nyberg. A multidimensional linear distinguishing attack on the Shannon cipher. International Journal of Applied Cryptography, 1(3):161–168, 2009. |
|
|
853 | André Schumacher and Harri Haanpää. Distributed sleep scheduling in wireless sensor networks via fractional domatic partitioning. In R. Guerraoui and F. Petit, editors, Stabilization, Safety, and Security of Distributed Systems, volume 5873/2009 of Lecture Notes in Computer Science, pages 640–654. Springer-Verlag Berlin / Heidelberg, 2009. |
|
|
852 | Sven Laur and Sylvain Pasini. User-aided data authentication. International Journal of Security and Networks, 4(1/2):69–86, 2009. |
|
|
851 | Siert Wieringa, Matti Niemenmaa, and Keijo Heljanko. Tarmo: A framework for parallelized bounded model checking. In Lubos Brim and Jaco van der Pol, editors, Proceedings of the 8th International Workshop on Parallel and Distributed Methods in verifiCation (PDMC'09), volume 14 of Electronic Proceedings in Theoretical Computer Science (EPTCS), pages 62–76, 2009. |
|
|
850 | Tomi Janhunen. lp2diff 1.23 — Translating logic programs into difference logic. http://www.tcs.hut.fi/Software/lp2diff/, 2009. Computer Program. |
|
2008 |
|
849 | Tomi Janhunen. Removing redundancy from answer set programs. In Enrico Pontelli and Maria Garcia de La Banda, editors, Proceedings of the 24th International Conference on Logic Programming, pages 729–733, Udine, Italy, December 2008. Springer-Verlag. LNCS 5366. |
|
|
848 | Tomi Janhunen, Ilkka Niemelä, and Mark Sevalnev. Computing stable models via reductions to boolean circuits and difference logic. In Marc Denecker, editor, Proceedings of the 2nd International Workshop on Logic and Search, pages 16–30, Leuven, Belgium, November 2008. |
|
|
847 | Billy Bob Brumley and Jukka Valkonen. Attacks on message stream encryption. In Hanne Riis Nielson and Christian W. Probst, editors, Proceedings of the 13th Nordic Workshop on Secure IT Systems—NordSec '08, pages 163–173, October 2008. |
|
|
846 | Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, and Pekka Orponen. Circumspect descent prevails in solving random constraint satisfaction problems. Proceedings of the National Academy of Sciences (USA), 105(40):15253–15257, October 2008. |
|
|
845 | Pekka Orponen, Satu Elisa Schaeffer, and Vanesa Avalos Gaytán. Locally computable approximations for spectral clustering and absorption times of random walks. Technical Report cs.DM/0810.4061, arXiv.org, October 2008. |
|
|
844 | Martin Gebser, Tomi Janhunen, Max Ostrowski, Torsten Schaub, and Sven Thiele. A versatile intermediate language for answer set programming. In Maurice Pagnucco and Michael Thielscher, editors, Proceedings of the 12th International Workshop on Nonmonotonic Reasoning, pages 150–159, Sydney, Australia, September 2008. University of New South Wales, School of Computer Science and Engineering, Techical Report, UNSW-CSE-TR-0819. |
|
|
843 | Roland Axelsson, Keijo Heljanko, and Martin Lange. Analyzing context-free grammars using an incremental SAT solver. In Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, and Igor Walukiewicz, editors, Proceedings of the 35th International Colloquium on Automata, Languages, and Programming (ICALP'08), Part II, volume 5126 of Lecture Notes in Computer Science, pages 410–422, Reykjavik, Iceland, July 2008. Springer-Verlag. |
|
|
842 | Tomi Janhunen. Modular equivalence in general. In Malik Ghallab, Constantine Spyropoulos, Nikos Fakotakis, and Nikos Avouris, editors, Proceedings of the 18th European Conference on Artificial Intelligence, pages 75–79, Patras, Greece, July 2008. IOS Press. |
|
|
841 | Matti Koskimies. Applying model checking to analysing safety instrumented systems. Research Report TKK-ICS-R5, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, June 2008. |
|
|
840 | Jani Lampinen. Interface specification methods for software components. Research Report TKK-ICS-R4, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, June 2008. |
|
|
839 | Jussi Lahtinen. Model checking timed safety instrumented systems. Research Report TKK-ICS-R3, Helsinki University of Technology, Department of Information and Computer Science, Espoo, Finland, June 2008. |
|
|
838 | Janne Valkonen, Matti Koskimies, Ville Pettersson, Keijo Heljanko, Jan-Erik Holmberg, Ilkka Niemelä, and Jari J. Hämäläinen. Formal verification of safety I&C system designs: Two nuclear power plant related applications. In Enlarged Halden Programme Group Meeting – Proceedings of the Man-Technology-Organisation Sessions, page C4.2, Loen, Norway, May 2008. Institutt for Energiteknikk, Halden, Norway. |
|
|
837 | Janne Valkonen, Ilkka Karanta, Matti Koskimies, Keijo Heljanko, Ilkka Niemelä, Dan Sheridan, and Robin E. Bloomfield. NPP safety automation systems analysis – State of the art. VTT Working Papers 94, VTT Technical Research Centre of Finland, Espoo, Finland, April 2008. |
|
|
836 | Javier Esparza and Keijo Heljanko. Unfoldings – A Partial-Order Approach to Model Checking. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, March 2008. |
|
|
835 | Joo Yeon Cho. An improved estimate of the correlation of distinguisher for Dragon. In SASC 2008 - The State of the Art of Stream Ciphers, Lausanne, Switzerland, February 13-14, 2008, pages 11–20, February 2008. |
|
|
834 | Janne Valkonen, Ville Petterson, Kim Björkman, Jan-Erik Holmberg, Matti Koskimies, Keijo Heljanko, and Ilkka Niemelä. Model-based analysis of an arc protection and an emergency cooling system – MODSAFE 2007 working report. VTT Working Papers 93, VTT Technical Research Centre of Finland, Espoo, Finland, February 2008. |
|
|
833 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Strategies for solving SAT in Grids by randomized search. In Serge Autexier, John Campbell, Julio Rubio, Volker Sorge, Masakazu Suzuki, and Freek Wiedijk, editors, AISC 2008, volume 5144 of Lecture Notes in Artificial Intelligence, pages 125–140. Springer, 2008. |
|
|
832 | Mikko Juhani Pitkanen, Xin Zhou, Antti E. J. Hyvärinen, and Henning Müller. Using the Grid for enhancing the performance of a medical image search engine. In Proceedings of the The Tewnty-First IEEE International Symposium on Computer-Based Medical Systems, June 17-19, 2008, Jyväskylä, Finland, pages 367–372. IEEE, 2008. |
|
|
831 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Incorporating learning in grid-based randomized sat solving. In Daniel Dochev, Marco Pistore, and Paolo Traverso, editors, AIMSA 2008, volume 5253 of Lecture Notes in Artificial Intelligence, pages 247–261. Springer, 2008. |
|
|
830 | Andrea Röck. Entropy of the internal state of an FCSR in Galois representation. In Kaisa Nyberg, editor, Fast Software Encryption - FSE 2008, volume 5086 of Lecture Notes in Computer Science, pages 343–362. Springer, 2008. |
|
|
829 | Andrea Röck. Stream ciphers using a random update function: Study of the entropy of the inner state. In Serge Vaudenay, editor, First International Conference on Cryptology in Africa - AFRICACRYPT 2008, volume 5023 of Lecture Notes in Computer Science, pages 258–275. Springer, 2008. |
|
|
828 | Cédric Lauradoux and Andrea Röck. Parallel generation of l-sequences. In Solomon W. Golomb, Matthew G. Parker, Alexander Pott, and Arne Winterhof, editors, Sequences and Their Applications - SETA 2008, volume 5203 of Lecture Notes in Computer Science, pages 299–312. Springer, 2008. |
|
|
827 | Billy Bob Brumley and Kimmo U. Järvinen. Fast point decompression for standard elliptic curves. In Public Key Infrastructure, 5th European PKI Workshop: Theory and Practice—EuroPKI '08, volume 5057 of Lecture Notes in Computer Science, pages 134–149. Springer-Verlag, 2008. |
|
|
826 | Billy Bob Brumley. Implementing cryptography for packet level authentication. In Proceedings of the 2008 International Conference on Security & Management—SAM '08, pages 475–480. CSREA Press, 2008. Special track on Applied Cryptology and Network Security. |
|
|
825 | Harri Haanpää, editor. Annual report for the year 2007. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, 2008. |
|
|
824 | Matti Järvisalo. Structure-Based Satisfiability Checking: Analyzing and Harnessing the Potential. Doctoral dissertation, TKK Dissertations in Information and Computer Science TKK-ICS-D10, Helsinki University of Technology, Faculty of Information and Natural Sciences, Department of Information and Computer Science, Espoo, Finland, 2008. |
|
|
823 | Emilia Oikarinen. Modularity in Answer Set Programs. Doctoral dissertation, TKK Dissertations in Information and Computer Science TKK-ICS-D7, Helsinki University of Technology, Faculty of Information and Natural Sciences, Department of Information and Computer Science, Espoo, Finland, 2008. |
|
|
822 | Sven Laur. Cryptographic Protocol Design. Doctoral dissertation, TKK Dissertations in Information and Computer Science TKK-ICS-D2, Helsinki University of Technology, Faculty of Information and Natural Sciences, Department of Information and Computer Science, Espoo, Finland, 2008. |
|
|
821 | Dmitrij Lagutin. Redesigning Internet—The Packet Level Authentication Architecture. Licentiate's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
820 | Vesa Ojala. Counterexample analysis for automated refinement of data abstracted state machine models. Master's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
819 | Kari Kähkönen. Automated dynamic test generation for sequential Java programs. Master's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
818 | Jussi Lahtinen. Model checking timed safety instrumented systems. Master's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
817 | Jani Lampinen. Interface specification methods for software components. Master's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
816 | Matti Koskimies. Applying model checking to analysing safety instrumented systems. Master's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
815 | Aleksi Hänninen. Boolean satisfiability problem and cryptography. Master's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
814 | Perttu Halonen. Tiedonlouhinnan käyttö tietoturvan tarkkailussa. Master's thesis, Helsinki University of Technology, Department of Information and Computer Science, 2008. |
|
|
813 | Sven Laur and Sylvain Pasini. SAS-based group authentication and key agreement protocols. In Ronald Cramer, editor, Public Key Cryptography - PKC 2008, 11th International Workshop on Practice and Theory in Public-Key Cryptography, Barcelona, Spain, March 9-12, 2008. Proceedings, volume 4939 of Lecture Notes in Computer Science, pages 197–213. Springer, 2008. |
|
|
812 | Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, and Seif Haridi. An analytical study of a structured overlay in the presence of dynamic membership. IEEE/ACM Transactions on Networking, 16:814–825, 2008. |
|
|
811 | Emilia Oikarinen and Tomi Janhunen. Implementing prioritized circumscription by computing disjunctive stable models. In Danail Dochev, Marco Pistore, and Paolo Traverso, editors, Artificial Intelligence: Methodology, Systems, and Applications, 13th International Conference, AIMSA 2008, Varna, Bulgaria, September 2008 Proceedings, volume 5223 of Lecture Notes in Artificial Intelligence, pages 167–180. Springer, 2008. |
|
|
810 | Emilia Oikarinen and Tomi Janhunen. Achieving compositionality of the stable model semantics for smodels programs. Theory and Practice of Logic Programming, 8(5–6):717–761, 2008. |
|
|
809 | Harri Haanpää, Patric Östergård, and Sándor Szabó. Small  -groups with full-rank factorization. International Journal of Algebra and Computation, 18(6):1019–1034, 2008. |
|
|
808 | Victor Marek, Ilkka Niemelä, and Mirosław Truszczyński. Programs with monotone abstract constraint atoms. Theory and Practice of Logic Programming, 8(2):167–199, 2008. |
|
|
807 | Gerhard Brewka, Ilkka Niemelä, and Mirosl aw Truszczyński. Nonmonotonic reasoning. In Frank van Harmelen, Vladimir Lifschitz, and Bruce Porter, editors, Handbook of Knowledge Representation, chapter 6, pages 239–284. Elsevier Science, Amsterdam, 2008. |
|
|
806 | Janne Valkonen, Ville Pettersson, Kim Björkman, Jan-Erik Holmberg, Matti Koskimies, Keijo Heljanko, and Ilkka Niemelä. Model-based analysis of an arc protection and an emergency cooling system. VTT Working Papers 93, VTT Technical Research Centre of Finland, Espoo, 2008. |
|
|
805 | Janne Valkonen, Ilkka Karanta, Matti Koskimies, Keijo Heljanko, Ilkka Niemelä, Dan Sheridan, and Robing E. Bloomfield. NPP safety automation systems analysis: State of the art. VTT Working Papers 94, VTT Technical Research Centre of Finland, Espoo, 2008. |
|
|
804 | Ilkka Niemelä. Answer set programming without unstratified negation. In Proceedings of the 24th International Conference on Logic Programming (ICLP 2008), volume 5366 of Lecture Notes in Computer Science, pages 88–92. Springer, 2008. |
|
|
803 | Ilkka Niemelä. Stable models and difference logic. In Proceedings of the Tenth International Symposium on Artificial Intelligence and Mathematics, page 5 p., 2008. The proceedings available at http://isaim2008.unl.edu/index.php?page=proceedings. |
|
|
802 | Gerd Brewka, Ilkka Niemelä, and Mirosław Truszczyński. Preferences and nonmonotonic reasoning. AI Magazine, 29(4):69–78, 2008. |
|
|
801 | Ilkka Niemelä. Stable models and difference logic. Annals of Mathematics and Artificial Intelligence, 53(1–4):313–329, 2008. |
|
|
800 | Jukka Valkonen and Kaisa Nyberg. Uudet salausmenetelmät parantavat yksityisyydensuojaa. Tietosuoja, 4:24–27, 2008. In Finnish. |
|
|
799 | Joo Yeon Cho, Miia Hermelin, and Kaisa Nyberg. A new technique for multidimensional linear cryptanalysis with applications on reduced round Serpent. In The 11th International Conference on Information Security and Cryptology 2008, ICISC '08, Seoul, Korea, volume 5461 of Lecture Notes in Computer Science, pages 383 – 398, 2008. |
|
|
798 | Jori Dubrovin, Tommi Junttila, and Keijo Heljanko. Symbolic step encodings for object based communicating state machines. In Gilles Barthe and Frank S. de Boer, editors, Proceedings of the 10th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS'08), volume 5051 of Lecture Notes in Computer Science, pages 96–112. Springer, 2008. |
|
|
797 | Jori Dubrovin and Tommi Junttila. Symbolic model checking of hierarchical UML state machines. In Jonathan Billington, Zhenhua Duan, and Maciej Koutny, editors, Proceedings of the 8th International Conference on Application of Concurrency to System Design (ACSD'08), pages 108–117. IEEE Press, 2008. |
|
|
796 | Aleksi Saarela, Jan-Erik Ekberg, and Kaisa Nyberg. Random beacon for privacy and group security. In IEEE International Conference on Wireless and Mobile Computing, Networking and Communications WIMOB 08, pages 514–519. IEEE, 2008. |
|
|
795 | Kaisa Nyberg, editor. Fast Software Encryption, 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers, volume 5086 of Lecture Notes in Computer Science. Springer, 2008. |
|
|
794 | Miia Hermelin, Joo Yeon Cho, and Kaisa Nyberg. Multidimensional Linear Cryptanalysis of Reduced Round Serpent. In Yi Mu, Willy Susilo, and Jennifer Seberry, editors, Information Security and Privacy, 13th Australasian Conference, ACISP 2008 Wollongong, Australia, July 7-9, 2008, Proceedings, volume 5107 of LNCS, pages 203–215. Springer, 2008. |
|
|
793 | Matti Järvisalo and Emilia Oikarinen. Extended ASP tableaux and rule redundancy in normal logic programs. Theory and Practice of Logic Programming, 8(5–6):691–716, 2008. |
|
|
792 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Justification-based local search with adaptive noise strategies. In Iliano Cervesato, Helmut Veith, and Andrei Voronkov, editors, Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'08), volume 5330 of Lecture Notes in Computer Science, pages 31–46. Springer, 2008. |
|
|
791 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Justification-based local search with adaptive noise strategies. In Proceedings of the 2nd International Workshop on Logic and Search: Computation of structures from declarative descriptions (LaSh'08), pages 111–125. KU Leuven, 2008. |
|
|
790 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Justification-based non-clausal local search for SAT. In Malik Ghallab, Constantine D. Spyropoulos, Nikos Fanotakis, and Nikos Avoukis, editors, Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), volume 178 of Frontiers in Artificial Intelligence and Applications, pages 535–539. IOS Press, 2008. |
|
|
789 | Matti Järvisalo and Tommi Junttila. On the power of top-down branching heuristics. In Dieter Fox and Carla P. Gomes, editors, Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-08), pages 304–309. AAAI Press, 2008. |
|
|
788 | Matti Järvisalo and Ilkka Niemelä. The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. Journal of Algorithms, 63(1–3):90–113, 2008. |
|
|
787 | Petteri Kaski, Patric R. J. Östergård, Svetlana Topalova, and Rosen Zlatarski. Steiner triple systems of order 19 and 21 with subsystems of order 7. Discrete Mathematics, 308(13):2732–2741, 2008. |
|
|
786 | Risto Hakala and Kaisa Nyberg. Linear distinguishing attack on Shannon. In Yi Mu, Willy Susilo, and Jennifer Seberry, editors, Information Security and Privacy, 13th Australasian Conference, ACISP 2008, Wollongong, Australia, July 7–9, 2008, Proceedings, volume 5107 of Lecture Notes in Computer Science, pages 297–305. Springer, 2008. |
|
|
785 | Miki Sirola, Jukka Parviainen, Jaakko Talonen, Golan Lampi, Tuomas Alhonnoro, and Risto Hakala. Early fault detection with SOM based methods and visualizations – new contents for wide monitoring screens. In EHPG-Meeting of OECD Halden Reactor Project, 2008. |
|
|
784 | Shreyas Prasad, André Schumacher, Harri Haanpää, and Pekka Orponen. Balanced multipath source routing. In T. Vazão, M.M. Freire, and I. Chong, editors, Proceedings of the 21st International Conference on Information Networking (ICOIN'07), volume 5200/2008 of Lecture Notes in Computer Science, pages 315–324, Berlin Heidelberg, 2008. Springer-Verlag. |
|
|
783 | André Schumacher and Harri Haanpää. Distributed network utility maximization in wireless networks with a bounded number of paths. In Proceedings of The 3rd ACM Workshop on Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks (PM HWN 2008), pages 96–103, New York, NY, USA, 2008. ACM. |
|
|
782 | André Schumacher, Pekka Orponen, Thorn Thaler, and Harri Haanpää. Lifetime maximization in wireless sensor networks by distributed binary search. In Roberto Verdone, editor, Proceedings of The 5th European Conference on Wireless Sensor Networks (EWSN 2008), volume 4913/2008 of Lecture Notes in Computer Science, pages 237–252, Berlin / Heidelberg, 2008. Springer-Verlag. |
|
|
781 | Sven Laur and Sylvain Pasini. Sas-based group authentication and key agreement protocols. In Public Key Cryptography - PKC 2008, 11th International Workshop on Practice and Theory in Public-Key Cryptography, Barcelona, Spain, March 9-12, 2008, volume 4939 of Lecture Notes in Computer Science, pages 197–213. Springer, 2008. |
|
|
780 | Sven Laur. Cryptographic Protocol Design. Doctoral dissertation, Helsinki University of Technology, 2008. TKK Dissertations in Information and Computer Science, TKK-ISC-D2. |
|
|
779 | Hans van Maaren and Siert Wieringa. Finding guaranteed MUSes fast. In Hans Kleine Büning and Xishun Zhao, editors, Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings, volume 4996 of Lecture Notes in Computer Science, pages 291–304, 2008. |
|
|
778 | Tommi Junttila and Jori Dubrovin. Encoding queues in satisfiability modulo theories based bounded model checking. In Iliano Cervesato, Helmut Veith, and Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'08), volume 5330 of Lecture Notes in Artificial Intelligence, pages 290–304. Springer, 2008. |
|
2007 |
|
777 | Henrik Petander. A network mobility management architecture for a heterogeneous network environment. Research Report A108, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007. Doctoral dissertation. ISBN 978-951-22-9098-7. |
|
|
776 | Maarit Hietalahti, Mikko Särelä, Antti Tuominen, and Pekka Orponen. Security topics and mobility management in hierarchical ad hoc networks (Samoyed): Final report. Technical Report B22, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007. |
|
|
775 | Jori Dubrovin and Tommi Junttila. Symbolic model checking of hierarchical UML state machines. Technical Report B23, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007. |
|
|
774 | Jori Dubrovin, Tommi Junttila, and Keijo Heljanko. Symbolic step encodings for object based communicating state machines. Technical Report B24, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007. |
|
|
773 | Vesa Ojala. A slicer for UML state machines. Technical Report B25, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2007. |
|
|
772 | Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, Pekka Orponen, and Sakari Seitz. Circumspect descent prevails in solving random constraint satisfaction problems. Technical Report 0711.4902, arXiv.org, November 2007. |
|
|
771 | Tomi Janhunen and Emilia Oikarinen. Automated verification of weak equivalence within the smodels system. Theory and Practice of Logic Programming, 7(6):697–744, November 2007. |
|
|
770 | Dmitrij Lagutin and Hannu H. Kari. Controlling incoming connections using certificates and distributed hash tables. In Proceedins of The 7th International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN 2007), volume 4712 of Lecture Notes in Computer Science, pages 455–467, St. Petersburg, Russia, Sep 2007. Springer-Verlag. |
|
|
769 | Emilia Oikarinen and Tomi Janhunen. A linear transformation from prioritized circumscription to disjunctive logic programming. In Verónica Dahl and Ilkka Niemelä, editors, Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), volume 4670 of Lecture Notes in Computer Science, pages 440–441, Porto, Portugal, September 2007. Springer. Poster. |
|
|
768 | Emilia Oikarinen. Modular answer set programming. In Verónica Dahl and Ilkka Niemelä, editors, Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), volume 4670 of Lecture Notes in Computer Science, pages 462–463, Porto, Portugal, September 2007. Springer. Doctoral Consortium research summary. |
|
|
767 | Emilia Oikarinen and Tomi Janhunen. A translation-based approach to the verification of modular equivalence. In Stefania Costantini and Richard Watson, editors, Proceedings of the 4th Workshop on Answer Set Programming; Advances in Theory and Implementation (ASP 2007), pages 255–269, Porto, Portugal, September 2007. |
|
|
766 | Matti Järvisalo. Impact of restricted branching on clause learning SAT solving. Research Report A107, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2007. ISBN 978-951-22-8907-3. |
|
|
765 | Emilia Oikarinen. Modularity in smodels programs. In Chitta Baral, Gerhard Brewka, and John Schlipf, editors, Logic Programming and Nonmonotonic Reasoning, 9th International Conference on Logic Programming and Nonmonotonic Reasoning LPNMR 2007, Tempe, AZ, USA, May 2007, Proceedings, volume 4483 of Lecture Notes in Artificial Intelligence, pages 321–326, Tempe, Arizona, USA, May 2007. Springer-Verlag. Poster. |
|
|
764 | Emilia Oikarinen. Modular answer set programming. In Veli Mäkinen, Greger Lindén, and Hannu Toivonen, editors, Summer School on Algorithmic Data Analysis (SADA 2007) and Annual Hecse Poster Session. Poster Abstracts, Series of Publications B, Report B-2007-4, page 62. Helsinki University Printing House, May 2007. |
|
|
763 | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, and Stefan Woltran. Modularity aspects of disjunctive stable models. In Chitta Baral, Gerhard Brewka, and John Schlipf, editors, Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 175–187, Tempe, Arizona, USA, May 2007. Springer-Verlag. |
|
|
762 | Tomi Janhunen. Intermediate languages of ASP systems and tools. In Marina De Vos and Torsten Schaub, editors, Proceedings of the 1st International Workshop on Software Engineering for Answer Set Programming, number CSBU-2007-05 in Deparment of Computer Science, University of Bath, Technical Report Series, pages 12–25, Tempe, Arizona, USA, May 2007. |
|
|
761 | Emilia Oikarinen. circ2dlp 2.1 — a linear translation from prioritized circumscription to disjunctive logic programming, April 2007. Computer Program. |
|
|
760 | Billy Bob Brumley and Kaisa Nyberg. Differential properties of elliptic curves and blind signatures. In Information Security, 10th International Conference—ISC '07, volume 4779 of Lecture Notes in Computer Science, pages 376–389. Springer-Verlag, 2007. |
|
|
759 | Billy Bob Brumley and Kimmo Järvinen. Koblitz curves and integer equivalents of Frobenius expansions. In Selected Areas in Cryptography, 14th International Workshop—SAC '07, volume 4876 of Lecture Notes in Computer Science, pages 126–137. Springer-Verlag, 2007. |
|
|
758 | Harri Haanpää, editor. Annual report for the year 2006. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, 2007. |
|
|
757 | Matti Järvisalo. Impact of Restricted Branching on Clause Learning SAT Solving. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2007. |
|
|
756 | Maarit Hietalahti. Requirements for a security architecture for clustered ad-hoc networks. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2007. |
|
|
755 | Sami Kauppinen. Trust evaluation in component-based software architecture. Master's thesis, Helsinki University of Technology, Department of Computer Scienceand Engineering, Laboratory for Theoretical Computer Science, 2007. |
|
|
754 | Risto Hakala. Linear cryptanalysis of two stream ciphers. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2007. |
|
|
753 | Samuli Larvala. Differential compression for efficient software updating. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2007. |
|
|
752 | Antti J. Tuominen. Managing global connectivity with IPv6 in heterogeneous mobility scenarios. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2007. |
|
|
751 | Janne Lundberg. A proof of concept PLA implementation, 2007. Computer program. |
|
|
750 | Sven Laur and Helger Lipmaa. A new protocol for conditional disclosure of secrets and its applications. In Jonathan Katz and Moti Yung, editors, Applied Cryptography and Network Security, 5th International Conference, ACNS 2007, Zhuhai, China, June 5-8, 2007, Proceedings, volume 4521 of Lecture Notes in Computer Science, pages 207–225. Springer, 2007. |
|
|
749 | Ahto Buldas and Sven Laur. Knowledge-binding commitments with applications in time-stamping. In Tatsuaki Okamoto and Xiaoyun Wang, editors, Public Key Cryptography - PKC 2007, 10th International Conference on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16-20, 2007, Proceedings, volume 4450 of Lecture Notes in Computer Science, pages 150–165. Springer, 2007. |
|
|
748 | Maarit Hietalahti. A clustering-based group key agreement protocol for ad-hoc networks. In 3rd Workshop on Cryptography for Ad hoc Networks (WCAN 2007), July 8th, 2007, Wroclaw, Poland, 2007. |
|
|
747 | Philippe Dumas, Helger Lipmaa, and Johan Wallén. Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation. Discrete Mathematics and Theoretical Computer Science, 9(1):247–274, 2007. |
|
|
746 | Jukka Honkola, Sari Leppänen, Pasi Rinne-Rahkola, Martti Söderlund, Markku Turunen, and Kimmo Varpaaniemi. Applying Lyra in modeling S60 camera functionality. In John Leaney, Jerzy W. Rozenblit, and Jianfeng Peng, editors, Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, ECBS 2007, Raising Expectations of Computer-Based Systems, pages 25–36. IEEE Computer Society Press, 2007. |
|
|
745 | Harri Haanpää and Patric R. J. Östergård. Sets in Abelian groups with distinct sums of pairs. Journal of Number Theory, 123:144–153, 2007. |
|
|
744 | Harri Haanpää, André Schumacher, Thorn Thaler, and Pekka Orponen. Distributed computation of maximum lifetime spanning subgraphs in sensor networks. In Hongke Zhang, Stephan Olariu, Jiannong Cao, and David B. Johnson, editors, Proceedings of The 3rd International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2007), volume 4864 of Lecture Notes in Computer Science, pages 445–456, Berlin / Heidelberg, 2007. Springer. |
|
|
743 | Verónica Dahl and Ilkka Niemelä, editors. Logic Programming, 23rd International Conference, ICLP 2007, Porto, Portugal, September 8-13, 2007, Proceedings, volume 4670 of Lecture Notes in Computer Science. Springer, 2007. |
|
|
742 | Jani Suomalainen, Jukka Valkonen, and N. Asokan. Security Associations in Personal Networks: A Comparative Analysis. In Frank Stajano, Catherine Meadows, Srdjan Capkun, and Tyler Moore, editors, Security and Privacy in Ad-hoc and Sensor Networks 4th European Workshop, ESAS 2007, Cambridge, UK, July 2-3, 2007, number 4572 in Lecture Notes in Computer Science, pages 43–57, 2007. |
|
|
741 | Kaisa Nyberg and Jukka Valkonen. Wireless Group Security Using MAC Layer Multicast. In World of Wireless, Mobile and Multimedia Networks, 2007. WoWMoM 2007. IEEE International Symposium on a, pages 1–8, 2007. |
|
|
740 | Jukka Valkonen, Aleksi Toivonen, and Kristiina Karvonen. Usability Testing for Secure Device Pairing in Home Networks. In Anne Bajart, Henrik Muller, and Thomas Strang, editors, UbiComp 2007 Workshop Proceedings, September 2007, Innsbruck, Austria, 2007. |
|
|
739 | Jori Dubrovin. SMUML/Suboco 1.10 — an SMT-based UML bounded model checker, 2007. Computer program. |
|
|
738 | Jori Dubrovin. SMUML/Uboco 1.10 — a translator from UML models to NuSMV programs, 2007. Computer program. |
|
|
737 | Kaisa Nyberg and Risto Hakala. A key-recovery attack on SOBER-128. In Eli Biham, Helena Handschuh, Stefan Lucks, and Vincent Rijmen, editors, Symmetric Cryptography, number 07021 in Dagstuhl Seminar Proceedings. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007. |
|
|
736 | Kaisa Nyberg and Miia Hermelin. Multidimensional Walsh transform and a characterization of bent functions. In Tor Helleseth, P. Vijay Kumar, and Oyvind Ytrehus, editors, Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, pages 83–86. IEEE, 2007. |
|
|
735 | Matti Järvisalo. Restricted branching in clause learning DPLL. In Brahim Hnich and Kostas Stergiou, editors, Proceedings of the CP 2007 Doctoral Program, pages 55–60, 2007. |
|
|
734 | Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. In Christian Bessiere, editor, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), volume 4741 of Lecture Notes in Computer Science, pages 348–363. Springer, 2007. |
|
|
733 | Matti Järvisalo. Equivalence checking hardware multiplier designs, 2007. SAT Competition 2007 benchmark description. Available at http://www.satcompetition.org/2007/contestants.html. |
|
|
732 | Matti Järvisalo. The effect of structural branching on the efficiency of clause learning SAT solving. In 14th RCRA Workshop: Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2007. See http://pst.istc.cnr.it/RCRA07/program.html. |
|
|
731 | Matti Järvisalo. Industrial-strength SAT solving and restricted branching. In Veli Mäkinen, Greger Lindén, and Hannu Toivonen, editors, Summer School on Algorithmic Data Analysis (SADA 2007) and Annual Hecse Poster Session. Abstract proceedings, Series of Publications B, Report B-2007-4, page 39. Helsinki University Printing House, 2007. |
|
|
730 | Matti Järvisalo and Emilia Oikarinen. Extended ASP tableaux and rule redundancy in normal logic programs. In Verónica Dahl and Ilkka Niemelä, editors, Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), volume 4670 of Lecture Notes in Computer Science, pages 134–148. Springer, 2007. |
|
|
729 | Pekka Orponen. "P = NP" -ongelma ja laskennan vaativuusteoria. Tietojenkäsittelytiede, 26:54–67, 2007. |
|
|
728 | Satu Elisa Schaeffer. Graph clustering. Computer Science Review, 1(1):27–64, 2007. |
|
|
727 | Ahto Buldas and Sven Laur. Knowledge-binding commitments with applications in time-stamping. In Public Key Cryptography - PKC 2007, 10th International Conferenc on Practice and Theory in Public-Key Cryptography, Beijing, China, April 16-20, 2007, volume 4450 of Lecture Notes in Computer Science, pages 150–165. Springer, 2007. |
|
|
726 | Sven Laur and Helger Lipmaa. A new protocol for conditional disclosure of secrets and its applications. In Applied Cryptography and Network Security, 5th International Conference, ACNS 2007, Zhuhai, China, June 5-8, 2007, volume 4521 of Lecture Notes in Computer Science, pages 207–225. Springer, 2007. |
|
|
725 | Yaniv Eytani and Timo Latvala. Explaining intermittent concurrent bugs by minimizing scheduling noise. In Eyal Bin, Avi Ziv, and Shmuel Ur, editors, Proceedings of the Second Haifa Verification Conference (HVC 2006), volume 4383 of Lecture Notes in Computer Science, pages 183–197, Haifa, Israel, 2007. Springer-Verlag. |
|
|
724 | Tommi Junttila and Petteri Kaski. Engineering an efficient canonical labeling tool for large and sparse graphs. In David Applegate, Gerth Stølting Brodat, Daniel Panario, and Robert Sedgewick, editors, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics. SIAM, 2007. |
|
|
723 | Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. In Christian Bessiere, editor, Principles and Practice of Constraint Programming – CP 2007, volume 4741 of Lecture Notes in Computer Science, pages 348–363. Springer, 2007. |
|
|
722 | Tommi Junttila. SMUML/proco version 2.00 — a translator from UML models to Promela, 2007. Computer program. |
|
|
721 | Tommi Junttila. PySMT version 0.50 — a Python front-end for satisfiability modulo theories solvers, 2007. Computer program. |
|
|
720 | Tomi Janhunen. asptools 1.0 — A tool collection for answer set programming. http://www.tcs.hut.fi/Software/asptools/, 2007. Computer Program. |
|
|
719 | Tomi Janhunen. lpeq 1.19 — A tool for testing the modular equivalence of logic programs. http://www.tcs.hut.fi/Software/lpeq/, 2007. Computer Program. |
|
|
718 | Vesa Ojala. SMUML/slicer 1.0.0 — a slicer for slicing UML state machines, 2007. Computer program. |
|
|
717 | Vesa Ojala. SMUML/canal 1.0.0 — a counterexample analysator for analyzing abstract counterexamples from data abstracted UML models, 2007. Computer program. |
|
|
716 | Kaisa Nyberg. Kryptologia – tiedon turvaamisen tiede. Tietojenkäsittelytiede, 26:32–53, Heinäkuu 2007. |
|
2006 |
|
715 | Emilia Oikarinen. Modular answer set programming. Research Report A106, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2006. |
|
|
714 | Misa Keinänen. Techniques for solving boolean equation systems. Research Report A105, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2006. Doctoral dissertation. |
|
|
713 | Billy Bob Brumley. Efficient three-term simultaneous elliptic scalar multiplication with applications. In Viiveke Fåk, editor, Proceedings of the 11th Nordic Workshop on Secure IT Systems—NordSec '06, pages 105–116, Linköping, Sweden, October 2006. |
|
|
712 | Harri Haanpää, editor. Annual report for the year 2005. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, October 2006. |
|
|
711 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Silvio Ranise, Peter van Rossum, and Roberto Sebastiani. Efficient theory combination via boolean search. Information and Computation, 204(10):1493–1525, October 2006. |
|
|
710 | Heikki Tauriainen. Automata and linear temporal logic: Translations with transition-based acceptance. Research Report A104, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, September 2006. Doctoral dissertation. |
|
|
709 | Emilia Oikarinen and Tomi Janhunen. Modular equivalence for normal logic programs. In Gerhard Brewka, Silvia Coradeschi, Anna Perini, and Paolo Traverso, editors, Proceedings of the 17th European Conference on Artificial Intelligence, pages 412–416, Riva del Garda, Italy, August 2006. IOS Press. |
|
|
708 | Keijo Heljanko, Tommi Junttila, Misa Keinänen, Martin Lange, and Timo Latvala. Bounded model checking for weak alternating Büchi automata. In Thomas Ball and Robert B. Jones, editors, Proceedings of the 18th International Conference on Computer Aided Verification (CAV'2006), volume 4144 of Lecture Notes in Computer Science, pages 95–108, Seattle, WA, USA, August 2006. Springer-Verlag. |
|
|
707 | Jean Gressmann, Tomi Janhunen, Robert Mercer, Torsten Schaub, Sven Thiele, and Richard Tichy. On probing and multi-threading in platypus. In Gerhard Brewka, Silvia Coradeschi, Anna Perini, and Paolo Traverso, editors, Proceedings of the 17th European Conference on Artificial Intelligence, pages 392–396, Riva del Garda, Italy, August 2006. IOS Press. |
|
|
706 | Christian Anger, Martin Gebser, Tomi Janhunen, and Torsten Schaub. What's a head without a body?. In Gerhard Brewka, Silvia Coradeschi, Anna Perini, and Paolo Traverso, editors, Proceedings of the 17th European Conference on Artificial Intelligence, pages 769–770, Riva del Garda, Italy, August 2006. IOS Press. |
|
|
705 | Mikko Särelä. Multi-homed internet access in ad hoc networks using host identity protocol. In Proceedings of the MiNEMA'06 workshop, Lisbon, Portugal, Jul 2006. MiNEMA. |
|
|
704 | Antti E. J. Hyvärinen. Satu (sat ubiquitous), June 2006. Computer program. |
|
|
703 | Teemu Koponen, Pasi Eronen, and Mikko Särelä. Resilient connections for SSH and TLS. In Proceedings of the 2006 Usenix Annual Technical Conference, Boston, MA, USA, Jun 2006. Usenix. |
|
|
702 | Tomi Janhunen. Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics, 16(1–2):35–86, June 2006. Special issue on implementation of logics. |
|
|
701 | Janne Lundberg. A wireless multicast delivery architecture for mobile terminals. Research Report A103, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, May 2006. Doctoral dissertation. |
|
|
700 | Emilia Oikarinen and Tomi Janhunen. Modular equivalence for normal logic programs. In Jüergen Dix and Anthony Hunter, editors, Proceedings of the 11th International Workshop on Nonmonotonic Reasoning, pages 10–18, Lake District, UK, May 2006. University of Clausthal, Department of Informatics, Technical Report, IfI-06-04. |
|
|
699 | Malcolm Greig, Harri Haanpää, and Petteri Kaski. On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. Journal of Combinatorial Theory, Series A, 113(4):703–711, May 2006. |
|
|
698 | Tommi Syrjänen. Debugging inconsistent answer set programs. In Proceedings of the 11th International Workshop on Non-Monotonic Reasoning, pages 77–84, Lake District, UK, May 2006. |
|
|
697 | Jean Gressmann, Tomi Janhunen, Robert Mercer, Torsten Schaub, Sven Thiele, and Richard Tichy. On probing and multi-threading in platypus. In Jüergen Dix and Anthony Hunter, editors, Proceedings of the 11th International Workshop on Nonmonotonic Reasoning, pages 30–38, Lake District, UK, May 2006. University of Clausthal, Department of Informatics, Techical Report, IfI-06-04. |
|
|
696 | Satu Elisa Schaeffer. Algorithms for nonuniform networks. Research Report A102, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2006. Doctoral dissertation. |
|
|
695 | Stefano Marinoni and Hannu H. Kari. Ad hoc routing protocol performance in a realistic environment. In Proceedings of the Fifth IEEE International Conference on Networking (ICN 2006), Le Morne, Mauritius, April 2006. IEEE Press. |
|
|
694 | Satu Elisa Schaeffer. Algorithms for nonuniform networks. PhD thesis, Helsinki University of Technology, Department of Computer Science and Engineering, April 2006. |
|
|
693 | Jori Dubrovin. Jumbala — an action language for UML state machines. Research Report A101, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2006. |
|
|
692 | Antti E. J. Hyvärinen. SATU: A system for distributed propositional satisfiability checking in computational grids. Research Report A100, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2006. |
|
|
691 | Matti Järvisalo. drgen — regular  -XORSAT generator, February 2006. Computer program. |
|
|
690 | Antti E. J. Hyvärinen. Lauselogiikan toteutuvuusongelman ratkaiseminen laskennallisessa gridissä. In Lea Kutvonen and Päivi Kuuppelomäki, editors, Tietojenkäsittelytieteen päivät 2006, volume B-2006-3 of Tietojenkäsittelytieteen laitoksen julkaisjua sarja B, pages 37 – 43. Tietojenkäsittelytieteen laitos, 2006. |
|
|
689 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. A distribution method for solving SAT in grids. In Armin Biere and Carla P. Gomes, editors, SAT 2006, volume 4121 of Lecture Notes in Computer Science, pages 430–435. Springer, 2006. |
|
|
688 | Andrea Röck and Ray Kresman. On petri nets and predicate-transition nets. In Hamid R. Arabnia and Hassan Reza, editors, Software Engineering Research and Practice - SERP 2006, volume 2, pages 903–909. CSREA Press, 2006. |
|
|
687 | Billy Bob Brumley. Left-to-right signed-bit  -adic representations of  integers (short paper). In Information and Communications Security, 8th International Conference—ICICS '06, volume 4307 of Lecture Notes in Computer Science, pages 469–478. Springer-Verlag, 2006. |
|
|
686 | Emilia Oikarinen. Modular Answer Set Programming. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2006. |
|
|
685 | Janne Nykopp. Stratum—yleiskäyttöinen automaattinen koneisharjoitusjärjestelmä. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2006. |
|
|
684 | Jukka Valkonen. Ad-Hoc Security Associations for Wireless Devices. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2006. |
|
|
683 | Billy Bob Brumley. Efficient elliptic curve algorithms for compact digital signatures. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2006. |
|
|
682 | Amir Houshang Taheri. An application programming interface for vertical handover enabled applications. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2006. |
|
|
681 | Antti Ahonen. Radio network optimisation with spatial database tools. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2006. |
|
|
680 | Jukka Honkola. Modeling the SpaceWire network architecture with the Lyra method. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2006. |
|
|
679 | Jori Dubrovin. Jumbala — an action language for UML state machines. Master's thesis, Helsinki University of Technology, Department of Engineering Physics and Mathematics, 2006. |
|
|
678 | Stefano Marinoni and Hannu H. Kari. Ad hoc routing protocol performance: a realistic simulation based study. Telecommunication Systems, 33(1-3):269–289, 2006. |
|
|
677 | Satu Elisa Schaeffer, Stefano Marinoni, Mikko Särelä, and Pekka Nikander. Dynamic local clustering for hierarchical ad hoc networks. In Proceedings of the Third IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON'06), International Workshop on Wireless Ad-hoc and Sensor Networks (IWWAN'06) subtrack, New York, NY, USA, 2006. IEEE Communications Society. |
|
|
676 | Kaisa Nyberg and Johan Wallén. Improved linear distinguishers for SNOW 2.0. In Fast Software Encryption 2006, Lecture Notes in Computer Science. Springer-Verlag, 2006. |
|
|
675 | Harri Haanpää and Patric R. J. Östergård. Steinerin kolmikkojärjestelmistä sudokuun. Arkhimedes, 2006(2):18–21, 2006. In Finnish. |
|
|
674 | Ilkka Niemelä. Answer set programming: A declarative approach to solving search problems. In Proceedings of the 10th European Conference on Logics in Artificial Intelligence, volume 4160 of Lecture Notes in Computer Science, pages 15–18. Springer, 2006. |
|
|
673 | Ilkka Niemelä. Bounded model checking, answer set programming, and fixed points. In Proceedings of the CAV'06 Workshop on Bounded Model Checking (BMC06), page 9, 2006. Abstract of an invited talk. |
|
|
672 | Ilkka Niemelä. Answer set programming: Foundations, implementation techniques, and applications. In Proceedings of the ICLP 2006 Workshop on Search and Logic: Answer Set Programming and SAT, page 35, 2006. Abstract of an invited talk. |
|
|
671 | Jukka Valkonen, N. Asokan, and Kaisa Nyberg. Ad-Hoc Security Associations for Groups. In Security and Privacy in Ad-Hoc and Sensor Networks, Third European Workshop, ESAS 2006, Hamburg, Germany, September 20-21, 2006, Revised Selected Papers, number 4357 in Lecture Notes in Computer Science, 2006. |
|
|
670 | Armin Biere, Keijo Heljanko, Tommi Junttila, Timo Latvala, and Viktor Schuppan. Linear encodings of bounded LTL model checking. Logical Methods in Computer Science, 2(5:5), 2006. (doi: 10.2168/LMCS-2(5:5)2006). |
|
|
669 | Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence, 170(12-13):1031–1080, 2006. |
|
|
668 | Kaisa Nyberg. Connect Now to MitM. In Crypto 2006 Rump Session, 2006. |
|
|
667 | Matti Järvisalo. Further investigations into regular XORSAT. In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI-06), pages 1873–1874. AAAI Press, 2006. Poster. |
|
|
666 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä. Hard satisfiable clause sets for benchmarking equivalence reasoning techniques. Journal on Satisfiability, Boolean Modeling and Computation, 2(1-4):27–46, 2006. |
|
|
665 | Matti Järvisalo. Opinions, hopes, and expectations of CS&E students, a case study in academic skills and hidden curriculum. In Tapio Salakoski, Tomi Mäntylä, and Mikko Laakso, editors, Koli Calling 2005 – Proceedings of the Fifth Finnish / Baltic Sea Conference on Computer Science Education, volume 41 of TUCS General Publications, pages 157–161. Turku Centre for Computer Science, 2006. ISBN 951-29-3006-4. |
|
|
664 | Petteri Kaski and Patric R. J. Östergård. Classification Algorithms for Codes and Designs. Number 15 in Algorithms and Computation in Mathematics. Springer-Verlag, Berlin Heidelberg, 2006. |
|
|
663 | Risto Hakala, Timo Similä, Miki Sirola, and Jukka Parviainen. Process state and progress visualization using self-organizing map. In Emilio Corchado, Hujun Yin, Vicente J. Botti, and Colin Fyfe, editors, Intelligent Data Engineering and Automated Learning – IDEAL 2006, 7th International Conference, Burgos, Spain, September 20–23, 2006, Proceedings, volume 4224 of Lecture Notes in Computer Science. Springer, 2006. |
|
|
662 | Jiří Šíma and Satu Elisa Schaeffer. On the NP-completeness of some graph cluster measures. In Jiří Wiedermann, Gerard Tel, Jarslav Pokorný, Mária Bieliková, and Július Štuller, editors, Proceedings of the Thirty-second International Conference on Current Trends in Theory and Practice of Computer Science (Sofsem 06), volume 3831 of Lecture Notes in Computer Science, pages 530–537, Berlin Heidelberg, Germany, 2006. Springer-Verlag GmbH. |
|
|
661 | André Schumacher, Harri Haanpää, Satu Elisa Schaeffer, and Pekka Orponen. Load balancing by distributed optimisation in ad hoc networks. In J. Cao, I. Stojmenovic, X. Jia, and S. K. Das, editors, Proceedings of The 2nd International Conference on Mobile Ad-hoc and Sensor Networks (MSN 2006), volume 4325/2006 of Lecture Notes in Computer Science, pages 873–884, Berlin / Heidelberg, 2006. Springer-Verlag. |
|
|
660 | Sven Laur and Helger Lipmaa. Consistent adaptive two-party computations. Cryptology ePrint Archive, Report 2006/088, 2006. Techical report. |
|
|
659 | Ahto Buldas and Sven Laur. Do broken hash functions affect the security of time-stamping schemes?. In Jianying Zhou, Moti Yung, and Feng Bao, editors, Applied Cryptography and Network Security, 4th International Conference, ACNS 2006, Singapore, June 6-9, 2006, Proceedings, volume 3989 of Lecture Notes in Computer Science, pages 50–65. Springer, 2006. |
|
|
658 | Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. Cryptographically private support vector machines. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 618–624, New York, NY, USA, 2006. ACM Press. |
|
|
657 | Sven Laur and Kaisa Nyberg. Efficient mutual data authentication using manually authenticated strings. In The 5th International Conference on Cryptology and Network Security, CANS 2006, Suzhou, Dec. 8 - 10, 2006, volume 4301 of Lecture Notes in Computer Science, pages 90–107. Springer, 2006. A shortened version of ePrint Report 2005/424. |
|
|
656 | Sven Laur and Kaisa Nyberg. Efficient mutual data authentication using manually authenticated strings: Extended version. Cryptology ePrint Archive, Report 2005/424, 2006. A shorter more compact version was published at CANS 2006. |
|
|
655 | Timo Latvala and Tommi Junttila. Nusmv-2.3.99-cav2006. Computer program, 2006. |
|
|
654 | Toni Jussila, Jori Dubrovin, Tommi Junttila, Timo Latvala, and Ivan Porres. Model checking dynamic and hierarchical UML state machines. In MoDeVa: Model Development, Validation and Verification; 3rd International Workshop, Genova, Italy, October 2006, pages 94–110, 2006. |
|
|
653 | Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, and Jia-Huai You. Unfolding partiality and disjunctions in stable model semantics. ACM Transactions on Computational Logic, 7(1):1–37, January 2006. |
|
|
652 | Tomi Janhunen. lp2sat 1.10 — A tool for translating normal logic programs into SAT. http://www.tcs.hut.fi/Software/lp2sat/, 2006. Computer Program. |
|
|
651 | Ville Nuorvala and Antti Tuominen. MIPL Mobile IPv6 for Linux, version 2.0.2, 2006. |
|
|
650 | Ville Nuorvala and Antti Tuominen. MIPL Mobile IPv6 for Linux, version 2.0.1, 2006. |
|
|
649 | Ville Nuorvala. NEPL NEmo Platform for Linux, version 0.2, 2006. |
|
|
648 | Ville Nuorvala and Antti Tuominen. MIPL Mobile IPv6 for Linux, version 2.0, 2006. |
|
2005 |
|
647 | 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. |
|
|
646 | Misa Keinänen. Solving boolean equation systems. Research Report A99, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2005. |
|
|
645 | 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. |
|
|
644 | 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. |
|
|
643 | 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. |
|
|
642 | Sven Laur and Kaisa Nyberg. Efficient mutual data authentication using manually authenticated strings. Report 2005/424, Cryptology ePrint Archive, November 2005. |
|
|
641 | 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. |
|
|
640 | 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. |
|
|
639 | 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. |
|
|
638 | 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. |
|
|
637 | 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. |
|
|
636 | 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. |
|
|
635 | Matti Järvisalo. rgen — a SAT benchmark generator, September 2005. Computer program. |
|
|
634 | 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. |
|
|
633 | 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. |
|
|
632 | 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. |
|
|
631 | 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. |
|
|
630 | Emilia Oikarinen. Translating parallel circumscription into disjunctive logic programming. In ICCL Summer School Student Workshop 2005, Dresden, Germany, July 2005. TU Dresden. |
|
|
629 | 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. |
|
|
628 | 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. |
|
|
627 | 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. |
|
|
626 | 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. |
|
|
625 | 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. |
|
|
624 | 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. |
|
|
623 | 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. |
|
|
622 | 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. |
|
|
621 | 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. |
|
|
620 | Misa Kristian Keinänen. Solving Boolean Equation Systems. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, April 2005. |
|
|
619 | Evan Griffiths and Pekka Orponen. Optimization, block designs and No Free Lunch theorems. Information Processing Letters, 94(2):55–61, April 2005. |
|
|
618 | 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. |
|
|
617 | 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. |
|
|
616 | 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. |
|
|
615 | 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. |
|
|
614 | 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. |
|
|
613 | Lasse Kiviluoto. Sperner capacity of directed graphs. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2005. |
|
|
612 | 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. |
|
|
611 | 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. |
|
|
610 | 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. |
|
|
609 | 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. |
|
|
608 | 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. |
|
|
607 | 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. |
|
|
606 | 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. |
|
|
605 | Janne Lundberg, Catharina Candolin, and Hannu H. Kari. Multicast source authentication for limited devices. WSEAS Transactions on Computers, 4(4), 2005. |
|
|
604 | 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. |
|
|
603 | Janne Lundberg, Catharina Candolin, and Hannu H. Kari. Multicast source authentication for limited devices. WSEAS Transactions on Computers, 4(4), 2005. |
|
|
602 | 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). |
|
|
601 | Emilia Oikarinen. CIRC2DLP 1.1 — software for translating parallel circumscription to disjunctive logic programming, 2005. Computer Program. |
|
|
600 | Harri Haanpää. No 17-player triplewhist tournament has nontrivial automorphisms. Journal of Combinatorial Designs, 13:345–348, 2005. |
|
|
599 | 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. |
|
|
598 | 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. |
|
|
597 | 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. |
|
|
596 | Miia Hermelin. Deformation of a Thin Shell Under a Concentrated Load. Licentiate's thesis, Helsinki University of Technology, 2005. |
|
|
595 | 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/. |
|
|
594 | 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. |
|
|
593 | 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. |
|
|
592 | 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. |
|
|
591 | Petteri Kaski and Patric R. J. Östergård. One-factorizations of regular graphs of order 12. Electronic Journal of Combinatorics, 12:R2, 2005. |
|
|
590 | Petteri Kaski. Isomorph-free exhaustive generation of designs with prescribed groups of automorphisms. SIAM Journal on Discrete Mathematics, 19(3):664–690, 2005. |
|
|
589 | 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. |
|
|
588 | 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, BerlinHeidelberg, Germany, 2005. Springer-Verlag GmbH. |
|
|
587 | 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. |
|
|
586 | Sven Laur and Helger Lipmaa. Additive conditional disclosure of secrets and applications. Cryptology ePrint Archive, Report 2005/378, 2005. Techical report. |
|
|
585 | 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. |
|
|
584 | 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. |
|
|
583 | Tommi Junttila. Nusmv-2.2.3-cav2005. Computer program, 2005. |
|
|
582 | 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. |
|
|
581 | 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. |
|
|
580 | 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. |
|
|
579 | 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. |
|
|
578 | 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. |
|
|
577 | Ville Nuorvala and Antti Tuominen. MIPL Mobile IPv6 for Linux, version 2.0 rc3, 2005. |
|
|
576 | Ville Nuorvala, Henrik Petander, and Antti Tuominen. MIPL Mobile IPv6 for Linux, version 2.0 rc2, 2005. |
|
|
575 | Ville Nuorvala. NEPL NEmo Platform for Linux, version 0.1, 2005. |
|
2004 |
|
574 | Catharina 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. |
|
|
573 | Annikka 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. |
|
|
572 | Catharina Candolin. Self healing networks against infrastructural warfare. In Proceedings of the 5th Australian Information Warfare & IT Security Conference, Fremantle, Australia, November 2004. |
|
|
571 | Mikko Särelä and Pekka Nikander. Applying host identity protocol to tactical networks. In Proceedings of IEEE Milcom 2004, Monterey, California, USA, Nov 2004. |
|
|
570 | Timo 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. |
|
|
569 | Malcolm 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. |
|
|
568 | Keijo 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. |
|
|
567 | Tomi 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. |
|
|
566 | Misa 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. |
|
|
565 | Jussi 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. |
|
|
564 | Tommi 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. |
|
|
563 | Tomi 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. |
|
|
562 | Tuomo 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. |
|
|
561 | Tomi 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. |
|
|
560 | Timo 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. |
|
|
559 | Harri 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. |
|
|
558 | Pauli 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. |
|
|
557 | Jan 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. |
|
|
556 | Lasse 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. |
|
|
555 | Pekka Orponen and Satu Elisa Schaeffer. Efficient algorithms for sampling and clustering of large nonuniform networks. Technical Report cond-mat/0406048, arXiv.org, June 2004. |
|
|
554 | Pekka 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. |
|
|
553 | Toni 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. |
|
|
552 | Mikko 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. |
|
|
551 | Jan 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. |
|
|
550 | 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, 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. |
|
|
549 | Matti 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. |
|
|
548 | Harri 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. |
|
|
547 | Harri 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. |
|
|
546 | Harri 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. |
|
|
545 | Harri 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/. |
|
|
544 | Antti 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. |
|
|
543 | Catharina 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. |
|
|
542 | Erkki 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. |
|
|
541 | Annikka 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. |
|
|
540 | Heikki 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. |
|
|
539 | Harriet 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. |
|
|
538 | Mikko 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. |
|
|
537 | Matti 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. |
|
|
536 | Tuomo Pyhälä. genfacbm — a benchmark generator based on factoring for SAT and ASP solvers, 2004. Computer program. |
|
|
535 | Technical aspects of network centric warfare, 2004. ISBN: 951-25-1499-0. |
|
|
534 | Janne 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. |
|
|
533 | Janne Lundberg. Implementation of packet level authentication for Linux. In Technical Aspects of Network Centric Warfare, Helsinki, Finland, 2004. |
|
|
532 | Janne Lundberg. PLA – implementation of packet level authentication for Linux, 2004. Computer Program. |
|
|
531 | Janne Lundberg. MSEC – a secure and reliable multicast delivery engine for Linux, 2004. Computer Program. |
|
|
530 | Kimmo 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. |
|
|
529 | Emilia 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. |
|
|
528 | Harri Haanpää. Minimum sum and difference covers of Abelian groups. Journal of Integer Sequences, 7(2):article 04.1.8, 2004. |
|
|
527 | Harri Haanpää, Antti Huima, and Patric R. J. Östergård. Sets in  with distinct sums of pairs. Discrete Applied Mathematics, 138:99–106, 2004. |
|
|
526 | Victor 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. |
|
|
525 | Vladimir 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. |
|
|
524 | Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Parallel encodings of classical planning as satisfiability. Technical Report 198, Institute of Computer Science at Freiburg University, 2004. |
|
|
523 | Gerhard Brewka, Ilkka Niemelä, and Tommi Syrjänen. Logic programs with ordered disjunction. Computational Intelligence, 20(2):333–357, 2004. |
|
|
522 | Matti Järvisalo. Lauselogiikan toteutuvuustarkastus: käytännönläheistä teoriaa. Tietojenkäsittelytiede, 22:47–63, 2004. In Finnish. |
|
|
521 | Matti 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/. |
|
|
520 | Matti 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. |
|
|
519 | Matti 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/. |
|
|
518 | Emil 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. |
|
|
517 | Petteri Kaski and Patric R. J. Östergård. Enumeration of balanced ternary designs. Discrete Applied Mathematics, 138(1–2):133–141, 2004. |
|
|
516 | Petteri Kaski and Patric R. J. Östergård. Miscellaneous classification results for 2-designs. Discrete Mathematics, 280(1–3):65–75, 2004. |
|
|
515 | Petteri Kaski. Packing Steiner trees with identical terminal sets. Information Processing Letters, 91(1):1–5, 2004. |
|
|
514 | Petteri Kaski and Patric R. J. Östergård. The Steiner triple systems of order 19. Mathematics of Computation, 73:2075–2092, 2004. |
|
|
513 | Petteri 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. |
|
|
512 | Satu 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. |
|
|
511 | Satu 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. |
|
|
510 | Sven 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. |
|
|
509 | Bart 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. |
|
|
508 | Timo Latvala. Nusmv-bpltl. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2004. Software. |
|
|
507 | Timo Latvala. scheck1.2. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2004. Software. |
|
|
506 | Timo Latvala and Heikki Tauriainen. Improved on-the-fly verification with testers. Nordic Journal of Computing, 11(2):148–164, 2004. |
|
|
505 | Timo 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. |
|
|
504 | Tommi 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. |
|
|
503 | Tommi A. Junttila. New orbit algorithms for data symmetries. In Application of Concurrency to System Design 2004, pages 175–184. IEEE, 2004. |
|
|
502 | Toni Jussila. Efficient bounded reachability through iterative strengthening. In Concurrency, Specification and Programming CS&P'2004, 2004. |
|
|
501 | Tomi 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. |
|
|
500 | Tomi 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. |
|
|
499 | Tomi 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. |
|
|
498 | Ville Nuorvala, Henrik Petander, and Antti Tuominen. MIPL Mobile IPv6 for Linux, version 2.0 rc1, 2004. |
|
|
497 | Ville Nuorvala, Henrik Petander, and Antti Tuominen. MIPL Mobile IPv6 for Linux, version 1.1, 2004. |
|
2003 |
|
496 | Heikki Tauriainen. On translating linear temporal logic into alternating and nondeterministic automata. Research Report A83, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003. |
|
|
495 | Johan Wallén. On the differential and linear properties of addition. Research Report A84, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003. |
|
|
494 | Emilia Oikarinen. Testing the equivalence of disjunctive logic programs. Research Report A85, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003. |
|
|
493 | Tommi Syrjänen. Logic programming with cardinality constraints. Research Report A86, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2003. |
|
|
492 | Jan Friso Groote and Misa Keinänen. Solving disjunctive/conjunctive boolean equation systems with alternating fixed points. Technical Report SEN-R0310, Stichting Centrum voor Wiskunde en Informatica (CWI), Amsterdam, Amsterdam, Netherlands, December 2003. |
|
|
491 | Jiří Šíma and Pekka Orponen. General purpose computation with neural networks: A survey of complexity theoretic results. Neural Computation, 15(12):2727–2778, December 2003. |
|
|
490 | Marko Mäkelä. Efficient computer-aided verification of parallel and distributed software systems. Research Report A81, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2003. Doctoral dissertation. |
|
|
489 | Tomi Janhunen. Translatability and intranslatability results for certain classes of logic programs. Research Report A82, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2003. |
|
|
488 | Catharina Candolin. Privacy issues in network-centric warfare. In Proceedings of the 4th Australian Information Warfare & IT Security Conference, Adelaide, Australia, November 2003. |
|
|
487 | Ilkka Niemelä. Answer set programming: an approach to declarative problem solving. In Proceedings of the Eighth Scandinavian Conference on Artificial Intelligence, pages 189–191, Bergen, Norway, November 2003. IOS Press. Extended abstract of a key note talk. |
|
|
486 | Pekka Orponen. Tietotekniikkaa ennen tietokoneita — Alan Turing ja tietotekniikan kiehtovat alkuvaiheet. Tietoa, pages 4–6, November 2003. |
|
|
485 | Satu Elisa Virtanen. Clustering the Chilean web. In Proceedings of the First Latin American Web Congress, pages 229–231, Los Alamitos, CA, USA, November 2003. IEEE Computer Society. |
|
|
484 | Catharina Candolin and Hannu H. Kari. An architecture for context aware management. In Proceedings of IEEE MILCOM 2003, Boston, Massachusetts, USA, October 2003. |
|
|
483 | Toni Jussila. Daa - a BMC tool translating LTSs to boolean circuits, October 2003. http://www.tcs.hut.fi/ tjussila/daa. |
|
|
482 | Tommi Junttila. On the symmetry reduction method for Petri nets and similar formalisms. Research Report A80, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, September 2003. Doctoral dissertation. |
|
|
481 | Janne Lundberg and Catharina Candolin. Hierarchical multicast caching. In Proceedings of IEEE 9th Asia-Pacific conference on communications, Penang, Malaysia, September 2003. |
|
|
480 | Jiří Šíma and Pekka Orponen. Exponential transients in continuous-time Liapunov systems. Theoretical Computer Science, 306(1–3):353–372, September 2003. |
|
|
479 | Tomi Janhunen. A counter-based approach to translating normal logic programs into sets of clauses. In Marina de Vos and Alessandro Provetti, editors, Answer Set Programming: Advances in Theory and Implementation, pages 166–180, Messina, Sicily, September 2003. CEUR. http://ceur-ws.org/Vol-78/. |
|
|
478 | Janne Lundberg and Catharina Candolin. Mobility in the host identity protocol (hip). In Proceedings of the International Symposium on Telecommunications (IST2003), Isfahan, Iran, August 2003. |
|
|
477 | Janne Lundberg and Catharina Candolin. Mobility in The Host Identity Protocol (HIP). In Proceedings of the International Symposium on Telecommunications (IST2003), Isfahan, Iran, August 2003. |
|
|
476 | Gerd Brewka, Ilkka Niemelä, and Mirosław Truszczyński. Answer set optimization. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, pages 867–872. Morgan Kaufmann Publishers, August 2003. |
|
|
475 | Heikki Tauriainen. Nested emptiness search for generalized Büchi automata. Research Report A79, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, July 2003. |
|
|
474 | Catharina Candolin and Hannu Kari. Ad hoc network routing based on incomplete trust. In Proceedings of The 7th Multiconference on Systemics, Cybernetics, and Informatics, Orlando, Florida, USA, July 2003. |
|
|
473 | Petri Puhakainen, Catharina Candolin, and Hannu H. Kari. Using adaptive decision making based on incomplete trust in electronic commerce. In Proceedings of the 7th WSEAS International Conference on Communications (ICCON), Corfu, Greece, July 2003. |
|
|
472 | Miika Komu, Mika Kousa, Janne Lundberg, and Catharina Candolin. An implementation of hip for linux. In Proceedings of Ottawa Linux Symposium, Ottawa, Canada, July 2003. |
|
|
471 | Ilkka Niemelä. Answer set programming: From model computation to problem solving. In Proceedings of CADE-19 Workshop on Model Computation — Principles, Algorithms, Applications, Miami, Florida, USA, July 2003. Extended abstract of an invited talk. |
|
|
470 | Toni Jussila, Keijo Heljanko, and Ilkka Niemelä. BMC via on-the-fly determinization. In Proceedings of the 1st International Workshop on Bounded Model Checking, volume 89 of ENTCS, Boulder, CO, USA, July 2003. |
|
|
469 | Petteri Kaski. A census of Steiner triple systems and some related combinatorial objects. Research Report A78, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2003. |
|
|
468 | Kimmo Varpaaniemi, editor. Annual report for the year 2002. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, June 2003. |
|
|
467 | Catharina Candolin. A study of infrastructure warfare in relation to information warfare, net warfare, and network-centric warfare. In Proceedings of the 2nd European Conference on Information Warfare (ECIW'03), Reading, UK, June 2003. |
|
|
466 | Janne Lundberg, Catharina Candolin, and Hannu H. Kari. Support for transparent multicast content distribution to mobile wireless clients. In Proceedings of the 2003 International Conference on Wireless Networks (ICWN 2003), Las Vegas, Nevada, USA, June 2003. |
|
|
465 | Marko Mäkelä. Model checking safety properties in modular high-level nets. In Wil M.P. van der Aalst and Eike Best, editors, Application and Theory of Petri Nets 2003: 24th International Conference, ICATPN 2003, number 2679 in Lecture Notes in Computer Science, pages 201–220, Eindhoven, The Netherlands, June 2003. Springer-Verlag, Berlin, Germany. |
|
|
464 | Tuomo Pyhälä and Keijo Heljanko. Specification coverage aided test selection. In Johan Lilius, Felice Balarin, and Ricardo J. Machado, editors, Proceeding of the 3rd International Conference on Application of Concurrency to System Design (ACSD'2003), pages 187–195, Guimaraes, Portugal, June 2003. IEEE Computer Society. |
|
|
463 | Satu Virtanen. Properties of nonuniform random graph models. Research Report A77, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, May 2003. |
|
|
462 | Emilia Oikarinen. Logiikkaohjelmien ekvivalenssitestaus. In Ari Korhonen and Jorma Tarhio, editors, Tietojenkäsittelytieteen päivät 2003, pages 44–47, Espoo, Finland, May 2003. Yliopistopaino. In Finnish. |
|
|
461 | Toni Jussila. Otf - a BMC tool translating LTSs to boolean circuits, May 2003. |
|
|
460 | Catharina Candolin and Hannu Kari. Distributing incomplete trust in wireless ad hoc networks. In Proceedings of IEEE Southeastcon 2003, Ocho Rios, St. Ann, Jamaica, April 2003. |
|
|
459 | Jiří Šíma and Pekka Orponen. Continuous-time symmetric Hopfield nets are computationally universal. Neural Computation, 15(3):693–733, March 2003. |
|
|
458 | Satu Elisa Virtanen. Properties of nonuniform random graph models. Licentiate thesis, Helsinki University of Technology, Department of Computer Science and Engineering, March 2003. |
|
|
457 | Tomi Janhunen. Evaluating the effect of semi-normality on the expressiveness of defaults. Artificial Intelligence, 144(1–2):233–250, March 2003. |
|
|
456 | Kimmo Varpaaniemi. Towards ambitious approximation algorithms in stubborn set optimization. Fundamenta Informaticae (Annales Societatis Mathematicae Polonae, Series IV), 54(2–3):279–294, February 2003. IOS Press, Amsterdam, The Netherlands. |
|
|
455 | Satu Virtanen. Properties of Nonuniform Random Graph Models. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
|
454 | Yki Kortesniemi. Managing the usage of authorisation certificates. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
|
453 | Teemu Tynjälä. Combining abstractions and reachability analysis: a case study of RLC protocol. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
|
452 | Heikki Tauriainen. On translating linear temporal logic into alternating and nondeterministic automata. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
|
451 | Tommi Syrjänen. Logic programming with cardinality constraints. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
|
450 | Tuomo Pyhälä. Specification-based test selection in formal conformance testing. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
|
449 | Shuqin Li-Kokko. An SPKI based secure multicast architecture with copyright protection. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
|
448 | Antti Järvinen. Smart card based configuration and authentication in mobile IPv6. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
|
447 | Teemu Vainio. The applicability of Bluetooth in ad hoc networks. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
|
446 | Niyue Chen. Enterprise portal as the enterprise integration solution. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
|
445 | Johan Wállen. On the differential and linear properties of addition. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2003. |
|
|
444 | Nikolaj Cankar. Model based testing using UML. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2003. |
|
|
443 | Emilia Oikarinen. Testing the equivalence of disjunctive logic programs. Master's thesis, Helsinki University of Technology, Department of Engineering Physics and Mathematics, 2003. |
|
|
442 | Evan Griffiths. Limit lemmas and jump inversion in the enumeration degrees. Archive for Mathematical Logic, 42(6), 2003. |
|
|
441 | Annikka Aalto, Nisse Husberg, and Kimmo Varpaaniemi. Automatic formal model generation and analysis of SDL. In Rick Reed and Jeanne Reed, editors, SDL 2003: System Design, 11th International SDL Forum, Stuttgart, Germany, July 1–4, 2003, Proceedings, volume 2708 of Lecture Notes in Computer Science, pages 285–299. Springer-Verlag, Berlin, Germany, 2003. © Springer-Verlag Berlin Heidelberg 2003. |
|
|
440 | Kimmo Varpaaniemi. Modelling and analysing a PLC-based railway traffic control system. In Ludwik Czaja, editor, Concurrency, Specification and Programming: Proceedings of the CS&P'2003 Workshop, Czarna k. Ustrzyk Dolnych, Poland, September 25–27, 2003, Volume 2, pages 539–549. Zakład Graficzny UW, zam. 591/2003, Warsaw, Poland, 2003. |
|
|
439 | Johan Wallén. Linear approximations of addition modulo  . In Fast Software Encryption 2003, volume 2887 of Lecture Notes in Computer Science, pages 261–273. Springer-Verlag, 2003. |
|
|
438 | Emilia Oikarinen. DLPEQ 1.9 — a tool for testing the equivalence of disjunctive logic programs, 2003. Computer Program. |
|
|
437 | Harri Haanpää and Patric R. J. Östergård. Classification of whist tournaments with up to 12 players. Discrete Applied Mathematics, 129:399–407, 2003. |
|
|
436 | Juha Tiihonen, Timo Soininen, Ilkka Niemelä, and Reijo Sulonen. A practical tool for mass-customising configurable products. In Proceedings of the 14th International Conference on Engineering Design, pages 1290–1299, 2003. |
|
|
435 | Tuomo Pyhälä and Keijo Heljanko. Bomotest: A formal conformance testing tool, version 1.5. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2003. Software. |
|
|
434 | Keijo Heljanko and Ilkka Niemelä. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming, 3(4&5):519–550, 2003. Also available as (CoRR: arXiv:cs.LO/0305040). |
|
|
433 | Markku-Juhani O. Saarinen. Cryptanalysis of block ciphers based on sha-1 and md5. In Thomas Johansson, editor, Fast Software Encryption 2003, Lecture Notes in Computer Science. Springer-Verlag, 2003. To appear. |
|
|
432 | Sakari Seitz and Pekka Orponen. An efficient local search method for random 3-satisfiability. In Lefteris M. Kirousis and Evangelos Kranakis, editors, Proceedings of the IEEE LICS'03 Workshop on Typical Case Complexity and Phase Transitions (Ottawa, Canada, June 2003), volume 16 of Electronic Notes in Discrete Mathematics, Amsterdam, 2003. Elsevier. |
|
|
431 | Pekka Orponen. Mitä tietojenkäsittelyteoriaan kuuluu?. Tietojenkäsittelytiede, 19:15–28, 2003. |
|
|
430 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Multicast time maximization in energy constrained wireless networks. In Andrea Richa and Jennifer Welch, editors, Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC'03, San Diego CA, September 2003), pages 50–58, New York NY, 2003. Association for Computing Machinery. |
|
|
429 | Petteri Kaski, Luis B. Morales, Patric R. J. Östergård, David A. Rosenblueth, and Carlos Velarde. Classification of resolvable 2-(14,7,12) and 3-(14,7,5) designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 47:65–74, 2003. |
|
|
428 | Timo Latvala. scheck1.1. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2003. Software. |
|
|
427 | Timo Latvala. Efficient model checking of safety properties. In T. Ball and S. Rajamani, editors, Model Checking Software. 10th International SPIN Workshop, pages 74–88. Springer, 2003. |
|
|
426 | Tomi Janhunen and Patrik Simons. GnT 2 — A tool for computing stable models for disjunctive logic programs. http://www.tcs.hut.fi/Software/gnt/, 2003. Computer Program. |
|
|
425 | Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, and Jia-Huai You. Unfolding partiality and disjunctions in stable model semantics. http://arxiv.org/abs/cs.AI/0303009, 2003. To appear in ACM Transactions on Computational Logic. |
|
|
424 | Ville Nuorvala, Henrik Petander, and Antti Tuominen. MIPL Mobile IPv6 for Linux, version 1.0, 2003. |
|
|
423 | Ville Nuorvala. IPv6-in-IPv6 tunnel, 2003. |
|
2002 |
|
422 | Timo Latvala. On model checking safety properties. Research Report A76, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2002. |
|
|
421 | Catharina Candolin and Pekka Nikander. Ipv6 source addresses considered harmful. In Proceedings of the 6th Nordic Workshop on Secure IT Systems (NordSec'2001), Lyngby, Denmark, November 2002. |
|
|
420 | Catharina Candolin and Hannu Kari. Dynamic management of core ad hoc networks. In Proceedings of InfoWarCon 2002, Perth, Australia, November 2002. |
|
|
419 | Tommi Junttila. New canonical representative marking algorithms for place/transition-nets. Research Report A75, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, October 2002. |
|
|
418 | Elina Parviainen. Reducing size of quantum gate matrices using Pr/T nets. In Proceedings of the 2002 IEEE International Conference on Systems, Man and Cybernetics, volume 2, pages 634–639, Hammamet, Tunisia, October 2002. IEEE (Institute of Electrical and Electronics Engineers, Inc.). |
|
|
417 | Catharina Candolin and Hannu Kari. A security architecture for wireless ad hoc networks. In Proceedings of IEEE Milcom 2002, Anaheim, California, USA, October 2002. |
|
|
416 | Sam Sandqvist. Aspects of modelling and simulation of genetic algorithms: A formal approach. Research Report A74, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, September 2002. Doctoral dissertation. |
|
|
415 | Catharina Candolin, Janne Lundberg, and Pekka Nikander. Experimenting with early opportunistic key agreement. In Proceedings of Workshop SEcurity of Communication on Internet, Internet Communication Security, Tunis, Tunisia, September 2002. |
|
|
414 | Catharina Candolin, Janne Lundberg, and Pekka Nikander. Experimenting with early opportunistic key agreement. In Workshop on Security of Communication on the Internet (SECI'02), Tunis, Tunisia, September 2002. |
|
|
413 | Gerd Brewka, Ilkka Niemelä, and Tommi Syrjänen. Implementing ordered disjunction using answer set solvers for normal programs. In Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA'02), pages 444–455, Cosenza, Italy, September 2002. Springer-Verlag. |
|
|
412 | Tomi Janhunen and Emilia Oikarinen. Testing the equivalence of logic programs under stable model semantics. In Sergio Flesca et al., editors, Logics in Artificial Intelligence, Proceedings of the 8th European Conference, pages 493–504, Cosenza, Italy, September 2002. Springer-Verlag. LNAI 2424. |
|
|
411 | Toni Jussila. Bounded model checking for verifying concurrent programs. Research Report A73, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, August 2002. |
|
|
410 | Jukka Järvenpää and Marko Mäkelä. Towards automated checking of component-oriented enterprise applications. In Daniel Moldt, editor, Second Workshop on Modelling of Objects, Components and Agents, volume PB-561 of DAIMI report, pages 67–85, Århus, Denmark, August 2002. University of Århus. |
|
|
409 | Toni Jussila and Ilkka Niemelä. Parallel program verification using BMC. In Proceedings of the ECAI 2002 Workshop on Model Checking and Artificial Intelligence, pages 59–66, Lyon, France, July 2002. |
|
|
408 | Catharina Candolin and Hannu Kari. Context aware management architecture. Technical report, Internet Engineering Task Force, June 2002. Internet Draft, work in progress. |
|
|
407 | Janne Lundberg. Unidirectional link support for mldv2. Technical report, Internet Engineering Task Force, June 2002. Internet Draft, work in progress. |
|
|
406 | Marko Mäkelä. Maria: Modular reachability analyser for algebraic system nets. In Javier Esparza and Charles Lakos, editors, Application and Theory of Petri Nets 2002: 23rd International Conference, ICATPN 2002, number 2360 in Lecture Notes in Computer Science, pages 434–444, Adelaide, Australia, June 2002. Springer-Verlag, Berlin, Germany. |
|
|
405 | Marko Mäkelä. Efficiently verifying safety properties with idle office computers. In Charles Lakos, Robert Esser, Lars M. Kristensen, and Jonathan Billington, editors, Formal Methods in Software Engineering and Defence Systems 2002, Conferences in Research and Practice in Information Technology, pages 11–16. Australian Computer Society Inc., June 2002. |
|
|
404 | Tommi Junttila. Symmetry reduction algorithms for data symmetries. Research Report A72, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, May 2002. |
|
|
403 | Kimmo Varpaaniemi. Minimizing the number of successor states in the stubborn set method. Fundamenta Informaticae (Annales Societatis Mathematicae Polonae, Series IV), 51(1–2):215–234, May 2002. IOS Press, Amsterdam, The Netherlands. |
|
|
402 | Kimmo Varpaaniemi, editor. Annual report for the year 2001. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, April 2002. |
|
|
401 | Keijo Heljanko, Victor Khomenko, and Maciej Koutny. Parallelisation of the Petri net unfolding algorithm. In Joost-Pieter Katoen and Perdita Stevens, editors, Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2002), volume 2280 of Lecture Notes in Computer Science, pages 371–385, Grenoble, France, April 2002. Springer-Verlag. |
|
|
400 | Catharina Candolin, Maarit Hietalahti, and Hannu Kari. Providing quality of service in wireless ad hoc networks. In Proceedings of the 2nd Swedish Workshop on Wireless Ad-hoc Networks, Stockholm, Sweden, March 2002. |
|
|
399 | Catharina Candolin and Hannu Kari. Complexity of route optimization and mobility management. In Proceedings of the 2nd Swedish Workshop on Wireless Ad-hoc Networks, Stockholm, Sweden, March 2002. |
|
|
398 | Keijo Heljanko. Combining symbolic and partial order methods for model checking 1-safe Petri nets. Research Report A71, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, February 2002. Doctoral dissertation. |
|
|
397 | Yuchen Zhou, Catharina Candolin, and Teemupekka Virtanen. Trust management in mobile ipv6. In Proceedings of the 4th Nordic Usenix Conference, Helsinki, Finland, February 2002. |
|
|
396 | Timo Latvala. On Model Checking Safety Properties. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2002. |
|
|
395 | Petteri Kaski. A Census of Steiner Triple Systems and Some Related Combinatorial Objects. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2002. |
|
|
394 | Lauri Tarkkala. On the construction of collision-resistant accumulators. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2002. |
|
|
393 | Jing Lin. An architectural solution driven by business, enabled through technology, with and integration perspective. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2002. |
|
|
392 | Erkki Pulliainen. Reducing retrieval time in high-latency computer networks using predictive caching. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2002. |
|
|
391 | Terje Bergström. Context awareness in symbian os based smart-phones. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2002. |
|
|
390 | Matti Kokkola. An architecture for time critical short message services. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2002. |
|
|
389 | Henrik Petander. Authorization of mobile IPv6. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2002. |
|
|
388 | Yafeng Wang. A gateway architecture for content charging. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2002. |
|
|
387 | Matti Salonen. Solution for content and service mediation. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2002. |
|
|
386 | Catharina Candolin. Network management and routing in mobile military ad hoc networks. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2002. |
|
|
385 | Henri Grönblom. Software quality improvement through software product process definition and development. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2002. |
|
|
384 | Timo Karilinna. Analysointityökalun käytettävyyden parantaminen. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2002. |
|
|
383 | Elina Parviainen. Modeling the operation of Margolus quantum cellular automaton using high-level Petri nets. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2002. |
|
|
382 | Tuomas Aura and Silja Mäki. Towards a survivable security architecture for ad-hoc networks. In Bruce Christianson, Bruno Crispo, James A. Malcolm, and Michael Roe, editors, Security Protocols, 9th International Workshop, Cambridge, UK, April 25–27, 2001, Revised Papers, volume 2467 of Lecture Notes in Computer Science, pages 63–73. Springer-Verlag, Berlin, 2002. © Springer-Verlag Berlin Heidelberg 2002. |
|
|
381 | Silja Mäki. Towards a survivable security architecture for ad-hoc networks (transcript of discussion). In Bruce Christianson, Bruno Crispo, James A. Malcolm, and Michael Roe, editors, Security Protocols, 9th International Workshop, Cambridge, UK, April 25–27, 2001, Revised Papers, volume 2467 of Lecture Notes in Computer Science, pages 74–79. Springer-Verlag, Berlin, 2002. © Springer-Verlag Berlin Heidelberg 2002. |
|
|
380 | Pekka Nikander, Catharina Candolin, and Janne Lundberg. From address orientation to host orientation. Réseaux et systčmes répartis, calculateurs parallčles, ISSN 1260-3198, Special Issue on Mobility and Internet, 13, 2002. |
|
|
379 | Catharina Candolin. Ad hoc -johtamisverkot. Maanpuolustuksen aikakauslehti, 1(1), 2002. |
|
|
378 | Kimmo Varpaaniemi. Towards ambitious approximation algorithms in stubborn set optimization. In Hans-Dieter Burkhard, Ludwik Czaja, Gabriela Lindemann, Andrzej Skowron, and Peter H. Starke, editors, Workshop: Concurrency, Specification and Programming, CS&P'2002, Berlin, October 7–9, 2002, Volume 2, pages 370–379. Informatik-Bericht Nr. 161, Institut für Informatik, Humboldt-Universität zu Berlin, Germany, 2002. |
|
|
377 | Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1–2):181–234, 2002. |
|
|
376 | Juha Tiihonen, Timo Soininen, Ilkka Niemelä, and Reijo Sulonen. Empirical testing of a weight constraint rule based configurator. In ECAI 2002 Configuration Workshop, pages 17–22, 2002. |
|
|
375 | Markku-Juhani O. Saarinen. Cryptanalysis of lili-128. In Joan Daemen and Vincent Rijmen, editors, Fast Software Encryption 2002, volume 2365 of Lecture Notes in Computer Science, pages 231–236. Springer-Verlag, 2002. |
|
|
374 | Patric R. J. Östergård and Petteri Kaski. Enumeration of 2-(9,3,lambda) designs and their resolutions. Designs, Codes and Cryptography, 27:131–137, 2002. |
|
|
373 | Tomi Janhunen. lpeq 1.13 — A tool for testing the equivalence of logic programs. http://www.tcs.hut.fi/Software/lpeq/, 2002. Computer Program. |
|
2001 |
|
372 | Petteri Kaski. Isomorph-free exhaustive generation of combinatorial designs. Research Report A70, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2001. |
|
|
371 | Marko Mäkelä, Timo Latvala, and Kimmo Varpaaniemi. Maria 1.0—modular reachability analyser. Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, November 2001. Software. |
|
|
370 | Marko Mäkelä. Rinnakkaisuus hallintaan—formaalit menetelmät mutkikkaiden järjestelmien suunnittelun apuna. Prosessori, pages 68–71, November 2001. Erikoisnumero: elektroniikan suunnittelu (ES). |
|
|
369 | Marko Mäkelä and Kimmo Varpaaniemi. lsts2pn — a translator from TVT LSTS files to the input file language of MaRiA. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, September 2001. Software. |
|
|
368 | Keijo Heljanko and Ilkka Niemelä. Bounded LTL model checking with stable models. In Thomas Eiter, Wolfgang Faber, and Mirosaw Truszczynski, editors, Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'2001), volume 2173 of Lecture Notes in Artificial Intelligence, pages 200–212, Vienna, Austria, September 2001. Springer-Verlag. |
|
|
367 | Tommi Syrjänen. Omega-restricted logic programs. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 267–279, Vienna, Austria, September 2001. Springer-Verlag. |
|
|
366 | Tommi Syrjänen and Ilkka Niemelä. The smodels system. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, Vienna, Austria, September 2001. Springer-Verlag. |
|
|
365 | Tomi Janhunen. On the effect of default negation on the expressiveness of disjunctive rules. In Thomas Eiter, Wolfgang Faber, and Mirek Truszczyński, editors, Logic Programming and Nonmonotonic Reasoning, Proceedings of the 6th International Conference, pages 93–106, Vienna, Austria, September 2001. Springer-Verlag. LNAI 2173. |
|
|
364 | Keijo Heljanko. Bounded reachability checking with process semantics. In Kim Guldstrand Larsen and Mogens Nielsen, editors, Proceedings of the 12th International Conference on Concurrency Theory (Concur'2001), volume 2154 of Lecture Notes in Computer Science, pages 218–232, Aalborg, Denmark, August 2001. Springer-Verlag. |
|
|
363 | Tommi Syrjänen. Version spaces and rule-based configuration management. In Working Notes of the IJCAI 2001 Workshop on Configuration, August 2001. |
|
|
362 | Kimmo Varpaaniemi, editor. Annual report for the year 2000. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, July 2001. |
|
|
361 | Marko Mäkelä. A reachability analyser for algebraic system nets. Research Report A69, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2001. |
|
|
360 | Eero Lassila. A tree expansion formalism for generative string rewriting. Technical Report B20, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2001. |
|
|
359 | Marko Mäkelä. Optimising enabling tests and unfoldings of algebraic system nets. In José-Manuel Colom and Maciej Koutny, editors, Application and Theory of Petri Nets 2001: 22nd International Conference, ICATPN 2001, number 2075 in Lecture Notes in Computer Science, pages 283–302, Newcastle upon Tyne, UK, June 2001. Springer-Verlag, Berlin, Germany. |
|
|
358 | Keijo Heljanko, Victor Khomenko, and Maciej Koutny. Parallelisation of the Petri net unfolding algorithm. Technical Report CS-TR-733, Department of Computer Science, University of Newcastle upon Tyne, Newcastle, United Kindom, June 2001. |
|
|
357 | Stefan Brass, Jürgen Dix, Ilkka Niemelä, and T.C. Przymusinski. On the equivalence of the static and disjunctive well-founded semantics and its computation. Theoretical Computer Science, 258(1–2):523–553, May 2001. |
|
|
356 | Javier Esparza and Keijo Heljanko. Implementing LTL model checking with net unfoldings. In Matthew B. Dwyer, editor, Proceedings of the 8th International SPIN Workshop on Model Checking of Software (SPIN'2001), volume 2057 of Lecture Notes in Computer Science, pages 37–56, Toronto, Canada, May 2001. Springer-Verlag. |
|
|
355 | Tomi Janhunen. On the effect of default negation on the expressiveness of disjunctive rules. In Gerhard Brewka, Cees Witteween, and Torsten Schaub, editors, Working Notes of the 5th Dutch-German Workshop on Nonmonotonic Reasoning Techniques and their Applications, pages 102–113, Potsdam, Germany, April 2001. |
|
|
354 | Javier Esparza and Keijo Heljanko. Implementing LTL model checking with net unfoldings. Research Report A68, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, March 2001. |
|
|
353 | Keijo Heljanko and Ilkka Niemelä. Answer set programming and bounded model checking. In Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, pages 90–96, Stanford, USA, March 2001. AAAI Press. |
|
|
352 | Timo Soininen, Ilkka Niemelä, Juha Tiihonen, and Reijo Sulonen. Representing configuration knowledge with weight constraint rules. In Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming, pages 195–201, Stanford, USA, March 2001. AAAI Press. |
|
|
351 | Catharina Candolin, Janne Lundberg, and Hannu Kari. Authorization and privacy protection in organizational ad hoc networks. In Proceedings of the 3rd Nordic Usenix Conference, Stockholm, Sweden, February 2001. |
|
|
350 | Pekka Nikander, Janne Lundberg, Catharina Candolin, and Tuomas Aura. Homeless mobile ipv6. Technical report, Internet Engineering Task Force, February 2001. Internet Draft, work in progress. |
|
|
349 | Lasse 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.3.09 — an advanced tool for efficient reachability analysis. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, February 2001. Software. |
|
|
348 | Timo Latvala. Model checking linear temporal logic properties of Petri nets with fairness constraints. Research Report A67, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, January 2001. |
|
|
347 | Toni Jussila. Bounded Model Checking for Verifying Concurrent Programs. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
|
346 | Maarit Hietalahti. Efficient key agreement for ad-hoc networks. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
|
345 | Jari Katajavuori. An architecture for dynamic software upgrading over-the-air in mobile systems. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
|
344 | Petteri Kaski. Isomorph-free exhaustive generation of combinatorial designs. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
|
343 | Harri Kuusisto. Käyttäjän sähköinen tunnistaminen ja yksityisyys. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, 2001. |
|
|
342 | Rauni Pääkkönen. Implementing a formal agent description language. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
|
341 | Veera Lehtonen. Implementation of a robust electronic voting system. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
|
340 | Viktor Rosendahl. A customized very long intruction word processor for Viterbi decoding. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2001. |
|
|
339 | Janne Olavi Salmi. An adaptive mobility management mechanism for ip networks using ad hoc routing. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, 2001. |
|
|
338 | Kjell Sand. Development of unit and module testing in embedded systems. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2001. |
|
|
337 | Sami Olavi Virtanen. Effective long code generation in WCDMA. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2001. |
|
|
336 | Galina T. Bogdanova, Andries E. Brouwer, Stoian N. Kapralov, and Patric R.J. Östergård. Error-correcting codes over an alphabet of four elements. Designs, Codes and Cryptography, 23(3):333–342, 2001. |
|
|
335 | Galina T. Bogdanova and Patric R.J. Östergård. Bounds on codes over an alphabet of five elements. Discrete Mathematics, 240(1–3):13–19, 2001. |
|
|
334 | Alexander A. Davydov and Patric R.J. Östergård. Linear codes with covering radius  and codimension  . IEEE Transactions on Information Theory, 47(1):416–421, 2001. |
|
|
333 | Alexander A. Davydov and Patric R.J. Östergård. Recursive constructions of complete caps. Journal of Statistical Planning and Inference, 95(1–2):167–173, 2001. |
|
|
332 | T. Aaron Gulliver and Patric R.J. Östergård. Improved bounds for ternary linear codes of dimension 8 using tabu search. Journal of Heuristics, 7(1):37–46, 2001. |
|
|
331 | Patric R.J. Östergård. A new algorithm for the maximum-weight clique problem. Nordic Journal of Computing, 8(4):424–436, 2001. |
|
|
330 | Patric R.J. Östergård. There are 270,474,142 nonisomorphic 2-(9,4,6) designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 37(1):173–176, 2001. |
|
|
329 | Patric R.J. Östergård and Uri Blass. On the size of optimal binary codes of length 9 and covering radius 1. IEEE Transactions on Information Theory, 47(6):2556–2557, 2001. |
|
|
328 | Patric R.J. Östergård and William D. Weakley. Values of domination numbers of the queen's graph. The Electronic Journal of Combinatorics, 8(1), 2001. |
|
|
327 | Tuomas Aura, Pekka Nikander, and Jussipekka Leiwo. DOS-resistant authentication with client puzzles. In B. Christianson, B. Crispo, J.A. Malcolm, and M. Roe, editors, Security Protocols, 8th International Workshop Cambridge, UK, April 2000, Revised Papers, volume 2133 of Lecture Notes in Computer Science, pages 170–177. Springer-Verlag, Berlin, Germany, 2001. |
|
|
326 | Tuomas Aura. DOS-resistant authentication with client puzzles (transcript of discussion). In B. Christianson, B. Crispo, J.A. Malcolm, and M. Roe, editors, Security Protocols, 8th International Workshop Cambridge, UK, April 2000, Revised Papers, volume 2133 of Lecture Notes in Computer Science, pages 178–181. Springer-Verlag, Berlin, Germany, 2001. |
|
|
325 | Marko Mäkelä. lsts2dot—a translator from TVT LSTS files to the input file language of GraphViz. on the World Wide Web, 2001. computer program. |
|
|
324 | Kimmo Varpaaniemi. Minimizing the number of successor states in the stubborn set method. In Ludwik Czaja, editor, Concurrency, Specification and Programming: Proceedings of the CS&P'2001 Workshop, Warsaw, Poland, 3–5 October 2001, pages 279–290. Zakład Graficzny UW, zam. 583/2001, Warsaw, Poland, 2001. |
|
|
323 | Jürgen Dix, Ulrich Furbach, and Ilkka Niemelä. Nonmonotonic reasoning: Towards efficient calculi and implementations. In Andrei Voronkov and Alan Robinson, editors, Handbook of Automated Reasoning, chapter 19, pages 1241–1354. Elsevier Science, Amsterdam, 2001. |
|
|
322 | Keijo Heljanko. punroll 0.3: a bounded reachability checker. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2001. Software. |
|
|
321 | Keijo Heljanko and Patrik Simons. boundsmodels 0.9: a bounded LTL model checker. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2001. Software. |
|
|
320 | Keijo Heljanko and Patrik Simons. unfsmodels 0.9: a LTL model checker using net unfoldings. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2001. Software. |
|
|
319 | Leo Ojala, Teemu Tynjälä, and Harriet Beaver. Modeling Serial Quantum Processors Using High-Level Petri Nets. In Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Informatics - SCI'2001, 2001. |
|
|
318 | Leo Ojala, Elina Parviainen, Olli-Matti Penttinen, Teemu Tynjälä, and Harriet Beaver. Modeling Feynman's Quantum Computer Using Stochastic High-Level Petri Nets. In Proceedings of 2001 IEEE International Conference on Systems, Man & Cybernetics (CD-ROM), pages 2735–2741, 2001. |
|
|
317 | Jiří Šíma and Pekka Orponen. Computing with continuous-time Liapunov systems. In J. S. Vitter, P. Spirakis, and M. Yannakakis, editors, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC'01, Crete, July 2001), pages 722–731, New York NY, 2001. Association for Computing Machinery. |
|
|
316 | Jiří Šíma and Pekka Orponen. Exponential transients in continuous-time symmetric Hopfield nets. In G. Dorffner, H. Bischof, and K. Hornik, editors, Proceedings of Artificial Neural Networks – ICANN 2001 (Vienna, August 2001), volume 2130 of Lecture Notes in Computer Science, pages 806–813, Berlin Heidelberg, 2001. Springer-Verlag. |
|
|
315 | Petteri Kaski and Patric R. J. Östergård. There exists no (15,5,4) RBIBD. Journal of Combinatorial Designs, 9(5):357–362, 2001. |
|
|
314 | Timo Latvala. Model checking LTL properties of high-level petri nets with fairness constraints. In J-M. Colom and M. Koutny, editors, Application and Theory of Petri Nets, pages 242–262, Berlin, 2001. Springer. [Copyright © Springer-Verlag] |
|
|
313 | Leo Ojala, Teemu Tynjälä, and Harriet Beaver. Modelling Serial Quantum Processors Using Petri Nets. In World Multiconference on Systemics, Cybernetics and Informatics SCI 2001, volume 14, 2001. |
|
|
312 | Leo Ojala, Elina Parviainen, Olli-Matti Penttinen, Harriet Beaver, and Teemu Tynjälä. Modelling Feynman's Quantum Computer Using Stochastic High Level Petri Nets. In Systems, Man and Cybernetics (SMC 2001), 2001. This article appears only in the CD-ROM version of the proceedings. |
|
|
311 | Leo Ojala, Nisse Husberg, and Teemu Tynjälä. Modelling and Analysing a Distributed Dynamic Channel Allocation Algorithm for Mobile Computing Using High-Level Net Methods. Software Tools for Technology Transfer, 3, 2001. |
|
|
310 | Tommi A. Junttila. Computational complexity of the Place/Transition-net symmetry reduction method. Journal of Universal Computer Science, 7(4):307–326, 2001. |
|
|
309 | Tommi Junttila. BCSat 0.3 - a satisfiability checker for boolean circuits. Computer program, 2001. |
|
2000 |
|
308 | Heikki Tauriainen. Automated testing of Büchi automata translators for linear temporal logic. Research Report A66, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 2000. |
|
|
307 | Tuomas Aura. Authorization and availability - aspects of open network security. Research Report A64, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2000. Doctoral dissertation. |
|
|
306 | Harri Haanpää. Computational methods for Ramsey numbers. Research Report A65, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, November 2000. |
|
|
305 | Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä (Eds.). Leksa notes in computer science. Research Report A63, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, October 2000. |
|
|
304 | Marko Mäkelä. Modular reachability analyser. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Leksa Notes in Computer Science: Festschrift in Honour of Professor Leo Ojala, pages 75–85. Helsinki University of Technology, October 2000. |
|
|
303 | Marko Mäkelä. Applying compiler techniques to reachability analysis of high-level models. In Hans-Dieter Burkhard, Ludwik Czaja, Andrzej Skowron, and Peter Starke, editors, Workshop on Concurrency, Specification & Programming 2000, number 140 in Informatik-Bericht, pages 129–142. Humboldt-Universität zu Berlin, Germany, October 2000. |
|
|
302 | Silja Mäki, Tuomas Aura, and Maarit Hietalahti. Robust membership management for ad-hoc groups. In Proc. 5th Nordic Workshop on Secure IT Systems (NORDSEC 2000), Reykjavik, Iceland, October 2000. |
|
|
301 | Kimmo Varpaaniemi. Modelling of a PLC-based railway traffic control system. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Leksa Notes in Computer Science: Festschrift in Honour of Professor Leo Ojala, number HUT-TCS-A63 in HUT-TCS Research Reports, pages 131–140. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, October 2000. |
|
|
300 | Eero Lassila. On tree belts and belt-selectors. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Lexa Notes in Computer Science: Festschrift in Honour of Professor Leo Ojala, pages 47–58. Helsinki University of Technology, Laboratory for Theoretical Computer Science, October 2000. |
|
|
299 | Tomi Janhunen. Specifying agent-based systems with nets and logic programs. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Leksa Notes in Computer Science: Festschrift in Honour of Professor Leo Ojala, pages 33–46, Espoo, October 2000. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Research Reports HUT-TCS-A63. |
|
|
298 | Tomi Janhunen. Capturing stationary and regular extensions with Reiter's extensions. In Manuel Ojeda-Aciego et al., editors, Logics in Artificial Intelligence, European Workshop, JELIA 2000, pages 102–117, Málaga, Spain, September/October 2000. Springer-Verlag. LNAI 1919. |
|
|
297 | Marko Mäkelä. Maria: Modular reachability analyzer for high-level Petri nets. In The 5th Workshop on Discrete Event Systems (WODES 2000), pages 477–478, Ghent, Belgium, August 2000. Kluwer Academic Publishers, Boston, MA, USA. |
|
|
296 | Kimmo Varpaaniemi. Stable models for stubborn sets. Fundamenta Informaticae (Annales Societatis Mathematicae Polonae, Series IV), 43(1–4):355–375, August 2000. IOS Press, Amsterdam, The Netherlands. |
|
|
295 | Timo Soininen, Ilkka Niemelä, Juha Tiihonen, and Reijo Sulonen. Unified configuration knowledge representation using weight constraint rules. In Workshop Notes of the ECAI'2000 Configuration Workshop, pages 79–84, Berlin, Germany, August 2000. |
|
|
294 | Keijo Heljanko. Model checking with finite complete prefixes is PSPACE-complete. In Catuscia Palamidessi, editor, Proceedings of the 11th International Conference on Concurrency Theory (Concur'2000), volume 1877 of Lecture Notes in Computer Science, pages 108–122, State College, Pennsylvania, USA, August 2000. Springer-Verlag. |
|
|
293 | Tommi Syrjänen. Optimizing configurations. In Proceedings of the ECAI Workshop W02 on Configuration, pages 85 – 90, Berlin, Germany, August 2000. |
|
|
292 | Javier Esparza and Keijo Heljanko. A new unfolding approach to LTL model checking. In Ugo Montanari, José D. P. Rolim, and Emo Welzl, editors, Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), volume 1853 of Lecture Notes in Computer Science, pages 475–486, Geneva, Switzerland, July 2000. Springer-Verlag. |
|
|
291 | Tommi A. Junttila and Ilkka Niemelä. Towards an efficient tableau method for Boolean circuit satisfiability checking. In John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luís Moniz Pereira, Yehoshua Sagiv, and Peter J. Stuckey, editors, Computational Logic – CL 2000; First International Conference, volume 1861 of Lecture Notes in Artificial Intelligence, pages 553–567, London, UK, July 2000. Springer, Berlin. |
|
|
290 | Tommi Syrjänen. Including diagnostic information in configuration models. In Proceedings of the First International Conference on Computational Logic, London, UK, July 2000. Springer-Verlag. |
|
|
289 | Tomi Janhunen. Comparing the expressive powers of some syntactically restricted classes of logic programs. In John Lloyd et al., editors, Computational Logic, First International Conference, pages 852–866, London, UK, July 2000. Springer-Verlag. LNAI 1861. |
|
|
288 | Kari J. Nurmela and Patric R. J. Östergård. Covering a square with up to 30 equal circles. Research Report A62, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, June 2000. |
|
|
287 | Marko Mäkelä. Condensed storage of multi-set sequences. In Kurt Jensen, editor, Practical Use of High-Level Petri Nets, number 547 in DAIMI report PB, pages 111–125. University of Århus, Denmark, June 2000. |
|
|
286 | Marko Mäkelä. Maria: Modular reachability analyser for high-level Petri nets. In Kjeld Mortensen, editor, Petri Nets 2000: Tool Demonstrations, pages 59–63, Århus, Denmark, June 2000. University of Århus. |
|
|
285 | Patrik Simons. Extending and implementing the stable model semantics. Research Report A58, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. Doctoral dissertation. |
|
|
284 | Tommi Junttila. Computational complexity of the place/transition-net symmetry reduction method. Research Report A59, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. |
|
|
283 | Javier Esparza and Keijo Heljanko. A new unfolding approach to LTL model checking. Research Report A60, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. |
|
|
282 | Tuomas Aura and Carl Ellison. Privacy and accountability in certificate systems. Research Report A61, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, April 2000. |
|
|
281 | Maarit Hietalahti, Fabio Massacci, and Ilkka Niemelä. DES: a challenge problem for nonmonotonic reasoning systems. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (cs.AI/0003073), Breckenridge, Colorado, USA, April 2000. cs.AI/0003039. |
|
|
280 | Ilkka Niemelä, Patrik Simons, and Tommi Syrjänen. Smodels: a system for answer set programming. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (cs.AI/0003073), Breckenridge, Colorado, USA, April 2000. cs.AI/0003033. |
|
|
279 | Tomi Janhunen, Ilkka Niemelä, Patrik Simons, and Jia-Huai You. Unfolding partiality and disjunctions in stable model semantics. In Anthony Cohn, Fausto Giunchiglia, and Bart Selman, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 7th International Conference, pages 411–419, Breckenridge, Colorado, April 2000. Morgan Kaufmann. |
|
|
278 | Harri Haanpää. Computational Methods for Ramsey Numbers. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2000. |
|
|
277 | Marko Mäkelä. A Reachability Analyzer for Algebraic System Nets. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2000. |
|
|
276 | Mika Jalkanen. Sales statistics process - formal specification and implementation. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2000. |
|
|
275 | Teijo Kuoppala. Junan tiedonsiirtoverkkoon kuuluvien reaaliaikaprotokollien mallintaminen ja analysointi verkkoteoreettisin menetelmin. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2000. |
|
|
274 | Timo Latvala. Model checking linear temporal logic properties of Petri nets with fairness constraints. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 2000. |
|
|
273 | Heikki Tauriainen. Automated testing of Büchi automata translators for linear temporal logic. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2000. |
|
|
272 | Tuomas Aura and Johan Lilius. A causal semantics for time petri nets. Theoretical Computer Science, 243(1–2):409–447, 2000. |
|
|
271 | Alexander Davydov and Patric R.J. Östergård. New quaternary linear codes with covering radius 2. Finite Fields and Their Applications, 6(2):164–174, 2000. |
|
|
270 | Alexander Davydov and Patric R.J. Östergård. On saturating sets in small projective geometries. European Journal of Combinatorics, 21(5):563–570, 2000. |
|
|
269 | T. Aaron Gulliver and Patric R.J. Östergård. New binary linear codes. Ars Combinatoria, 56(1):105–112, 2000. |
|
|
268 | Filip Karlemo and Patric R.J. Östergård. On sliding block puzzles. Journal of Combinatorial Mathematics and Combinatorial Computing, 34(1):97–107, 2000. |
|
|
267 | Kari J. Nurmela. Conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles. Experimental Mathematics, 9(1):241–250, 2000. |
|
|
266 | Patric R.J. Östergård. Classification of binary/ternary one-error correcting codes. Discrete Mathematics, 223(1–3):253–262, 2000. |
|
|
265 | Patric R.J. Östergård. Enumeration of  designs. The Australasian Journal of Combinatorics, 22(1):227–231, 2000. |
|
|
264 | Patric R.J. Östergård. Computer search for small complete caps. Journal of Geometry, 69(1–2):172–179, 2000. |
|
|
263 | Patric R.J. Östergård and William D. Weakley. Classification of binary covering codes. Journal of Combinatorial Designs, 8(6):391–401, 2000. |
|
|
262 | Nisse Husberg. 30 years: From digital filters to high level petri nets. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Leksa Notes in Computer Science, Festschrift in Honour of Professor Leo Ojala, pages 21–31. Helsinki University of Technology, 2000. |
|
|
261 | Tuomas Aura Matt Bishop and Dean Sniegowski. Analyzing single-server network inhibition. In Proceedings of the 2000 IEEE Computer Security Foundations Workshop, pages 108–117. IEEE Computer Society Press, Los Alamitos CA, USA, 2000. |
|
|
260 | John R. Hughes, Tuomas Aura, and Matt Bishop. Using conservation of flow as a security mechanism in network protocols. In Proceedings of the 2000 IEEE Symposium on Security and Privacy, pages 132–141. IEEE Computer Society Press, Los Alamitos CA, USA, 2000. |
|
|
259 | Jussipekka Leiwo, Pekka Nikander, and Tuomas Aura. Towards network denial of service resistant protocols. In S. Qing and J.H.P. Eloff, editors, Information Security for Global Information Infrastructures, volume 175 of IFIP Series. Kluwer Academic Publishers, Boston MA, USA, 2000. |
|
|
258 | Marko Mäkelä, Kimmo Varpaaniemi, and Timo Latvala. Maria: The modular reachability analyzer. on the World Wide Web, 2000. computer program. |
|
|
257 | Lasse 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.3.08 — an advanced tool for efficient reachability analysis. Laboratory for Theoretical Computer Science, Helsinki University of Technology, Espoo, Finland, 2000. Software. |
|
|
256 | Harri Haanpää. A lower bound for a Ramsey number. Congressus Numerantium, 144:189–191, 2000. |
|
|
255 | Ilkka Niemelä and Patrik Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, chapter 21, pages 491–521. Kluwer Academic Publishers, 2000. |
|
|
254 | Ilkka Niemelä. Stable model semantics: From theory to implementations and applications. Lecture notes for a tutorial given at the First International Conference on Computational Logic, Imperial College, London, UK, July 24–28, 2000. 72 pages., 2000. |
|
|
253 | Ilkka Niemelä and Mirosław Truszczyński. Practical tools for knowledge representation and nonmonotonic reasoning. Lecture notes for a tutorial given at the 17th National Conference on Artificial Intelligence, Austin, Texas, July 30–August 3, 2000. 166 pages. Available at http://www.tcs.hut.fi/ ini/, 2000. |
|
|
252 | Timo Soininen, Ilkka Niemelä, Juha Tiihonen, and Reijo Sulonen. Unified configuration knowledge representation using weight constraint rules. Technical Report TKO-B149, Helsinki University of Technology, Laboratory of Information Processing Science, Helsinki, Finland, 2000. |
|
|
251 | Keijo Heljanko and Ilkka Niemelä. Petri net analysis and nonmonotonic reasoning. In Nisse Husberg, Tomi Janhunen, and Ilkka Niemelä, editors, Leksa Notes in Computer Science, Festschrift in Honour of Professor Leo Ojala, pages 7–19. Helsinki University of Technology, Laboratory for Theoretical Computer Science, 2000. |
|
|
250 | Miia Hermelin. Cryptographic properties of the bluetooth combination generator. Master's thesis, Helsinki University of Technology, 2000. |
|
|
249 | Timo Latvala and Keijo Heljanko. Coping with strong fairness. Fundamenta Informaticae, 43(1–4):175–193, 2000. |
|
|
248 | Linfeng Yang, Jouni Karvo, Teemu Tynjälä, and Hannu Kari. Threshold-Based Registration (TBR) in Mobile IPv6. In IFIP-TC/6 European Commission NETWORKING 2000 International Workshop MWCN 2000, 2000. |
|
|
247 | Leo Ojala, Nisse Husberg, and Teemu Tynjälä. Modelling and Analysing a Distributed Dynamic Channel Allocation Algorithm for Mobile Computing Using High-Level Net Methods. In Workshop on Practical Use of High-Level Petri Nets (ICATPN'2000), 2000. |
|
|
246 | Nisse Husberg, Teemu Tynjälä, and Kimmo Varpaaniemi. Modelling and Analysing the SDL Description of the ISDN-DSS1 Protocol. In 21st International Conference on Applications and Theory of Petri Nets, 2000. |
|
|
245 | Teijo Kuoppala, Nisse Husberg, and Teemu Tynjälä. Modelling and Analysis of TCN Standard Message Transport Protocol by Net-Theoretical Methods. In World Multiconference on Systemics, Cybernetics and Informatics SCI 2000, volume 8, 2000. |
|
|
244 | Leo Ojala, Nisse Husberg, and Teemu Tynjälä. Modelling a Distributed Wireless Channel Allocation Algorithm for Cellular Systems with Mobile Base Stations Using Predicate/Transition Nets. In World Multiconference on Systemics, Cybernetics and Informatics SCI 2000, volume 8, 2000. |
|
1999 |
|
243 | Tommi Syrjänen. A rule-based formal model for software configuration. Research Report A55, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, December 1999. |
|
|
242 | Keijo Heljanko. Deadlock and reachability checking with finite complete prefixes. Research Report A56, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, December 1999. |
|
|
241 | Tommi Junttila. Detecting and exploiting data type symmetries of algebraic system nets during reachability analysis. Research Report A57, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, December 1999. |
|
|
240 | Ilkka Niemelä, Patrik Simons, and Timo Soininen. Stable model semantics of weight constraint rules. In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 317–331, El Paso, Texas, USA, December 1999. Springer-Verlag. |
|
|
239 | Tomi Janhunen. Classifying semi-normal default logic on the basis of its expressive power. In Michael Gelfond, Nicola Leone, and Gerald Pfeifer, editors, Proceedings of the 5th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR'99, pages 19–33, El Paso, Texas, December 1999. Springer-Verlag. LNAI 1730. |
|
|
238 | Timo Soininen, Esther Gelle, and Ilkka Niemelä. A fixpoint definition of dynamic constraint satisfaction. In Joxan Jaffar, editor, Proceedings of the Fifth International Conference on Principles and Practice of Constraint Programming, pages 419–433, Alexandria, Virginia, USA, October 1999. Springer-Verlag. |
|
|
237 | Keijo Heljanko. Minimizing finite complete prefixes. In H.-D. Burkhard, L. Czaja, H.-S. Nguyen, and P. Starke, editors, Proceedings of the Workshop Concurrency, Specification & Programming 1999, pages 83–95, Warsaw, Poland, September 1999. Warsaw University. |
|
|
236 | Timo Latvala and Keijo Heljanko. Coping with strong fairness – on-the-fly emptiness checking for streett automata. In H.-D. Burkhard, L. Czaja, H-S. Nguyen, and P. Starke, editors, Concurrency, Specification & Programming Workshop, pages 107–118, Warsaw, Poland, September 1999. Institute of Informatics, Warsaw University. |
|
|
235 | Antti Huima. Analysis of cryptographic protocols via symbolic state space enumeration. Research Report A54, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, August 1999. |
|
|
234 | Harriet Beaver and Ilkka Niemelä. Finding MAPs for belief networks using rule-based constraint programming. In Arpakannus 1/99 - Special Issue on Networks'99, Espoo, Finland, Aug 1999. Finnish Articial Intelligence Society. |
|
|
233 | Ilkka Niemelä. On the complexity of dynamic constraint satisfaction. In Proceedings of the FLoC Workshop on Complexity-Theoretic and Recursion-Theoretic Methods in Databases, Artificial Intelligence and Finite Model Theory, pages 38–47, Trento, Italy, July 1999. |
|
|
232 | Antti Huima. Analysis of cryptographic protocols via symbolic state space enumeration. Master's thesis, Helsinki University of Technology, May 1999. [This thesis was nominated the best Master's Thesis on the area of Computer Science by The Finnish Society for Computer Science in 1999.] |
|
|
231 | Tommi A. Junttila. Finding symmetries of algebraic system nets. Fundamenta Informaticae, 37(3):269–289, February 1999. |
|
|
230 | Tommi Junttila. Detecting and Exploiting Data Type Symmetries of Algebraic System Nets during Reachability Analysis. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 1999. |
|
|
229 | Keijo Heljanko. Deadlock and Reachability Checking with Finite Complete Prefixes. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 1999. |
|
|
228 | Antti Huima. Analysis of cryptographic protocols via symbolic state space enumeration. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 1999. |
|
|
227 | Ismo Kangas. Luotettava tiedonsiirto matkaviestimen ja pakettikytkentäisen digitaalisen GSM-matkapuhelinverkon välillä. Master's thesis, Helsinki University of Technology, Department of Electrical and Commucations Engineering, 1999. |
|
|
226 | Janne Palonen. Controlling and monitoring a distributed ISP environment. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 1999. |
|
|
225 | Tommi Syrjänen. A rule-based formal model for software configuration. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 1999. |
|
|
224 | Kimmo Varpaaniemi. Stable models for stubborn sets. In Hans-Dieter Burkhard, Ludwik Czaja, Hung Son Nguyen, and Peter H. Starke, editors, Concurrency, Specification and Programming: Proceedings of the CS&P'99 Workshop, Warsaw, Poland, 28–30 September 1999, pages 263–274. Zakład Graficzny UW, zam. 482/99, Warsaw, Poland, 1999. |
|
|
223 | Timo Soininen and Ilkka Niemelä. Developing a declarative rule language for applications in product configuration. In Proceedings of the First International Workshop on Practical Aspects of Declarative Languages, pages 305–319, San Antonio, Texas, January 1999. Springer-Verlag. |
|
|
222 | Ilkka Niemelä. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241–273, 1999. |
|
|
221 | Ilkka Niemelä. Automating default reasoning. Lecture notes for a course given at the 11th European Summer School in Logic, Language and Information, Utrecht University, Aug 16–20, 1999. 25 pages., 1999. |
|
|
220 | Keijo Heljanko and Patrik Simons. mcsmodels 1.4: a deadlock and reachability checker using net unfoldings. Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 1999. Software. |
|
|
219 | Keijo Heljanko. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae, 37(3):247–268, 1999. |
|
|
218 | Keijo Heljanko. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. In Rance Cleaveland, editor, Proceedings of 5th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), volume 1579 of Lecture Notes in Computer Science, pages 240–254, Amsterdam, Netherlands, 1999. Springer-Verlag. |
|
|
217 | Tomi Janhunen. On the intertranslatability of non-monotonic logics. Annals of Mathematics and Artificial Intelligence, 27(1-4):79–128, 1999. Special issue with the selected best papers from JELIA 1998. |
|
1998 |
|
216 | Marko Mäkelä, Jani Lahtinen, and Leo Ojala. Performance analysis of a traffic control system using stochastic Petri nets. Technical Report B19, Helsinki University of Technology, Digital Systems Labora tory, Espoo, Finland, December 1998. |
|
|
215 | Teemu Tynjälä. Reachability-based verification of dss1 protocol. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, December 1998. |
|
|
214 | Tommi Syrjänen. Implementation of local grounding for logic programs with stable model semantics. Technical Report B18, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, October 1998. |
|
|
213 | Tomi Janhunen. On the intertranslatability of autoepistemic, default and priority logics, and parallel circumscription. In Jürgen Dix, Luis Farińas del Cerro, and Ulrich Furbach, editors, Proceedings of the 6th European Workshop on Logics in Artificial Intelligence, JELIA'98, pages 216–232, Dagstuhl, Germany, October 1998. Springer-Verlag. LNAI 1489. |
|
|
212 | Keijo Heljanko. Deadlock checking for complete finite prefixes using logic programs with stable model semantics (Extended abstract). In H.-D. Burkhard, L. Czaja, and P. Starke, editors, Proceedings of the Workshop Concurrency, Specification & Programming 1998, Informatik-Bericht Nr. 110, pages 106–115, Berlin, Germany, September 1998. Humboldt-University, Berlin. |
|
|
211 | Jürgen Dix, Ulrich Furbach, and Ilkka Niemelä. Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations. Fachbericht Informatik 20–98, Universität Koblenz-Landau, August 1998. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/. |
|
|
210 | S. Brass, J. Dix, Ilkka Niemelä, and T.C. Przymusinski. A comparison of the static and the disjunctive well-founded semantics and its implementation. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning, pages 74–85, Trento, Italy, June 1998. Morgan Kaufmann Publishers. |
|
|
209 | Kimmo Varpaaniemi. On the stubborn set method in reduced state space generation. Research Report A51, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, May 1998. Doctoral dissertation. |
|
|
208 | Ilkka Niemelä and Torsten Schaub (Eds.). Proceedings of the workshop on computational aspects of nonmonotonic reasoning. Research Report A52, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, May 1998. |
|
|
207 | Ilkka Niemelä and Torsten Schaub, editors. Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, Trento, Italy, May 1998. Helsinki University of Technology, Digital Systems Laboratory, Research Report A52. |
|
|
206 | Ilkka Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. In Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72–79. Helsinki University of Technology, Digital Systems Laboratory, Research Report A52, May 1998. |
|
|
205 | Tomi Janhunen. Non-monotonic systems: A framework for analyzing semantics and structural properties of NMR. Research Report A49, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, March 1998. Doctoral dissertation. |
|
|
204 | Ilkka Niemelä (Ed.). Proceedings of the HeCSE workshop on emerging technologies in distributed systems. Research Report A50, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, March 1998. |
|
|
203 | Tomi Janhunen. Non-Monotonic Systems: A Framework for Analyzing Semantics and Structural Properties of Non-Monotonic Reasoning. PhD thesis, Helsinki University of Technology, Department of Computer Science and Engineering, March 1998. |
|
|
202 | Stefan Rönn. Semantics of semaphores. Research Report A53, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, 1998. |
|
|
201 | Tommi Junttila. Enabling broadband services. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1998. |
|
|
200 | Tapio Manner. Extending verification of industrial TNSDL programs with formal methods by using EMMA. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1998. |
|
|
199 | Marko Mäkelä. Implementing the front-end of an SDL compiler. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1998. |
|
|
198 | Teemu Tynjälä. Reachability-based verification of DSSI protocol. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1998. |
|
|
197 | Kimmo Varpaaniemi. On stubborn sets in the verification of linear time temporal properties. In Jörg Desel and Manuel Silva, editors, Application and Theory of Petri Nets 1998: 19th International Conference, ICATPN'98, Lisbon, Portugal, June 22–26, 1998, Proceedings, volume 1420 of Lecture Notes in Computer Science, pages 124–143. Springer-Verlag, Berlin, Germany, 1998. © Springer-Verlag Berlin Heidelberg 1998. |
|
|
196 | Ilkka Niemelä, editor. Proceedings of the HeCSE Workshop on Emerging Technologies in Distributed Systems, Lammi, Finland, Jan 1998. Helsinki University of Technology, Digital Systems Laboratory, Research Report A50. |
|
|
195 | Timo Soininen and Ilkka Niemelä. Formalizing configuration knowledge using rules with choices. Technical Report TKO-B142, Helsinki University of Technology, Laboratory of Information Processing Science, 1998. Presented at the Workshop on Formal Aspects and Applications of Nonmonotonic Reasoning, May 31, 1998, Trento, Italy. |
|
|
194 | Gerd Brewka and Ilkka Niemelä. Report on the Seventh International Workshop on Nonmonotonic Reasoning. AI Magazine, 19(4):139, 1998. |
|
|
193 | Tommi A. Junttila. Towards well-formed algebraic system nets. In H.-D. Burkhard, L. Czaja, and P. Starke, editors, Workshop Concurrency, Specification & Programming, number 110 in Informatik-Berichte, pages 116–127. Institut für Informatik, Humboldt-Universität zu Berlin, 1998. |
|
1997 |
|
192 | Tuomas Aura. On the structure of delegation networks. Research Report A48, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1997. |
|
|
191 | Kari J. Nurmela. Constructing Spherical Codes by Global Optimization Methods. Doctoral dissertation, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, November 1997. |
|
|
190 | Patrik Simons. Towards constraint satisfaction through logic programs and the stable model semantics. Research Report A47, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, August 1997. |
|
|
189 | Ilkka Niemelä and P. Simons. Smodels – an implementation of the stable model and well-founded semantics for normal logic programs. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pages 420–429, Dagstuhl, Germany, July 1997. Springer-Verlag. |
|
|
188 | C. Aravindan, J. Dix, and Ilkka Niemelä. DisLoP: Towards a disjunctive logic programming system. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, pages 341–352, Dagstuhl, Germany, July 1997. Springer-Verlag. |
|
|
187 | Tomi Janhunen. Separating disbeliefs from beliefs in autoepistemic reasoning. In Jürgen Dix, Ulrich Furbach, and Anil Nerode, editors, Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR'97, pages 132–151, Dagstuhl, Germany, July 1997. Springer-Verlag. LNAI 1265. |
|
|
186 | Keijo Heljanko. Model checking the branching time temporal logic CTL. Research Report A45, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, May 1997. |
|
|
185 | Tuomas Aura. Stateless connections. Research Report A46, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, May 1997. |
|
|
184 | Johan Lilius, editor. Annual report for the year 1996. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, May 1997. |
|
|
183 | Markus Malmqvist. Methodology of dynamical analysis of SDL programs using predicate/transition nets. Technical Report B16, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, April 1997. |
|
|
182 | Tero Jyrinki. Dynamical analysis of SDL programs using predicate/transition nets. Technical Report B17, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, April 1997. |
|
|
181 | Karsten Schmidt. Applying reduction rules to algebraic Petri nets. Research Report A44, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, March 1997. |
|
|
180 | Kari J. Nurmela. Minimum-energy point charge configurations on a circular disk. Research Report A43, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, February 1997. |
|
|
179 | S. Brass, J. Dix, Ilkka Niemelä, and T.C. Przymusinski. Comparison and efficient computation of the static and the disjunctive WFS. In Proceedings of the Third Dutch-German Workshop on Nonmonotonic Reasoning, pages 37–42, Max Planck Institute for Computer Science, Saarbrücken, Germany, February 1997. |
|
|
178 | Antti Huima. Security flaws in popular security software: Lessons learned from problems in SSH-1.2.17 and older. In Proc. NORDSEC '97, 1997. |
|
|
177 | Antti Huima and Tuomas Aura. Using a multimodal logic to express conflicting interests in security protocols. In Proc. DIMACS Workshop on Design and Formal Verification of Security Protocols, 1997. Proceedings were published in electronic form (CD) only. |
|
|
176 | Eero Lassila. Towards optimizing code generation by domain-sensitive macro expansion. Research Report A42, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, January 1997. |
|
|
175 | Patrik Simons. Towards Constraint Satisfaction through Logic Programs and the Stable Model Semantics. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1997. |
|
|
174 | Eero Lassila. Towards Optimizing Code Generation by Domain-Sensitive Macro Expansion. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1997. |
|
|
173 | Tuomas Aura. On the Structure of Delegation Networks. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1997. |
|
|
172 | Keijo Heljanko. Model checking the branching time temporal logic CTL. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1997. |
|
|
171 | Tero Jyrinki. Dynamical analysis of SDL programs with predicate/transition nets. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 1997. |
|
|
170 | Markus Malmqvist. Methodology of dynamical analysis of SDL programs using predicate/transition nets. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1997. |
|
|
169 | Kimmo Varpaaniemi, Keijo Heljanko, and Johan Lilius. PROD 3.2 — an advanced tool for efficient reachability analysis. In Orna Grumberg, editor, Computer Aided Verification: 9th International Conference, CAV'97, Haifa, Israel, June 22–25, 1997, Proceedings, volume 1254 of Lecture Notes in Computer Science, pages 472–475. Springer-Verlag, Berlin, Germany, 1997. |
|
|
168 | Eero Lassila. A functional macro expansion system for optimizing code generation: Gaining context-sensitivity without losing confluence. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, page 315. ACM Press, 1997. |
|
|
167 | C. Aravindan, J. Dix, and Ilkka Niemelä. DisLoP: A Research Project on Disjunctive Logic Programming. Fachberichte Informatik 1–97, Universität Koblenz-Landau, 1997. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/. |
|
|
166 | C. Aravindan, J. Dix, and Ilkka Niemelä. DisLoP: A research project on disjunctive logic programming. AI Communications, 10(3,4):151–165, 1997. |
|
|
165 | C. Aravindan, J. Dix, and Ilkka Niemelä. DisLoP: A research project on disjunctive logic programming. Computational Logic, 3(2), 1997. |
|
1996 |
|
164 | Jussi Rintanen. Lexicographic ordering as a basis of priorities in default reasoning. Research Report A41, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1996. Doctoral dissertation. |
|
|
163 | Tino Pyssysalo, Leo Ojala, and Olli-Matti Penttinen. Performance analysis of a video on demand systems using stochastic Petri nets, a case study. Research Report A40, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1996. |
|
|
162 | P. Baumgartner, U. Furbach, and Ilkka Niemelä. Hyper tableaux. In José Júlio Alferes, Luís Moniz Pereira, and Ewa Orlowska, editors, Proceedings of the European Workshop on Logics in Artificial Intelligence (JELIA'96), pages 1–17, Èvora, Portugal, September/October 1996. Springer-Verlag. |
|
|
161 | Ilkka Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 289–303, Bonn, Germany, September 1996. The MIT Press. |
|
|
160 | C. Aravindan, P. Baumgartner, J. Dix, U. Furbach, G. Neugebauer, Ilkka Niemelä, D. Schäfer, and F. Stolzenburg. On merging theorem proving and logic programming paradigms. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, page 546, Bonn, Germany, September 1996. The MIT Press. |
|
|
159 | C. Aravindan, P. Baumgartner, J. Dix, U. Furbach, G. Neugebauer, Ilkka Niemelä, D. Schäfer, and F. Stolzenburg. On merging theorem proving and logic programming paradigms. In N.E. Fuchs and U. Geske, editors, Proceedings of the Poster Session at JICSLP'96, pages 99–122, Bonn, Germany, September 1996. GMD—Forschungszentrum Informationstechnik. GMD-Studien Nr. 296. |
|
|
158 | Keijo Heljanko. Implementing a CTL model checker. In L. Czaja, P. Starke, H.-D. Burkhard, and M. Lenz, editors, Proceedings of the Workshop Concurrency, Specification & Programming 1996, Informatik-Bericht Nr. 69, pages 75–84, Berlin, Germany, September 1996. Humboldt-University, Berlin. |
|
|
157 | Tuomas Aura. Time processes of time Petri nets. Research Report A38, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1996. |
|
|
156 | Karsten Schmidt. How to calculate symbolically siphons and traps for some algebraic Petri nets. Research Report A39, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1996. |
|
|
155 | Johan Lilius, editor. Annual report for the year 1995. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, August 1996. |
|
|
154 | Ilkka Niemelä. Implementing circumscription using a tableau method. In Proceedings of the European Conference on Artificial Intelligence, pages 80–84, Budapest, Hungary, August 1996. John Wiley. |
|
|
153 | Ilkka Niemelä, editor. Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, Budapest, Hungary, August 1996. Universität Koblenz-Landau, Fachbericht Informatik 18–96. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/. |
|
|
152 | Tomi Janhunen. Representing autoepistemic introspection in terms of default rules. In Wolfgang Wahlster, editor, Proceedings of the 12th European Conference on Artificial Intelligence, ECAI'96, pages 70–74, Budapest, Hungary, August 1996. John Wiley & Sons. |
|
|
151 | Tomi Janhunen. On abstracting decision procedures for non-monotonic reasoning. In Ilkka Niemelä, editor, Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems, pages 29–31, August 1996. Universität Koblenz-Landau, Institut für Informatik, Fachberichte Informatik, 18–96. |
|
|
150 | Ilkka Niemelä. A tableau calculus for minimal model reasoning. In Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, pages 278–294, Terrasini, Italy, May 1996. Springer-Verlag. |
|
|
149 | Tino Pyssysalo. An induction theorem for ring protocols of processes described with predicate/transition nets. Research Report A37, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, April 1996. |
|
|
148 | Eero Lassila. ReFlEx — an experimental tool for special-purpose processor code generation. Technical Report B15, Helsinki University of Technology, Digital Systems Labora tory, Espoo, Finland, March 1996. |
|
|
147 | Tino Pyssysalo. An Induction Theorem for Ring Protocols of Processes Describes Using Predicate/Transition Nets. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1996. |
|
|
146 | Tuomas Aura. Time processes of time petri nets. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1996. |
|
|
145 | Jukka Helme. Yhteyspohjaisten tietoliikenneprotokollien mallintamisesta ja analysoinnista. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 1996. |
|
|
144 | Asko Nykänen. Suomenkielen lauseenjäsennysympäristön suunnittelu ja toteutus. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 1996. |
|
|
143 | Mervi Salmi-Saarinen. A study of wireless communication. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 1996. |
|
|
142 | Kimmo Varpaaniemi. Finding small stubborn sets automatically. In Volkan Atalay, Uğur Halıcı, Kemal İnan, Neşe Yalabık, and Adnan Yazıcı, editors, Proceedings of the Eleventh International Symposium on Computer and Information Sciences, ISCIS XI, November 6–8, 1996, Antalya, Turkey, Volume I, pages 133–142. Middle East Technical University, Ankara, Turkey, 1996. |
|
|
141 | Eero Lassila. A macro expansion approach to embedded processor code generation. In Proceedings of the 22nd Euromicro Conference, pages 136–142. IEEE Computer Society Press, 1996. |
|
|
140 | Ilkka Niemelä. A tableau calculus for minimal model reasoning. Fachbericht Informatik 5–96, Universität Koblenz-Landau, 1996. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/. |
|
|
139 | Ilkka Niemelä. Implementing circumscription using a tableau method. Fachbericht Informatik 6–96, Universität Koblenz-Landau, 1996. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/. |
|
|
138 | Ilkka Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. Fachbericht Informatik 7–96, Universität Koblenz-Landau, 1996. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/. |
|
|
137 | P. Baumgartner, U. Furbach, and Ilkka Niemelä. Hyper tableaux. Fachbericht Informatik 8–96, Universität Koblenz-Landau, 1996. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/. |
|
|
136 | Ilkka Niemelä. Autoepistemic logic as a basis for automating nonmonotonic reasoning. In Patrick Doherty, editor, Partiality, Modality and Non-monotonicity, pages 251–289. CSLI Publications, Stanford, CA, 1996. |
|
|
135 | S. Brass, J. Dix, Ilkka Niemelä, and T.C. Przymusinski. A comparison of STATIC semantics with D-WFS. Fachbericht Informatik 2–96, Universität Koblenz-Landau, 1996. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/. |
|
|
134 | Ilkka Niemelä (Ed.). Proceedings of the ECAI'96 Workshop on Integrating Nonmonotonicity into Automated Reasoning Systems. Fachbericht Informatik 18–96, Universität Koblenz-Landau, 1996. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/. |
|
|
133 | Kaisa Nyberg and Rainer A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. Designs, Codes and Cryptography, 7(1–2):61–81, 1996. |
|
1995 |
|
132 | Tino Pyssysalo and Leo Ojala. A high-level net model of a video on demand system. Research Report A36, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, December 1995. |
|
|
131 | Patrik Simons. Efficient implementation of the stable model semantics for normal logic programs. Research Report A35, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, September 1995. |
|
|
130 | Tuomas Aura. Modelling the Needham-Schröder authentication protocol with high level Petri nets. Technical Report B14, Helsinki University of Technology, Digital Systems Labora tory, Espoo, Finland, September 1995. |
|
|
129 | Kimmo Varpaaniemi, Jaakko Halme, Kari Hiekkanen, and Tino Pyssysalo. PROD reference manual. Technical Report B13, Helsinki University of Technology, Digital Systems Labora tory, Espoo, Finland, August 1995. |
|
|
128 | Ilkka Niemelä. Towards efficient default reasoning. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 312–318, Montreal, Canada, August 1995. Morgan Kaufmann Publishers. |
|
|
127 | Ilkka Niemelä and P. Simons. Evaluating an algorithm for default reasoning. In Working Notes of the IJCAI'95 Workshop on Applications and Implementations of Nonmonotonic Reasoning Systems, Montreal, Canada, pages 66–72, Montreal, Canada, August 1995. |
|
|
126 | Rachel Ben-Eliyahu and Ilkka Niemelä, editors. Working Notes of the IJCAI'95 Workshop on Applications and Implementations of Nonmonotonic Reasoning Systems, Montreal, Canada, August 1995. AAAI Press. |
|
|
125 | Tomi Janhunen. Cautious models for general logic programs. In Hendrick Decker et al., editors, Proceedings of the Third International Workshop on Deductive Databases and Logic Programming, pages 25–39, Kanagawa, Japan, June 1995. Gesellschaft für Mathematik und Datenverarbeitung. GMD-Studien Nr. 266. |
|
|
124 | Ilkka Niemelä, editor. Annual report for the year 1994. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, May 1995. |
|
|
123 | Johan Lilius. On the structure of high-level nets. Research Report A33, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, March 1995. Doctoral dissertation. |
|
|
122 | Jari Juopperi. PrT-net based analysis of information flow security nets. Research Report A34, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, March 1995. |
|
|
121 | Kari J. Nurmela. Constructing spherical codes by global optimization methods. Research Report A32, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, February 1995. |
|
|
120 | Jari Juopperi. PrT-net Based Analysis of Information Flow Security Nets. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1995. |
|
|
119 | Kari Nurmela. Constructing Spherical Codes by Global Optimization Methods. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1995. |
|
|
118 | Aapo Rautiainen. Konformanssitestaus hajautetussa testausarkkitehtuurissa. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1995. |
|
|
117 | Patrik Simons. Efficient implementation of the stable model semantics for normal logic programs. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1995. |
|
|
116 | Ilkka Niemelä. A decision method for nonmonotonic reasoning based on autoepistemic reasoning. Journal of Automated Reasoning, 14:3–42, 1995. |
|
1994 |
|
115 | Tomi Janhunen. Investigations on cautious autoepistemic reasoning. Research Report A31, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1994. |
|
|
114 | Johan Lilius. On the folding of algebraic nets. Research Report A30, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1994. |
|
|
113 | Ilkka Niemelä, editor. Annual report for the year 1993. Technical report, Teknillinen korkeakoulu, Tietojenkäsittelyteorian laboratorio (Helsinki University of Technology, Laboratory for Theoretical Computer Science), Espoo, Finland, May 1994. |
|
|
112 | Ilkka Niemelä. A decision method for nonmonotonic reasoning based on autoepistemic reasoning. In Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning, pages 473–484, Bonn, Germany, May 1994. Morgan Kaufmann Publishers. |
|
|
111 | Kimmo Varpaaniemi. On computing symmetries and stubborn sets. Technical Report B12, Helsinki University of Technology, Digital Systems Labora tory, Espoo, Finland, April 1994. |
|
|
110 | Tino Pyssysalo. The modelling and analysis of a high speed data bus with predicate/transition nets. Research Report A29, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, March 1994. |
|
|
109 | Tomi Janhunen. Investigations on Cautious Autoepistemic Reasoning. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1994. |
|
|
108 | Kari Hakulinen. Soluverkkoprotokollien tietokoneavusteinen testaus. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 1994. |
|
|
107 | Tino Pyssysalo. The modelling and analysis of a high speed data bus with predicate/transition nets. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1994. |
|
|
106 | Mika Rautila. Prosessialgebran käyttö älyverkkopalveluiden määrityksessä ja analysoinnissa. Master's thesis, Helsinki University of Technology, Department of Electrical and Communications Engineering, 1994. |
|
|
105 | Jari Saarhelo. Tekoäly valuprosessin suunnittelussa. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1994. |
|
|
104 | Pauli Väisänen. A study of model determination problems in s5 logic. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1994. |
|
|
103 | Kimmo Varpaaniemi. Dynamically stubborn sets and the sleep set method. In Hans-Dieter Burkhard, Ludwik Czaja, and Peter H. Starke, editors, Concurrency, Specification and Programming: Proceedings of the CS&P'93 Workshop, Nieborów near Warsaw, Poland, 14–16 October 1993, pages 230–246. Zakład Graficzny UW, zam. 261/94, Warsaw, Poland, 1994. |
|
|
102 | Kimmo Varpaaniemi. On combining the stubborn set method with the sleep set method. In Robert Valette, editor, Application and Theory of Petri Nets 1994: 15th International Conference, Zaragoza, Spain, June 20–24, 1994, Proceedings, volume 815 of Lecture Notes in Computer Science, pages 548–567. Springer-Verlag, Berlin, Germany, 1994. © Springer-Verlag Berlin Heidelberg 1994. |
|
|
101 | Kimmo Varpaaniemi. On-the-fly verification with PROD. In Jörg Desel, Andreas Oberweis, and Wolfgang Reisig, editors, Algorithmen und Werkzeuge für Petrinetze: Workshop der GI-Fachgruppe 0.0.1, ``Petrinetze und verwandte Systemmodelle'', Berlin, 10.–11. Oktober 1994, pages 80–83. Forschungsberichte, Bericht 309, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe (TH), Germany, 1994. |
|
|
100 | Kimmo Varpaaniemi. The sleep set method revisited. In Ludwik Czaja, Hans-Dieter Burkhard, and Peter H. Starke, editors, Workshop: Concurrency, Specification & Programming, October 12–15, 1994. Informatik-Bericht Nr. 36, Institut für Informatik, Humboldt-Universität zu Berlin, Germany, 1994. |
|
|
99 | Ilkka Niemelä. Autoepisteeminen logiikka epämonotonisen päättelyn pohjana. Tietojenkäsittelytiede, 6:15–25, 1994. |
|
|
98 | Ilkka Niemelä and J. Rintanen. On the impact of stratification on the complexity of nonmonotonic reasoning. In G. Lakemeyer and B. Nebel, editors, Foundations of Knowledge Representation and Reasoning, pages 275–295. Springer-Verlag, Berlin, 1994. |
|
|
97 | Ilkka Niemelä and Jussi Rintanen. On the impact of stratification on the complexity of nonmonotonic reasoning. Journal of Applied Non-Classical Logics, 4(2):141–179, 1994. |
|
|
96 | Ilkka Niemelä and Camilla Schwind. Proof systems for nonmonotonic logics. Lecture notes for a tutorial given at the 12th International Conference on Automated Deduction, Nancy, France, June 28–July 1, 1994. 44 pages., 1994. |
|
|
95 | Tomi Janhunen. Cautious autoepistemic reasoning applied to general logic programs. In Matti Penttonen, editor, Proceedings of the Seventh Finnish Symposium on Computer Science, pages 33–46, Liperi, Finland, January 1994. University of Joensuu, Department of Computer Science. (Report A-1994-1). |
|
1993 |
|
94 | Jussi Rintanen. Priorities and nonmonotonic reasoning. Research Report A28, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1993. |
|
|
93 | Kari J. Nurmela. Constructing combinatorial designs by local search. Research Report A27, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1993. |
|
|
92 | Kimmo Varpaaniemi. Efficient detection of deadlocks in Petri nets. Research Report A26, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, October 1993. |
|
|
91 | Ilkka Niemelä. A decision method for nonmonotonic reasoning based on autoepistemic logic. In Automated Deduction in Nonstandard Logics — Papers from the 1993 Fall Symposium, pages 97–104, Raleigh, NC, USA, October 1993. AAAI Press. |
|
|
90 | Patric R. J. Östergård. Construction methods for covering codes. Research Report A25, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, September 1993. Doctoral dissertation. |
|
|
89 | Ilkka Niemelä. Autoepistemic logic as a unified basis for nonmonotonic reasoning. Research Report A24, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, August 1993. Doctoral dissertation. |
|
|
88 | Ilkka Niemelä. Autoepistemic Logic as a Unified Basis for Nonmonotonic Reasoning. PhD thesis, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1993. |
|
|
87 | Tomi Janhunen and Ilkka Niemelä. A scheme for weakened negative introspection in autoepistemic reasoning. In Georg Gottlob, Alexander Leitsch, and Daniele Mundici, editors, Computational Logic and Proof Theory, Proceedings of the Third Kurt Gödel Colloquium, KGC'93, pages 211–222, Brno, Czech Republic, August 1993. Springer Verlag. LNCS 713. |
|
|
86 | Johan Lilius. A sheaf semantics for Petri nets. Research Report A23, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, June 1993. |
|
|
85 | Peter Grönberg, Mikko Tiusanen, and Kimmo Varpaaniemi. PROD – a PrT–net reachability analysis tool. Technical Report B11, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, June 1993. |
|
|
84 | Patric R. J. Östergård and Heikki O. Hämäläinen. New upper bounds for binary/ternary mixed covering codes. Research Report A22, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, March 1993. |
|
|
83 | Tomi Janhunen. Weakened negative introspection in autoepistemic reasoning. Research Report A21, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, February 1993. |
|
|
82 | Tomi Janhunen. Weakened negative introspection in autoepistemic reasoning. Series A: Research reports 21, Helsinki University of Technology, Digital Systems Laboratory, February 1993. Master's Thesis. |
|
|
81 | Kari J. Nurmela and Patric R. J. Östergård. Constructing covering designs by simulated annealing. Technical Report B10, Helsinki University of Technology, Digital Systems Labora tory, Espoo, Finland, January 1993. |
|
|
80 | Jussi Rintanen. Priorities and Nonmonotonic Reasoning. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1993. |
|
|
79 | Kimmo Varpaaniemi. Efficient Detection of Deadlock in Petri Nets. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1993. |
|
|
78 | Sam Sandqvist. On Finding Optimal Potential Customers from a Large Marketing Database – A Genetic Algorithm Approach. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1993. |
|
|
77 | Tomi Janhunen. Weakened negative introspection in autoepistemic reasoning. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1993. |
|
|
76 | Kari Nurmela. Constructing combinatorial designs by local search. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1993. |
|
|
75 | Jorma Paananen. Tietokantakäyttöliittymän toteutus kahdessa graafisessa ympäristössä. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1993. |
|
|
74 | Juha-Pekka Patinen. An interactive theorem prover for linear logic. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1993. |
|
|
73 | Olavi Pesonen. Tehdasmalli konepajan työsuunnittelussa. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1993. |
|
|
72 | Kim Sandström. Värinkodistuksen estimointi tavanomaisen painojäljen videokuvasta. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1993. |
|
|
71 | Kimmo Varpaaniemi. On choosing a scapegoat in the stubborn set method. In Hans-Dieter Burkhard, Peter H. Starke, and Ludwik Czaja, editors, Workshop: Concurrency, Specification & Programming, November 19–21, 1992, pages 163–171. Informatik-Preprint 22, Fachbereich Informatik der Humboldt-Universität zu Berlin, Germany, 1993. |
|
|
70 | Ilkka Niemelä. Logiikka tietämyskielenä. In E. Hyvönen, I. Karanta, and M. Syrjänen, editors, Tekoälyn ensyklopedia, pages 116–124. Gaudeamus, 1993. |
|
|
69 | Tomi Janhunen. Weakened negative introspection in autoepistemic reasoning. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, January 1993. |
|
|
68 | Kimmo Varpaaniemi, Johannes Helander, Tomi Janhunen, Ismo Kangas, Kari Nurmela, Kenneth Oksanen, Olavi Pesonen, Marko Rauhamaa, James Reilly, Heikki Suonsivu, Kimmo Valkealahti, Pauli Väisänen, Peter Grönberg, Jaakko Halme, Kari Hiekkanen, Tino Pyssysalo, and Mikko Tiusanen. PROD 1.1 — A Pr/T reachability analysis tool.. http://www.tcs.hut.fi/Software/prod/, 1993. Computer Program. |
|
1992 |
|
67 | Nisse Husberg. High level distributed transition systems in categories. Research Report A19, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, November 1992. Doctoral dissertation. |
|
|
66 | Jussi Rintanen. Stratification and tractability in nonmonotonic reasoning. Research Report A20, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1992. |
|
|
65 | Ilkka Niemelä and J. Rintanen. On the impact of stratification on the complexity of nonmonotonic reasoning. In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, pages 627–638, Cambridge, MA, USA, October 1992. Morgan Kaufmann Publishers. |
|
|
64 | Ilkka Niemelä. A unifying framework for nonmonotonic reasoning. In Proceedings of the 10th European Conference on Artificial Intelligence, pages 334–338, Vienna, Austria, August 1992. John Wiley. |
|
|
63 | Ilkka Niemelä and J. Rintanen. A decision procedure for stratified autoepistemic logic. In Proceedings of the Finnish Artificial Intelligence Conference, pages 202–211, Espoo, Finland, June 1992. Finnish Artificial Intelligence Society. |
|
|
62 | Matti Hallivuori, Tomi Janhunen, and Tapio Suihko. A graphical user interface for a value added network. In Proceedings of the IFIP TC6 International Conference on Information Network and Data Communication, IV, pages 293–307, Espoo, Finland, March 1992. Elsevier Science Publishers B.V. |
|
|
61 | Unto Pulkkinen. Paperin painettavuustekijöiden määrityksen online-menetelmät. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1992. |
|
|
60 | Marja-Liisa Hämäläinen. Verkkoteoreettisten menetelmien käyttö tietoliikenneyhteyskäytäntöjen suunnittelun apuvälineenä. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1992. |
|
|
59 | Kimmo Koskinen. Ohjausyksikön ohjelmiston suunnittelu maksuvälinekortin kÿttöön. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1992. |
|
|
58 | Jussi Rintanen. Stratification and tractability in nonmonotonic reasoning. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1992. |
|
|
57 | Kimmo Varpaaniemi and Marko Rauhamaa. The stubborn set method in practice. In Kurt Jensen, editor, Application and Theory of Petri Nets 1992: 13th International Conference, Sheffield, UK, June 22–26, 1992, Proceedings, volume 616 of Lecture Notes in Computer Science, pages 389–393. Springer-Verlag, Berlin, Germany, 1992. © Springer-Verlag Berlin Heidelberg 1992. |
|
|
56 | Ilkka Niemelä. Annual report for the year 1991. Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, 1992. |
|
|
55 | Ilkka Niemelä. On the decidability and complexity of autoepistemic reasoning. Fundamenta Informaticae, 17(1,2):117–155, 1992. |
|
|
54 | Ilkka Niemelä. Autoepistemic logic as a basis for automating nonmonotonic reasoning. Lecture Notes of the Summer School on Partial Semantics and Non-Monotonic Reasoning (Linköping, Sweden, May 25–29, 1992), 1992. |
|
1991 |
|
53 | Kari Bjorn. A failure model of a distributed transaction processing system. Research Report A17, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1991. |
|
|
52 | Patric R. J. Östergård. Constructions of mixed covering codes. Research Report A18, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, December 1991. |
|
|
51 | Abbas Moslemie. Automated interpretation of S-invariants of predicate/transition nets: An application of non-classical logics. Research Report A15, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, October 1991. |
|
|
50 | Johan Lilius. On the compositionality and analysis of algebraic high-level nets. Research Report A16, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, October 1991. |
|
|
49 | Ilkka Niemelä. Constructive tightly grounded autoepistemic reasoning. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, pages 399–404, Sydney, Australia, August 1991. Morgan Kaufmann Publishers. |
|
|
48 | Johan Lilius. Text Distribution Service - the Unified Telematic Media for Distributed Office Applications. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1991. |
|
|
47 | Jukka Oranen. On the Compositionality and Analysis of High-Level Nets. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1991. |
|
|
46 | Östergård. Construction of Mixed Covering Codes. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1991. |
|
|
45 | Kimmo Varpaaniemi. UNIX-ympäristössä toimivan ohjelmistoliitännän suunnittelu ja verkkoteoreettinen analysointi. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1991. |
|
|
44 | Jan Wasastjerna. Kansainvälisen konsernin tietoliikennekonseptin suunnittelu. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1991. |
|
|
43 | Ilkka Niemelä. Annual report for the year 1990. Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, 1991. |
|
1990 |
|
42 | Marko Rauhamaa. A comparative study of the methods for efficient reachability analysis. Research Report A14, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, September 1990. |
|
|
41 | Ilkka Niemelä. Towards automatic autoepistemic reasoning. In Proceedings of the European Workshop on Logics in Artificial Intelligence—JELIA'90, pages 428–443, Amsterdam, The Netherlands, September 1990. Springer-Verlag. |
|
|
40 | Johan Lilius. On the notion of dialectical nets. Technical Report B9, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, June 1990. |
|
|
39 | Ilkka Niemelä. A new characterization of autoepistemic reasoning. In Proceedings of the Finnish Artificial Intelligence Symposium, pages 64–73, Oulu, Finland, June 1990. Finnish Artificial Intelligence Society. |
|
|
38 | Andrea Maggiolo-Schettini and Josef Winkowski. A generalization of predicate/transition nets. Research Report A13, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, February 1990. |
|
|
37 | Antti Laine. The Analysis of a Communication Protocol Using High Level Petri Nets. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1990. |
|
|
36 | Pekka Oksala. Permutaatiomenetelmä lomakkeella välitettävän tiedon salaamiseksi. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1990. |
|
|
35 | Kari Björn. A Failure Model of a Distributed Transaction Processing System. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1990. |
|
|
34 | Marko Rauhamaa. A Comparative Study of Methods for Efficient Reachability Analysis. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1990. |
|
|
33 | Leo Kulikov. Konekäännös puumuunnoksin. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1990. |
|
|
32 | Patric Östergård. Säkerhetsaspekter vid datakommunikation över allmänna nät. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1990. |
|
|
31 | Jan Juopperi. Nollatietämystodistimen toiminnan kuvaaminen modaalilogiikkaa käyttäen. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1990. |
|
|
30 | Juha Viljavuori. Tietojärjestelmän hajautuksen suunnittelu UNIX-ympäristössä. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, 1990. |
|
1989 |
|
29 | Victor Varshavsky. Circuits insensitive to delays in transistors and wires. Technical Report B7, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1989. |
|
|
28 | Johan Lilius. Dialectical nets: A categorical approach to net theory. Technical Report B8, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1989. |
|
|
27 | Mikko Tiusanen. A survey of fault-tolerant clock synchronization. Research Report A11, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, June 1989. |
|
|
26 | Kaj Johansson. Modelling solutions for agreement problems. Research Report A12, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, June 1989. |
|
|
25 | Nisse Husberg. A category of distributed transition systems. Research Report A10, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, May 1989. |
|
|
24 | Ilkka Niemelä. Decision problem in autoepistemic logic. In Proceedings of the Workshop on Alternatives of Logic Programming, pages 174–188, Kuopio, Finland, May 1989. Kuopion yliopiston painatuskeskus. |
|
|
23 | Ilkka Niemelä. Automating Autoepistemic Reasoning. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science, Espoo, Finland, 1989. |
|
1988 |
|
22 | Tapio Halkola, Kaj Johansson, and Leo Ojala. Net theoretical methods in modelling byzantine consensus protocols in agreement problems. Research Report A9, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, December 1988. |
|
|
21 | Marko Rauhamaa. Design and implementation of a reduction tool for PrT-nets. Technical Report B6, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, December 1988. |
|
|
20 | Kaj Johansson. Modelling message protocols for the byzantine generals problem. Research Report A8, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1988. |
|
|
19 | Petri Krohn and Marko Rauhamaa. Reduction transformations of PrT-nets. Research Report A7, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, October 1988. |
|
|
18 | Ilkka Niemelä. On the complexity of the decision problem in propositional nonmonotonic logic. In Proceedings of the 2nd Workshop on Computer Science Logic, pages 226–239, Duisburg, FRG, October 1988. Springer-Verlag. |
|
|
17 | Abbas Moslemie. Towards automatic interpretation of S-invariants of predicate/transition nets. Research Report A6, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1988. |
|
|
16 | Ilkka Niemelä. Autoepistemic predicate logic. In Proceedings of the 8th European Conference on Artificial Intelligence, pages 595–600, München, August 1988. Pitman Publishing. |
|
|
15 | Ilkka Niemelä. Decision procedures for quantified non-monotonic logic. In Proceedings of the Finnish Artificial Intelligence Symposium, pages 418–427, Helsinki, Finland, August 1988. Limes ry. |
|
|
14 | Nisse Husberg. Petri nets in algebraic theories – a category theory approach. Technical Report B5, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, June 1988. |
|
|
13 | Victor Varshavsky and Mikko Tiusanen. Hardware support of concurrent process interaction and synchronization: On the principle of autocorrect implementation. Technical Report B4, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, May 1988. |
|
|
12 | Ilkka Niemelä. Decision procedure for autoepistemic logic. In Proceedings of the 9th International Conference on Automated Deduction, pages 675–684, Argonne, USA, May 1988. Springer-Verlag. |
|
|
11 | Esa Kettunen, Esa Montonen, and Timo Tuuliniemi. An interactive PrT-net tool for verification of SDL-specifications. Technical Report B3, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, February 1988. |
|
|
10 | Heikki Tuominen. Logic in Petri net analysis. Research Report A5, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, January 1988. |
|
|
9 | Mikko Tiusanen. Some unsolved problems in modelling self-timed circuits using Petri nets. Technical Report B2, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, January 1988. |
|
1987 |
|
8 | Ilkka Niemelä and Heikki Tuominen. Helsinki logic machine: a system for logical expertise. Technical Report B1, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, December 1987. |
|
|
7 | Mikko Tiusanen. Specification of a net description language compiler. Research Report A4, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, November 1987. |
|
|
6 | Esa Montonen, Leo Ojala, and Timo Tuuliniemi. A PrT-net representation of graph grammars. Research Report A3, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, October 1987. |
|
|
5 | Viktor I. Varshavsky. Hardware support of parallel asynchronous processes. Research Report A2, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, September 1987. |
|
|
4 | Tapio Halkola, Kaj Johansson, and Leo Ojala. Modelling orel message solution protocols for agreement problems in fault-tolerant distributed systems using predicate/transition nets. Research Report A1, Helsinki University of Technology, Digital Systems Laboratory, Espoo, Finland, August 1987. |
|
|
3 | Ilkka Niemelä. Nonmonotonic logic in knowledge-based systems. Master's Thesis (in Finnish), Helsinki University of Technology, Department of Electrical Engineering, 1987. |
|
1986 |
|
2 | Ilkka Niemelä and H. Tuominen. A system for logical expertise. In Proceedings of the Finnish Artificial Intelligence Symposium, Volume 2, pages 44–53, Espoo, Finland, August 1986. Finnish Society of Information Processing Science. |
|
|
1 | Ilkka Niemelä. A survey of nonmonotonic logic (in Finnish). Internal report A22, Helsinki University of Technology, Digital Systems Laboratory, Espoo, 1986. |
|
