- Peter Gazi, Branislav Rovan:
Assisted Problem Solving and Decompositions of Finite Automata. SOFSEM 2008: 292-303 - Christian Gunia:
Energy-Efficient Windows Scheduling. SOFSEM 2008: 304-315 - Costas S. Iliopoulos, M. Sohel Rahman:
A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns. SOFSEM 2008: 316-327 - Natasa Jonoska, Gregory L. McColm:
Describing Self-assembly of Nanostructures. SOFSEM 2008: 66-73 - Piotr Kalita
, Igor T. Podolak, Adam Roman, Bartosz Bierkowski:
Algorithm for Intelligent Prediction of Requests in Business Systems. SOFSEM 2008: 696-707 - Jarkko Kari:
On the Undecidability of the Tiling Problem. SOFSEM 2008: 74-82 - Przemyslaw Kazienko, Katarzyna Musial:
Mining Personal Social Features in the Community of Email Users. SOFSEM 2008: 708-719 - Marek Klonowski, Przemyslaw Kubiak, Miroslaw Kutylowski:
Practical Deniable Encryption. SOFSEM 2008: 599-609 - Marek Klonowski, Tomasz Struminski:
Proofs of Communication and Its Application for Fighting Spam. SOFSEM 2008: 720-730 - Adam Koprowski, Hans Zantema:
Certification of Proving Termination of Term Rewriting by Matrix Interpretations. SOFSEM 2008: 328-339 - Matej Kosík:
Taming of Pict. SOFSEM 2008: 610-621 - Marek Kretowski
:
A Memetic Algorithm for Global Induction of Decision Trees. SOFSEM 2008: 531-540 - Milos Kudelka, Václav Snásel, Ondrej Lehecka, Eyas El-Qawasmeh, Jaroslav Pokorný:
Web Pages Reordering and Clustering Based on Web Patterns. SOFSEM 2008: 731-742 - Vera Kurková
, Marcello Sanguineti:
Geometric Rates of Approximation by Neural Networks. SOFSEM 2008: 541-550 - Marián Lekavý, Pavol Návrat
:
Extension of Rescheduling Based on Minimal Graph Cut. SOFSEM 2008: 340-351 - Mila E. Majster-Cederbaum, Christoph Minnameier:
Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets. SOFSEM 2008: 352-363 - Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara
, Tomoyuki Nakamura, Kazuo Hashimoto:
Computing Longest Common Substring and All Palindromes from Compressed Strings. SOFSEM 2008: 364-375 - Shoichi Morimoto, Shinjiro Shigematsu, Yuichi Goto, Jingde Cheng:
Classification, Formalization and Verification of Security Functional Requirements. SOFSEM 2008: 622-633 - Neza Mramor-Kosta, Eva Trenklerová:
Basic Sets in the Digital Plane. SOFSEM 2008: 376-387 - Radim Nedbal:
Algebraic Optimization of Relational Queries with Various Kinds of Preferences. SOFSEM 2008: 388-399 - C. Nuccio, Emanuele Rodaro:
Mortality Problem for 2×2 Integer Matrices. SOFSEM 2008: 400-405 - Holger Petersen:
Element Distinctness and Sorting on One-Tape Off-Line Turing Machines. SOFSEM 2008: 406-417 - Holger Petersen:
Improved Bounds for Range Mode and Range Median Queries. SOFSEM 2008: 418-423 - Camelia-Mihaela Pintea
, Camelia Chira, D. Dumitrescu, Petrica C. Pop
:
A Sensitive Metaheuristic for Solving a Large Optimization Problem. SOFSEM 2008: 551-559 - Jordi Pont-Tuset, Pau Medrano-Gracia, Jordi Nin, Josep Lluís Larriba-Pey, Victor Muntés-Mulero
:
ONN the Use of Neural Networks for Data Privacy. SOFSEM 2008: 634-645 - Frank G. Radmacher:
An Automata Theoretic Approach to Rational Tree Relations. SOFSEM 2008: 424-435 - Astrid Rakow:
Slicing Petri Nets with an Application to Workflow Verification. SOFSEM 2008: 436-447 - Adam Roman, Wit Forys:
Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata. SOFSEM 2008: 448-459 - Ahmad-Reza Sadeghi:
Trusted Computing - Special Aspects and Challenges. SOFSEM 2008: 98-117 - Radovan Sesták, Jan Lansky:
Compression of Concatenated Web Pages Using XBW. SOFSEM 2008: 743-754