to appear |
|
118 | Zahra Ahmadian, Javad Mohajeri, Mahmoud Salmasizadeh, Risto Hakala, and Kaisa Nyberg. A practical distinguisher for the Shannon cipher. Journal of Systems and Software, to appear. |
|
|
117 | Harri Haanpää, André Schumacher, and Pekka Orponen. Distributed algorithms for lifetime maximization in sensor networks via min-max spanning subgraphs. Wireless Networks, to appear. |
|
2010 |
|
116 | Billy Bob Brumley and Kimmo U. Järvinen. Conversion algorithms and implementations for Koblitz curve cryptography. IEEE Transactions on Computers, 59(1):81–92, January 2010. |
|
2009 |
|
115 | Tomi Janhunen, Emilia Oikarinen, Hans Tompits, and Stefan Woltran. Modularity aspects of disjunctive stable models. Journal of Artificial Intelligence Research, 35:813–857, August 2009. |
|
|
114 | Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Incorporating clause learning in grid-based randomized SAT solving. Journal on Satisfiability, Boolean Modeling and Computation, 6:223–244, 2009. |
|
|
113 | Emilia Oikarinen and Tomi Janhunen. A translation-based approach to the verification of modular equivalence. Journal of Logic and Computation, 19(4):591–613, 2009. |
|
|
112 | Harri Haanpää, André Schumacher, and Pekka Orponen. Distributed algorithms for lifetime maximization in sensor networks via min-max spanning subgraphs. Wireless Networks, 2009. To appear. |
|
|
111 | Jani Suomalainen, Jukka Valkonen, and N. Asokan. Standards for security associations in personal networks: a comparative analysis. International Journal of Security and Networks (IJSN), 4(1/2):87–100, 2009. |
|
|
110 | Matti Järvisalo. Structure-based satisfiability checking: Analyzing and harnessing the potential. AI Communications, 22(2):117–119, 2009. Thesis summary. |
|
|
109 | Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. Constraints, 14(3):325–356, 2009. |
|
|
108 | Risto Hakala and Kaisa Nyberg. A multidimensional linear distinguishing attack on the Shannon cipher. International Journal of Applied Cryptography, 1(3):161–168, 2009. |
|
|
107 | Sven Laur and Sylvain Pasini. User-aided data authentication. International Journal of Security and Networks, 4(1/2):69–86, 2009. |
|
2008 |
|
106 | Mikko Alava, John Ardelius, Erik Aurell, Petteri Kaski, Supriya Krishnamurthy, and Pekka Orponen. Circumspect descent prevails in solving random constraint satisfaction problems. Proceedings of the National Academy of Sciences (USA), 105(40):15253–15257, October 2008. |
|
|
105 | Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, and Seif Haridi. An analytical study of a structured overlay in the presence of dynamic membership. IEEE/ACM Transactions on Networking, 16:814–825, 2008. |
|
|
104 | Emilia Oikarinen and Tomi Janhunen. Achieving compositionality of the stable model semantics for smodels programs. Theory and Practice of Logic Programming, 8(5–6):717–761, 2008. |
|
|
103 | Harri Haanpää, Patric Östergård, and Sándor Szabó. Small  -groups with full-rank factorization. International Journal of Algebra and Computation, 18(6):1019–1034, 2008. |
|
|
102 | Victor Marek, Ilkka Niemelä, and Mirosław Truszczyński. Programs with monotone abstract constraint atoms. Theory and Practice of Logic Programming, 8(2):167–199, 2008. |
|
|
101 | Gerd Brewka, Ilkka Niemelä, and Mirosław Truszczyński. Preferences and nonmonotonic reasoning. AI Magazine, 29(4):69–78, 2008. |
|
|
100 | Ilkka Niemelä. Stable models and difference logic. Annals of Mathematics and Artificial Intelligence, 53(1–4):313–329, 2008. |
|
|
99 | Jukka Valkonen and Kaisa Nyberg. Uudet salausmenetelmät parantavat yksityisyydensuojaa. Tietosuoja, 4:24–27, 2008. In Finnish. |
|
|
98 | Matti Järvisalo and Emilia Oikarinen. Extended ASP tableaux and rule redundancy in normal logic programs. Theory and Practice of Logic Programming, 8(5–6):691–716, 2008. |
|
|
97 | Matti Järvisalo and Ilkka Niemelä. The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. Journal of Algorithms, 63(1–3):90–113, 2008. |
|
|
96 | Petteri Kaski, Patric R. J. Östergård, Svetlana Topalova, and Rosen Zlatarski. Steiner triple systems of order 19 and 21 with subsystems of order 7. Discrete Mathematics, 308(13):2732–2741, 2008. |
|
2007 |
|
95 | Tomi Janhunen and Emilia Oikarinen. Automated verification of weak equivalence within the smodels system. Theory and Practice of Logic Programming, 7(6):697–744, November 2007. |
|
|
94 | Philippe Dumas, Helger Lipmaa, and Johan Wallén. Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation. Discrete Mathematics and Theoretical Computer Science, 9(1):247–274, 2007. |
|
|
93 | Harri Haanpää and Patric R. J. Östergård. Sets in Abelian groups with distinct sums of pairs. Journal of Number Theory, 123:144–153, 2007. |
|
|
92 | Pekka Orponen. "P = NP" -ongelma ja laskennan vaativuusteoria. Tietojenkäsittelytiede, 26:54–67, 2007. |
|
|
91 | Satu Elisa Schaeffer. Graph clustering. Computer Science Review, 1(1):27–64, 2007. |
|
|
90 | Kaisa Nyberg. Kryptologia – tiedon turvaamisen tiede. Tietojenkäsittelytiede, 26:32–53, Heinäkuu 2007. |
|
2006 |
|
89 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Silvio Ranise, Peter van Rossum, and Roberto Sebastiani. Efficient theory combination via boolean search. Information and Computation, 204(10):1493–1525, October 2006. |
|
|
88 | Tomi Janhunen. Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics, 16(1–2):35–86, June 2006. Special issue on implementation of logics. |
|
|
87 | Malcolm Greig, Harri Haanpää, and Petteri Kaski. On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. Journal of Combinatorial Theory, Series A, 113(4):703–711, May 2006. |
|
|
86 | Stefano Marinoni and Hannu H. Kari. Ad hoc routing protocol performance: a realistic simulation based study. Telecommunication Systems, 33(1-3):269–289, 2006. |
|
|
85 | Harri Haanpää and Patric R. J. Östergård. Steinerin kolmikkojärjestelmistä sudokuun. Arkhimedes, 2006(2):18–21, 2006. In Finnish. |
|
|
84 | Armin Biere, Keijo Heljanko, Tommi Junttila, Timo Latvala, and Viktor Schuppan. Linear encodings of bounded LTL model checking. Logical Methods in Computer Science, 2(5:5), 2006. (doi: 10.2168/LMCS-2(5:5)2006). |
|
|
83 | Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence, 170(12-13):1031–1080, 2006. |
|
|
82 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä. Hard satisfiable clause sets for benchmarking equivalence reasoning techniques. Journal on Satisfiability, Boolean Modeling and Computation, 2(1-4):27–46, 2006. |
|
|
81 | Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, and Jia-Huai You. Unfolding partiality and disjunctions in stable model semantics. ACM Transactions on Computational Logic, 7(1):1–37, January 2006. |
|
2005 |
|
80 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Exact and approximate balanced data gathering in energy-constrained sensor networks. Theoretical Computer Science, 344(1):30–46, November 2005. |
|
|
79 | Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, and Roberto Sebastiani. MathSAT: Tight integration of SAT and mathematical decision procedures. Journal of Automated Reasoning, 35(1–3):265–293, October 2005. |
|
|
78 | Harri Haanpää and Petteri Kaski. The near resolvable 2-(13, 4, 3) designs and thirteen-player whist tournaments. Designs, Codes and Cryptography, 35(3):271–285, June 2005. |
|
|
77 | Sakari Seitz, Mikko Alava, and Pekka Orponen. Focused local search for random 3-satisfiability. Journal of Statistical Mechanics: Theory and Experiment, P06006:1–27, June 2005. |
|
|
76 | Evan Griffiths and Pekka Orponen. Optimization, block designs and No Free Lunch theorems. Information Processing Letters, 94(2):55–61, April 2005. |
|
|
75 | Janne Lundberg, Catharina Candolin, and Hannu H. Kari. Multicast source authentication for limited devices. WSEAS Transactions on Computers, 4(4), 2005. |
|
|
74 | Janne Lundberg, Catharina Candolin, and Hannu H. Kari. Multicast source authentication for limited devices. WSEAS Transactions on Computers, 4(4), 2005. |
|
|
73 | Kimmo Varpaaniemi. On stubborn sets in the verification of linear time temporal properties. Formal Methods in System Design, 26(1):45–67, January 2005. © 2005 Springer Science + Business Media, Inc. (Norwell, MA, USA; Dordrecht, The Netherlands; Berlin, Germany). |
|
|
72 | Harri Haanpää. No 17-player triplewhist tournament has nontrivial automorphisms. Journal of Combinatorial Designs, 13:345–348, 2005. |
|
|
71 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence, 44(4):373–399, 2005. |
|
|
70 | Patrik Floréen, Petteri Kaski, Jukka Kohonen, and Pekka Orponen. Lifetime maximization for multicasting in energy-constrained wireless networks. IEEE Journal on Selected Areas in Communications, 23(1):117–126, January 2005. |
|
|
69 | Petteri Kaski and Patric R. J. Östergård. One-factorizations of regular graphs of order 12. Electronic Journal of Combinatorics, 12:R2, 2005. |
|
|
68 | Petteri Kaski. Isomorph-free exhaustive generation of designs with prescribed groups of automorphisms. SIAM Journal on Discrete Mathematics, 19(3):664–690, 2005. |
|
|
67 | Petteri Kaski. Nonexistence of perfect Steiner triple systems of orders 19 and 21. Bayreuther Mathematische Schriften, 74:130–135, 2005. Proceedings of ALCOMA05, April 3–10, Thurnau, Germany. |
|
|
66 | Toni Jussila, Keijo Heljanko, and Ilkka Niemelä. BMC via on-the-fly determinization. International Journal on Software Tools for Technology Transfer, 7(2):89 – 101, 2005. |
|
2004 |
|
65 | Harri Haanpää. Minimum sum and difference covers of Abelian groups. Journal of Integer Sequences, 7(2):article 04.1.8, 2004. |
|
|
64 | Harri Haanpää, Antti Huima, and Patric R. J. Östergård. Sets in  with distinct sums of pairs. Discrete Applied Mathematics, 138:99–106, 2004. |
|
|
63 | Gerhard Brewka, Ilkka Niemelä, and Tommi Syrjänen. Logic programs with ordered disjunction. Computational Intelligence, 20(2):333–357, 2004. |
|
|
62 | Matti Järvisalo. Lauselogiikan toteutuvuustarkastus: käytännönläheistä teoriaa. Tietojenkäsittelytiede, 22:47–63, 2004. In Finnish. |
|
|
61 | Petteri Kaski and Patric R. J. Östergård. Enumeration of balanced ternary designs. Discrete Applied Mathematics, 138(1–2):133–141, 2004. |
|
|
60 | Petteri Kaski and Patric R. J. Östergård. Miscellaneous classification results for 2-designs. Discrete Mathematics, 280(1–3):65–75, 2004. |
|
|
59 | Petteri Kaski. Packing Steiner trees with identical terminal sets. Information Processing Letters, 91(1):1–5, 2004. |
|
|
58 | Petteri Kaski and Patric R. J. Östergård. The Steiner triple systems of order 19. Mathematics of Computation, 73:2075–2092, 2004. |
|
|
57 | Petteri Kaski and Patric R. J. Östergård. There exist nonisomorphic STS(19) with equivalent point codes. Journal of Combinatorial Designs, 12(6):443–448, 2004. |
|
|
56 | Timo Latvala and Heikki Tauriainen. Improved on-the-fly verification with testers. Nordic Journal of Computing, 11(2):148–164, 2004. |
|
2003 |
|
55 | Jiří Šíma and Pekka Orponen. General purpose computation with neural networks: A survey of complexity theoretic results. Neural Computation, 15(12):2727–2778, December 2003. |
|
|
54 | Pekka Orponen. Tietotekniikkaa ennen tietokoneita — Alan Turing ja tietotekniikan kiehtovat alkuvaiheet. Tietoa, pages 4–6, November 2003. |
|
|
53 | Jiří Šíma and Pekka Orponen. Exponential transients in continuous-time Liapunov systems. Theoretical Computer Science, 306(1–3):353–372, September 2003. |
|
|
52 | Jiří Šíma and Pekka Orponen. Continuous-time symmetric Hopfield nets are computationally universal. Neural Computation, 15(3):693–733, March 2003. |
|
|
51 | Tomi Janhunen. Evaluating the effect of semi-normality on the expressiveness of defaults. Artificial Intelligence, 144(1–2):233–250, March 2003. |
|
|
50 | Kimmo Varpaaniemi. Towards ambitious approximation algorithms in stubborn set optimization. Fundamenta Informaticae (Annales Societatis Mathematicae Polonae, Series IV), 54(2–3):279–294, February 2003. IOS Press, Amsterdam, The Netherlands. |
|
|
49 | Evan Griffiths. Limit lemmas and jump inversion in the enumeration degrees. Archive for Mathematical Logic, 42(6), 2003. |
|
|
48 | Harri Haanpää and Patric R. J. Östergård. Classification of whist tournaments with up to 12 players. Discrete Applied Mathematics, 129:399–407, 2003. |
|
|
47 | Keijo Heljanko and Ilkka Niemelä. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming, 3(4&5):519–550, 2003. Also available as (CoRR: arXiv:cs.LO/0305040). |
|
|
46 | Pekka Orponen. Mitä tietojenkäsittelyteoriaan kuuluu?. Tietojenkäsittelytiede, 19:15–28, 2003. |
|
|
45 | Petteri Kaski, Luis B. Morales, Patric R. J. Östergård, David A. Rosenblueth, and Carlos Velarde. Classification of resolvable 2-(14,7,12) and 3-(14,7,5) designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 47:65–74, 2003. |
|
2002 |
|
44 | Kimmo Varpaaniemi. Minimizing the number of successor states in the stubborn set method. Fundamenta Informaticae (Annales Societatis Mathematicae Polonae, Series IV), 51(1–2):215–234, May 2002. IOS Press, Amsterdam, The Netherlands. |
|
|
43 | Pekka Nikander, Catharina Candolin, and Janne Lundberg. From address orientation to host orientation. Réseaux et systèmes répartis, calculateurs parallèles, ISSN 1260-3198, Special Issue on Mobility and Internet, 13, 2002. |
|
|
42 | Catharina Candolin. Ad hoc -johtamisverkot. Maanpuolustuksen aikakauslehti, 1(1), 2002. |
|
|
41 | Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1–2):181–234, 2002. |
|
|
40 | Patric R. J. Östergård and Petteri Kaski. Enumeration of 2-(9,3,lambda) designs and their resolutions. Designs, Codes and Cryptography, 27:131–137, 2002. |
|
2001 |
|
39 | Marko Mäkelä. Rinnakkaisuus hallintaan—formaalit menetelmät mutkikkaiden järjestelmien suunnittelun apuna. Prosessori, pages 68–71, November 2001. Erikoisnumero: elektroniikan suunnittelu (ES). |
|
|
38 | Stefan Brass, Jürgen Dix, Ilkka Niemelä, and T.C. Przymusinski. On the equivalence of the static and disjunctive well-founded semantics and its computation. Theoretical Computer Science, 258(1–2):523–553, May 2001. |
|
|
37 | Galina T. Bogdanova, Andries E. Brouwer, Stoian N. Kapralov, and Patric R.J. Östergård. Error-correcting codes over an alphabet of four elements. Designs, Codes and Cryptography, 23(3):333–342, 2001. |
|
|
36 | Galina T. Bogdanova and Patric R.J. Östergård. Bounds on codes over an alphabet of five elements. Discrete Mathematics, 240(1–3):13–19, 2001. |
|
|
35 | Alexander A. Davydov and Patric R.J. Östergård. Linear codes with covering radius  and codimension  . IEEE Transactions on Information Theory, 47(1):416–421, 2001. |
|
|
34 | Alexander A. Davydov and Patric R.J. Östergård. Recursive constructions of complete caps. Journal of Statistical Planning and Inference, 95(1–2):167–173, 2001. |
|
|
33 | T. Aaron Gulliver and Patric R.J. Östergård. Improved bounds for ternary linear codes of dimension 8 using tabu search. Journal of Heuristics, 7(1):37–46, 2001. |
|
|
32 | Patric R.J. Östergård. A new algorithm for the maximum-weight clique problem. Nordic Journal of Computing, 8(4):424–436, 2001. |
|
|
31 | Patric R.J. Östergård. There are 270,474,142 nonisomorphic 2-(9,4,6) designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 37(1):173–176, 2001. |
|
|
30 | Patric R.J. Östergård and Uri Blass. On the size of optimal binary codes of length 9 and covering radius 1. IEEE Transactions on Information Theory, 47(6):2556–2557, 2001. |
|
|
29 | Patric R.J. Östergård and William D. Weakley. Values of domination numbers of the queen's graph. The Electronic Journal of Combinatorics, 8(1), 2001. |
|
|
28 | Petteri Kaski and Patric R. J. Östergård. There exists no (15,5,4) RBIBD. Journal of Combinatorial Designs, 9(5):357–362, 2001. |
|
|
27 | Leo Ojala, Nisse Husberg, and Teemu Tynjälä. Modelling and Analysing a Distributed Dynamic Channel Allocation Algorithm for Mobile Computing Using High-Level Net Methods. Software Tools for Technology Transfer, 3, 2001. |
|
|
26 | Tommi A. Junttila. Computational complexity of the Place/Transition-net symmetry reduction method. Journal of Universal Computer Science, 7(4):307–326, 2001. |
|
2000 |
|
25 | Kimmo Varpaaniemi. Stable models for stubborn sets. Fundamenta Informaticae (Annales Societatis Mathematicae Polonae, Series IV), 43(1–4):355–375, August 2000. IOS Press, Amsterdam, The Netherlands. |
|
|
24 | Tuomas Aura and Johan Lilius. A causal semantics for time petri nets. Theoretical Computer Science, 243(1–2):409–447, 2000. |
|
|
23 | Alexander Davydov and Patric R.J. Östergård. New quaternary linear codes with covering radius 2. Finite Fields and Their Applications, 6(2):164–174, 2000. |
|
|
22 | Alexander Davydov and Patric R.J. Östergård. On saturating sets in small projective geometries. European Journal of Combinatorics, 21(5):563–570, 2000. |
|
|
21 | T. Aaron Gulliver and Patric R.J. Östergård. New binary linear codes. Ars Combinatoria, 56(1):105–112, 2000. |
|
|
20 | Filip Karlemo and Patric R.J. Östergård. On sliding block puzzles. Journal of Combinatorial Mathematics and Combinatorial Computing, 34(1):97–107, 2000. |
|
|
19 | Kari J. Nurmela. Conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles. Experimental Mathematics, 9(1):241–250, 2000. |
|
|
18 | Patric R.J. Östergård. Classification of binary/ternary one-error correcting codes. Discrete Mathematics, 223(1–3):253–262, 2000. |
|
|
17 | Patric R.J. Östergård. Enumeration of  designs. The Australasian Journal of Combinatorics, 22(1):227–231, 2000. |
|
|
16 | Patric R.J. Östergård. Computer search for small complete caps. Journal of Geometry, 69(1–2):172–179, 2000. |
|
|
15 | Patric R.J. Östergård and William D. Weakley. Classification of binary covering codes. Journal of Combinatorial Designs, 8(6):391–401, 2000. |
|
|
14 | Harri Haanpää. A lower bound for a Ramsey number. Congressus Numerantium, 144:189–191, 2000. |
|
|
13 | Timo Latvala and Keijo Heljanko. Coping with strong fairness. Fundamenta Informaticae, 43(1–4):175–193, 2000. |
|
1999 |
|
12 | Tommi A. Junttila. Finding symmetries of algebraic system nets. Fundamenta Informaticae, 37(3):269–289, February 1999. |
|
|
11 | Ilkka Niemelä. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241–273, 1999. |
|
|
10 | Keijo Heljanko. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae, 37(3):247–268, 1999. |
|
|
9 | Tomi Janhunen. On the intertranslatability of non-monotonic logics. Annals of Mathematics and Artificial Intelligence, 27(1-4):79–128, 1999. Special issue with the selected best papers from JELIA 1998. |
|
1998 |
|
8 | Gerd Brewka and Ilkka Niemelä. Report on the Seventh International Workshop on Nonmonotonic Reasoning. AI Magazine, 19(4):139, 1998. |
|
1997 |
|
7 | C. Aravindan, J. Dix, and Ilkka Niemelä. DisLoP: A research project on disjunctive logic programming. AI Communications, 10(3,4):151–165, 1997. |
|
|
6 | C. Aravindan, J. Dix, and Ilkka Niemelä. DisLoP: A research project on disjunctive logic programming. Computational Logic, 3(2), 1997. |
|
1996 |
|
5 | Kaisa Nyberg and Rainer A. Rueppel. Message recovery for signature schemes based on the discrete logarithm problem. Designs, Codes and Cryptography, 7(1–2):61–81, 1996. |
|
1995 |
|
4 | Ilkka Niemelä. A decision method for nonmonotonic reasoning based on autoepistemic reasoning. Journal of Automated Reasoning, 14:3–42, 1995. |
|
1994 |
|
3 | Ilkka Niemelä. Autoepisteeminen logiikka epämonotonisen päättelyn pohjana. Tietojenkäsittelytiede, 6:15–25, 1994. |
|
|
2 | Ilkka Niemelä and Jussi Rintanen. On the impact of stratification on the complexity of nonmonotonic reasoning. Journal of Applied Non-Classical Logics, 4(2):141–179, 1994. |
|
1992 |
|
1 | Ilkka Niemelä. On the decidability and complexity of autoepistemic reasoning. Fundamenta Informaticae, 17(1,2):117–155, 1992. |
|
