TCS / Research / Publications / Conference and Workshop Papers
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

Conference and Workshop Papers

to appear

338Joo 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.
PDF (152 kB)
Info
337Joo 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.
PDF (217 kB)
Info
336Kimmo 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.
Info
335Joo 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.
Info

to apear

334Marí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.
Info

2010

333Miia 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.
Info

2009

332Tomi 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.
Info
See dx.doi.org ...
331Kim 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.
Info
330Kim 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.
Info
329Antti 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.
Info
328Andrea 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.
PDF (260 kB)
Info
See drops.dagstuhl.de ...
327Billy 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.
Info
See dx.doi.org ...
326Billy 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.
Info
See dx.doi.org ...
325Matti 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.
Info
324Emilia 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.
Info
See dx.doi.org ...
323Matti 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.
Info
See dx.doi.org ...
322Janne 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.
Info
See www.automaatioseura.fi ...
321Ilkka 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.
Info
320Alessandro 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.
Info
See ieeexplore.ieee.org ...
319Kimmo 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.
Info
See dx.doi.org ...
318Kaisa Nyberg. Methods for Symmetric Key Cryptography and Cryptanalysis. In EWM PhD Summer School, Turku, Finland, June 2009, 2009.
PDF (243 kB)
Info
317Kari 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.
Info
316Miia 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.
PostScript (383 kB)
GZipped PostScript (163 kB)
PDF (180 kB)
Info
See drops.dagstuhl.de ...
315Miia 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.
Info
314André 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.
Info
313Siert 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.
Info

2008

312Tomi 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.
Info
See dx.doi.org ...
311Tomi 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.
Info
310Billy 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.
PDF (192 kB)
Info
309Martin 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.
Info
See www.cse.unsw.edu.au ...
308Roland 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.
Info
See www.tcs.hut.fi ...
307Tomi 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.
Info
306Janne 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.
Info
See www.tcs.hut.fi ...
305Joo 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.
PDF (142 kB)
Info
304Antti 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.
Info
303Mikko 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.
Info
302Antti 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.
Info
301Andrea 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.
Info
See dx.doi.org ...
300Andrea 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.
Info
See dx.doi.org ...
299Cé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.
Info
See dx.doi.org ...
298Billy 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.
Info
See dx.doi.org ...
297Billy 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.
PDF (182 kB)
Info
296Sven 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.
Info
295Emilia 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.
Info
See dx.doi.org ...
294Ilkka 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.
Info
293Ilkka 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.
Info
292Joo 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.
PDF (307 kB)
Info
291Jori 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.
Info
See www.tcs.hut.fi ...
290Jori 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.
Info
See ieeexplore.ieee.org ...
289Aleksi 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.
Info
288Miia 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.
Info
287Matti 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.
Info
See www.tcs.tkk.fi ...
286Matti 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.
Info
See www.tcs.tkk.fi ...
285Matti 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.
Info
See www.tcs.tkk.fi ...
284Matti 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.
Info
See www.tcs.tkk.fi ...
283Risto 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.
Info
See dx.doi.org ...
282Miki 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.
Info
281Shreyas 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.
Info
See dx.doi.org ...
280André 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 (PMHWN 2008), pages 96–103, New York, NY, USA, 2008. ACM.
Info
See dx.doi.org ...
279André 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.
Info
See dx.doi.org ...
278Sven 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.
Info
277Hans 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.
Info
276Tommi 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.
Info
See dx.doi.org ...

2007

275Dmitrij 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.
Info
See www.springerlink.com ...
274Emilia 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.
Info
See www.springerlink.com ...
273Emilia 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.
Info
See www.springerlink.com ...
272Emilia 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.
Info
See www.tcs.hut.fi ...
271Emilia 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.
Info
See www.springerlink.com ...
270Emilia 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.
Info
269Tomi 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.
Info
See dx.doi.org ...
268Tomi 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.
Info
See ftp.informatik.rwth-aachen.de ...
267Billy 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.
Info
See dx.doi.org ...
266Billy 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.
Info
See dx.doi.org ...
265Sven 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.
Info
264Ahto 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.
Info
263Maarit 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.
Info
262Jukka 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.
Info
See doi.ieeecomputersociety.org ...
261Harri 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.
PDF (518 kB)
Info
260Jani 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.
PDF (577 kB)
Info
See dx.doi.org ...
259Kaisa 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.
Info
See dx.doi.org ...
258Jukka 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.
Info
257Kaisa 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.
Info
See drops.dagstuhl.de ...
256Kaisa 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.
PDF (86 kB)
Info
255Matti 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.
Info
See willow.engr.uconn.edu ...
254Matti 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.
Info
See www.tcs.hut.fi ...
253Matti 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.
PostScript (2 MB)
GZipped PostScript (326 kB)
PDF (354 kB)
Info
252Matti 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.
Info
251Matti 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.
Info
See www.tcs.hut.fi ...
250Ahto 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.
Info
249Sven 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.
Info
248Yaniv 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.
Info
247Tommi 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.
Info
See www.siam.org ...
246Matti 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.
Info
See dx.doi.org ...

2006

245Billy 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.
PDF (187 kB)
Info
244Emilia 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.
Info
243Keijo 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.
Info
See www.tcs.hut.fi ...
242Jean 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.
Info
241Christian 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.
Info
240Mikko 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.
Info
239Teemu 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.
Info
238Emilia 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.
Info
See cig.in.tu-clausthal.de ...
237Tommi 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.
PDF (146 kB)
Info
236Jean 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.
Info
See www.in.tu-clausthal.de ...
235Stefano 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.
Info
234Antti 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.
Info
233Antti 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.
Info
See dx.doi.org ...
232Andrea 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.
Info
See ww1.ucmss.com ...
231Billy 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.
Info
See dx.doi.org ...
230Satu 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.
Info
229Kaisa 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.
Info
228Ilkka 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.
Info
227Ilkka 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.
Info
226Ilkka 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.
Info
225Jukka 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.
Info
See dx.doi.org ...
224Kaisa Nyberg. Connect Now to MitM. In Crypto 2006 Rump Session, 2006.
PDF (49 kB)
Info
223Matti 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.
Info
See www.tcs.hut.fi ...
222Matti 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.
Info
See www.tucs.fi ...
221Risto 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.
Info
See dx.doi.org ...
220Jiří Ší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, BerlinHeidelberg, Germany, 2006. Springer-Verlag GmbH.
Info
219André 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.
Info
See dx.doi.org ...
218Ahto 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.
Info
See dx.doi.org ...
217Sven 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.
Info
See doi.acm.org ...
216Sven 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.
Info
215Toni 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.
Info
See modeva.itee.uq.edu.au ...

2005

214Hannu 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.
Info
213Jan 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.
Info
212Emilia 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.
Info
See www.springerlink.com ...
211Jean 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.
Info
See www.springerlink.com ...
210Catharina 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.
Info
209Emilia Oikarinen. Translating parallel circumscription into disjunctive logic programming. In ICCL Summer School Student Workshop 2005, Dresden, Germany, July 2005. TU Dresden.
PDF (140 kB)
Info
208Gerd 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.
Info
See www.tcs.hut.fi ...
207Keijo 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.
Info
See www.tcs.hut.fi ...
206Keijo 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.
Info
See www.tcs.hut.fi ...
205Misa 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.
Info
204Maarit 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.
Info
203Janne 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.
Info
202Janne 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.
Info
201Misa 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.
Info
200Pekka 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.
Info
See dx.doi.org ...
199Sakari 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.
Info
See dx.doi.org ...
198Satu 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.
Info
197Sven 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.
Info
See dx.doi.org ...
196Timo 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.
Info
195Marco 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.
Info
194Marco 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.
Info
193Marco 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.
Info

2004

192Catharina Candolin. Self healing networks against infrastructural warfare. In Proceedings of the 5th Australian Information Warfare & IT Security Conference, Fremantle, Australia, November 2004.
Info
191Mikko Särelä and Pekka Nikander. Applying host identity protocol to tactical networks. In Proceedings of IEEE Milcom 2004, Monterey, California, USA, Nov 2004.
Info
190Timo Latvala, Armin Biere, Keijo Heljanko, and Tommi Junttila. Simple bounded LTL model checking. In Alan J. Hu and Andrew K. Martin, editors, Formal Methods in Computer-Aided Design 2004, 5th International Conference FMCAD'04, Austin, Texas, USA, volume 3312 of Lecture Notes in Computer Science, pages 186–200. Springer, nov 2004.
Info
See www.springerlink.com ...
189Malcolm Greig, Harri Haanpää, and Petteri Kaski. On the existence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. In Lars Døvling Andersen and Olav Geil, editors, Proceedings of the 8th Nordic Combinatorial Conference, pages 65–69, Aalborg, Denmark, October 2004. Department of Mathematical Sciences, Aalborg University. Extended summary.
Info
188Tomi Janhunen, Toni Jussila, Matti Järvisalo, and Emilia Oikarinen. Teaching Smullyan's analytic tableaux in a scalable learning environment. In Ari Korhonen and Lauri Malmi, editors, Proceedings of the 4th Finnish/Baltic Sea Conference on Computer Science Education, pages 85–94, Joensuu, October 2004. Published in the report series of the Laboratory of Information Processing, TKO-A42/04.
Info
187Misa Keinänen. Obtaining memory efficient solutions to boolean equation systems. In J. Bicarregui A. Butterfield and A. Arenas, editors, Proceedings of the 9th International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2004), number SEA-SR-03 in Technical Report, pages 191–208, Linz, Austria, September 2004. Institute for systems Engineering & Automation, Kepler University Linz.
Info
186Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Parallel encodings of classical planning as satisfiability. In José Júlio Alferes and João Alexandre Leite, editors, Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA'04), volume 3229 of Lecture Notes in Computer Science, pages 307–319, Lisbon, Portugal, September 2004. Springer-Verlag.
Info
See www.tcs.hut.fi ...
185Tommi Syrjänen. Cardinality constraint programs. In Jose Julio Alferes and Joao Leite, editors, The 9th European Conference on Logics in Artificial Intelligence (JELIA'04), pages 187–200. Springer-Verlag, September 2004.
PostScript (322 kB)
GZipped PostScript (147 kB)
Info
184Tomi Janhunen and Emilia Oikarinen. Capturing parallel circumscription with disjunctive logic programs. In José Júlio Alferes and Jo ao Leite, editors, Proceedings of the 9th European Conference on Logics in Artificial Intelligence, JELIA'04, pages 134–146, Lisbon, Portugal, September 2004. Springer-Verlag. LNAI 3229.
Info
See www.springerlink.com ...
183Tomi Janhunen. Representing normal programs with clauses. In Ramon López de Mántaras and Lorenza Saitta, editors, Proceedings of the 16th European Conference on Artificial Intelligence, pages 358–362, Valencia, Spain, August 2004. IOS Press.
Info
182Pauli Aho and Catharina Candolin. Enabling network-centric warfare by securing the core infrastructure. In Proceedings of the 3rd European Conference on Information Warfare (ECIW'04), London, UK, June 2004.
Info
181Toni Jussila. BMC via dynamic atomicity analysis. In Proceedings of the International Conference on Application of Concurrency to System Design (ACSD'2004), Hamilton, Ontario, Canada, June 2004.
Info
180Jan Friso Groote and Misa Keinänen. Solving disjunctive/conjunctive boolean equation systems with alternating fixed points. In K. Jensen and A. Podelski, editors, Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2004), volume 2988 of Lecture Notes in Computer Science, pages 436–450, Barcelona, Spain, April 2004. Springer.
Info
179Misa Keinänen and Ilkka Niemelä. Solving alternating boolean equation systems in answer set programming. In U. Geske D. Seipel, M. Hanus and O. Bartenstein, editors, Proceedings of the 15th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2004), volume 327 of Technical Report, pages 255–264, Potsdam, Germany, April 2004. Bayerische Julius-Maximilians-Universität Würzburg, Institut für Informatik.
Info
178Antti Autere. New online power-aware algorithms in wireless networks. In 12th International Conference on Software, Telecommunications and Computer Networks, pages 439–443, Split, Dubrovnik (Croatia), Venice (Italy), 2004. University of Split.
Info
177Janne Lundberg. A system for combining forward error correction and source authentication in wireless multicast networks. In Technical Aspects of Network Centric Warfare, Helsinki, Finland, 2004.
Info
176Janne Lundberg. Implementation of packet level authentication for Linux. In Technical Aspects of Network Centric Warfare, Helsinki, Finland, 2004.
Info
175Kimmo Varpaaniemi. Stubborn sets for priority nets. In Cevdet Aykanat, Tuğrul Dayar, and İbrahim Körpeoğlu, editors, Computer and Information Sciences — ISCIS 2004, 19th International Symposium, Kemer-Antalya, Turkey, October 27–29, 2004, Proceedings, volume 3280 of Lecture Notes in Computer Science, pages 574–583. Springer-Verlag, Berlin, Germany, 2004. © Springer-Verlag Berlin Heidelberg 2004.
Errata 
Info
See users.tkk.fi ...
174Emilia Oikarinen and Tomi Janhunen. Verifying the equivalence of logic programs in the disjunctive case. In V. Lifschitz and I. Niemelä, editors, Logic Programming and Nonmonotonic Reasoning, Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, volume 2923 of Lecture Notes in Artificial Intelligence, pages 180–193, Fort Lauderdale, USA, January 2004. Springer-Verlag.
Info
See www.springerlink.com ...
173Victor Marek, Ilkka Niemelä, and Mirosław Truszczyński. Programs with monotone cardinality atoms. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 154–166. Springer-Verlag, 2004.
Info
See www.tcs.hut.fi ...
172Matti Järvisalo and Ilkka Niemelä. A compact reformulation of propositional satisfiability as binary constraint satisfaction. In Alan M. Frisch and Ian Miguel, editors, Proceedings of the 3rd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems: Towards Systemisation and Automation, pages 111–124, 2004. Proceedings available at http://www-users.cs.york.ac.uk/%7Efrisch/Reformulation/04/.
PostScript (357 kB)
GZipped PostScript (162 kB)
PDF (205 kB)
Info
171Matti Järvisalo. Todistuskompleksisuudesta Boolen piirien toteutuvuustarkastuksessa. In Pasi Fränti and Esko Marjomaa, editors, Tietojenkäsittelytieteen päivät 2004, volume 5 of International Proceedings Series of Department of Computer Science, University of Joensuu, pages 49–53. Joensuun yliopisto, 2004. In Finnish.
PostScript (204 kB)
GZipped PostScript (84 kB)
PDF (102 kB)
Info
170Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Unrestricted vs restricted cut in a tableau method for Boolean circuits. In 8th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, USA, January 4–6, 2004. Proceedings available at http://rutcor.rutgers.edu/%7Eamai/aimath04/.
Info
See www.tcs.hut.fi ...
169Emil Falck, Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Balanced data gathering in energy-constrained sensor networks. In S. Nikoletseas and J. D. P. Rolim, editors, Algorithmic Aspects of Wireless Sensor Networks: First International Workshop (ALGOSENSORS 2004, Turku, Finland, July 2004), volume 3121 of Lecture Notes in Computer Science, pages 59–70, Berlin Heidelberg, 2004. Springer-Verlag.
Info
See dx.doi.org ...
168Satu Elisa Schaeffer, Jonathan C. Clemens, and Patrick Hamilton. Decision making in distributed sensor networks. In Proceedings of the Santa Fe Institute Complex Systems Summer School, Santa Fe, NM, USA, 2004. Santa Fe Institute.
PostScript (606 kB)
GZipped PostScript (168 kB)
PDF (165 kB)
Info
167Satu Elisa Virtanen and Pekka Nikander. Local clustering for hierarchical ad hoc networks. In Proceedings of WiOpt'04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, pages 404–405, Los Alamitos, CA, USA, 2004. IEEE Computer Society.
Info
166Sven Laur and Helger Lipmaa. On private similarity search protocols. In Sanna Liimatainen and Teemupekka Virtanen, editors, Proceedings of the 9th Nordic Workshop on Secure IT Systems (NordSec 2004), pages 73–77, 2004.
PDF (155 kB)
Info
165Bart Goethals, Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. On private scalar product computation for privacy-preserving data mining.. In Choonsik Park and Seongtaek Chee, editors, Information Security and Cryptology - ICISC 2004, 7th International Conference, Seoul, Korea, December 2-3, 2004, Revised Selected Papers, volume 3506 of Lecture Notes in Computer Science, pages 104–120. Springer, 2004.
Info
See dx.doi.org ...
164Timo Latvala and Marko Mäkelä. LTL model checking for modular Petri nets. In J. Cortadella and W. Reisig, editors, Application and Theory of Petri Nets 2004. 25th International Conference, ICATPN 2004., volume 3099 of LNCS, pages 298–311, 2004.
Info
See springerlink.metapress.com ...
163Tommi A. Junttila. New canonical representative marking algorithms for place/transition-nets. In J. Cortadella and W. Reisig, editors, Application and Theory of Petri Nets 2004, volume 3099 of Lecture Notes in Computer Science, pages 258–277. Springer, 2004.
Info
162Tommi A. Junttila. New orbit algorithms for data symmetries. In Application of Concurrency to System Design 2004, pages 175–184. IEEE, 2004.
Info
161Toni Jussila. Efficient bounded reachability through iterative strengthening. In Concurrency, Specification and Programming CS&P'2004, 2004.
Info
160Tomi Janhunen and Ilkka Niemelä. GnT – a solver for disjunctive logic programs. In Vladimir Lifschitz and Ilkka Niemelä, editors, Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 331–335, Fort Lauderdale, Florida, 2004. Springer-Verlag. LNAI 2923.
Info
See www.springerlink.com ...
159Tomi Janhunen and Emilia Oikarinen. lpeq and dlpeq – translators for automated equivalence testing of logic programs. In Vladimir Lifschitz and Ilkka Niemelä, editors, Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 336–340, Fort Lauderdale, Florida, 2004. Springer-Verlag. LNAI 2923.
Info
See www.springerlink.com ...

2003

158Catharina Candolin. Privacy issues in network-centric warfare. In Proceedings of the 4th Australian Information Warfare & IT Security Conference, Adelaide, Australia, November 2003.
Info
157Ilkka 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.
Info
156Satu 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.
Info
155Catharina Candolin and Hannu H. Kari. An architecture for context aware management. In Proceedings of IEEE MILCOM 2003, Boston, Massachusetts, USA, October 2003.
Info
154Janne Lundberg and Catharina Candolin. Hierarchical multicast caching. In Proceedings of IEEE 9th Asia-Pacific conference on communications, Penang, Malaysia, September 2003.
Info
153Tomi 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/.
Info
See ceur-ws.org ...
152Janne Lundberg and Catharina Candolin. Mobility in the host identity protocol (hip). In Proceedings of the International Symposium on Telecommunications (IST2003), Isfahan, Iran, August 2003.
Info
151Janne Lundberg and Catharina Candolin. Mobility in The Host Identity Protocol (HIP). In Proceedings of the International Symposium on Telecommunications (IST2003), Isfahan, Iran, August 2003.
Info
150Gerd 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.
Info
See www.tcs.hut.fi ...
149Catharina 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.
Info
148Petri 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.
Info
147Miika Komu, Mika Kousa, Janne Lundberg, and Catharina Candolin. An implementation of hip for linux. In Proceedings of Ottawa Linux Symposium, Ottawa, Canada, July 2003.
Info
146Ilkka 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.
Info
See www.cs.miami.edu ...
145Toni 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.
PostScript (479 kB)
GZipped PostScript (212 kB)
Info
144Catharina 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.
Info
143Janne 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.
Info
142Marko 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.
Info
See link.springer.de ...
141Tuomo 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.
Info
See www.tcs.hut.fi ...
140Emilia 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.
Info
139Catharina 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.
Info
138Annikka 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.
Info
See users.tkk.fi ...
137Kimmo 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.
Info
136Johan 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.
Info
135Juha 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.
Info
134Markku-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.
Info
133Sakari 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.
Info
See dx.doi.org ...
132Patrik 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.
Info
See doi.acm.org ...
131Timo 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.
Info
See link.springer.de ...

2002

130Catharina 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.
Info
129Catharina Candolin and Hannu Kari. Dynamic management of core ad hoc networks. In Proceedings of InfoWarCon 2002, Perth, Australia, November 2002.
Info
128Elina 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.).
Info
127Catharina Candolin and Hannu Kari. A security architecture for wireless ad hoc networks. In Proceedings of IEEE Milcom 2002, Anaheim, California, USA, October 2002.
Info
126Catharina 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.
Info
125Catharina 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.
Info
124Gerd 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.
Info
See www.tcs.hut.fi ...
123Tomi 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.
Info
See www.tcs.hut.fi ...
122Jukka 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.
Info
121Toni 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.
Info
See www.tcs.hut.fi ...
120Marko 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.
Info
See link.springer.de ...
119Marko 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.
Info
118Keijo 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.
Info
See www.tcs.hut.fi ...
117Catharina 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.
Info
116Catharina 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.
Info
115Yuchen Zhou, Catharina Candolin, and Teemupekka Virtanen. Trust management in mobile ipv6. In Proceedings of the 4th Nordic Usenix Conference, Helsinki, Finland, February 2002.
Info
114Tuomas 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.
Info
See link.springer.de ...
113Silja 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.
Info
See link.springer.de ...
112Kimmo 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.
Errata 
Info
111Juha 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.
Info
110Markku-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.
Info

2001

109Keijo 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.
Info
See www.tcs.hut.fi ...
108Tommi 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.
PostScript (199 kB)
GZipped PostScript (77 kB)
Info
107Tommi 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.
PostScript (106 kB)
GZipped PostScript (45 kB)
Info
106Tomi 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.
Info
See www.tcs.hut.fi ...
105Keijo 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.
Info
See www.tcs.hut.fi ...
104Tommi Syrjänen. Version spaces and rule-based configuration management. In Working Notes of the IJCAI 2001 Workshop on Configuration, August 2001.
PostScript (122 kB)
GZipped PostScript (45 kB)
Info
103Marko 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.
Errata 
Info
See link.springer.de ...
102Javier 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.
Info
See www.tcs.hut.fi ...
101Tomi 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.
Info
100Keijo 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.
Info
99Timo 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.
Info
98Catharina 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.
Info
97Tuomas 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.
Info
See link.springer.de ...
96Tuomas 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.
Info
See link.springer.de ...
95Kimmo 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.
Info
94Leo 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.
Info
93Leo 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.
Info
92Jiří Ší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.
Info
See doi.acm.org ...
91Jiří Ší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.
Info
See link.springer.de ...
90Timo 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]
Info
See link.springer.de ...
89Leo 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.
Info
88Leo 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.
Info

2000

87Marko 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.
Info
86Marko 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.
Info
85Silja 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.
Info
84Tomi 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.
Info
See www.tcs.hut.fi ...
83Tomi 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.
Info
See www.tcs.hut.fi ...
82Marko 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.
Info
81Timo 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.
Info
80Keijo 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.
Info
See www.tcs.hut.fi ...
79Tommi Syrjänen. Optimizing configurations. In Proceedings of the ECAI Workshop W02 on Configuration, pages 85 – 90, Berlin, Germany, August 2000.
PostScript (208 kB)
GZipped PostScript (76 kB)
Info
78Javier 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.
Info
See www.tcs.hut.fi ...
77Tommi 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.
Info
See link.springer.de ...
76Tommi Syrjänen. Including diagnostic information in configuration models. In Proceedings of the First International Conference on Computational Logic, London, UK, July 2000. Springer-Verlag.
PostScript (219 kB)
GZipped PostScript (79 kB)
Info
75Tomi 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.
Info
See www.tcs.hut.fi ...
74Marko 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.
Info
73Marko 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.
Info
72Maarit 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.
Info
71Ilkka 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.
Info
70Tomi 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.
Info
See www.tcs.hut.fi ...
69Tuomas 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.
Info
68John 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.
Info
67Jussipekka 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.
Info
66Linfeng 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.
Info
65Leo 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.
Info
64Nisse 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.
Info
63Teijo 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.
Info
62Leo 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.
Info

1999

61Ilkka 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.
Info
60Tomi 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.
Info
See www.tcs.hut.fi ...
59Timo 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.
Info
58Keijo 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.
Info
See www.tcs.hut.fi ...
57Timo 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.
PostScript (453 kB)
GZipped PostScript (86 kB)
Info
56Harriet 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.
Info
See www.mlab.uiah.fi ...
55Ilkka 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.
Info
54Kimmo 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.
Errata 
Info
53Timo 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.
Info
52Keijo 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.
Info
See www.tcs.hut.fi ...

1998

51Tomi 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.
Info
See www.tcs.hut.fi ...
50Keijo 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.
Info
See www.tcs.hut.fi ...
49S. 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.
Info
48Ilkka 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.
Info
47Kimmo 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.
Info
See users.tkk.fi ...
46Tommi 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.
Info

1997

45Ilkka 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.
Info
44C. 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.
Info
43Tomi 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.
Info
See dx.doi.org ...
42S. 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.
Info
41Antti Huima. Security flaws in popular security software: Lessons learned from problems in SSH-1.2.17 and older. In Proc. NORDSEC '97, 1997.
Info
40Antti 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.
Info
39Kimmo 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.
Errata 
Info
38Eero 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.
Info

1996

37P. 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.
Info
36Ilkka 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.
Info
35C. 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.
Info
34C. 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.
Info
33Keijo 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.
Info
See www.tcs.hut.fi ...
32Ilkka 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.
Info
31Tomi 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.
Info
See www.tcs.hut.fi ...
30Tomi 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.
Info
29Ilkka 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.
Info
28Kimmo 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.
Info
27Eero 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.
Info

1995

26Ilkka 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.
Info
25Ilkka 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.
Info
24Tomi 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.
Info
See www.tcs.hut.fi ...

1994

23Ilkka 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.
Info
22Kimmo 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.
Info
21Kimmo 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.
Errata 
Info
See users.tkk.fi ...
20Kimmo 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.
Info
19Kimmo 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.
Errata 
Info
18Tomi 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).
Info

1993

17Ilkka 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.
Info
16Tomi 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.
Info
See www.tcs.hut.fi ...
15Kimmo 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.
Info

1992

14Ilkka 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.
Info
13Ilkka 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.
Info
12Ilkka 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.
Info
11Matti 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.
Info
10Kimmo 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.
Info
See users.tkk.fi ...

1991

9Ilkka 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.
Info

1990

8Ilkka 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.
Info
7Ilkka 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.
Info

1989

6Ilkka 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.
Info

1988

5Ilkka 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.
Info
4Ilkka Niemelä. Autoepistemic predicate logic. In Proceedings of the 8th European Conference on Artificial Intelligence, pages 595–600, München, August 1988. Pitman Publishing.
Info
3Ilkka 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.
Info
2Ilkka 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.
Info

1986

1Ilkka 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.
Info

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