Eljas Soisalon-Soininen

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
85Online Dictionary Matching with Variable-Length Gaps. Tuukka Haapasalo, Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen. SEA 2011, 76-87. Web SearchBibTeXDownload
2010
84Online Dictionary Matching for Streams of XML Documents. Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen. IFIP TCS 2010, 153-164. Web SearchBibTeXDownload
83Evaluating Linear XPath Expressions by Pattern-Matching Automata. Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen. J. UCS (16): 833-851 (2010). Web SearchBibTeXDownload
2009
82Schema-conscious filtering of XML documents. Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen. EDBT 2009, 970-981. Web SearchBibTeXDownload
81Transactions on the multiversion B+-tree. Tuukka K. Haapasalo, Ibrahim Jaluta, Bernhard Seeger, Seppo Sippu, Eljas Soisalon-Soininen. EDBT 2009, 1064-1075. Web SearchBibTeXDownload
80Concurrent updating transactions on versioned data. Tuukka K. Haapasalo, Seppo Sippu, Ibrahim Jaluta, Eljas Soisalon-Soininen. IDEAS 2009, 77-87. Web SearchBibTeXDownload
79Bulk-Insertion Sort: Towards Composite Measures of Presortedness. Riku Saikkonen, Eljas Soisalon-Soininen. SEA 2009, 269-280. Web SearchBibTeXDownload
78Processing Schema-Optimized XPath Filters by Deterministic Automata. Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen. SEDE 2009, 55-60. Web SearchBibTeX
2008
77Cache-sensitive Memory Layout for Binary Trees. Riku Saikkonen, Eljas Soisalon-Soininen. IFIP TCS 2008, 241-255. Web SearchBibTeXDownload
76Concurrency control and recovery for multiversion database structures. Tuukka K. Haapasalo, Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen. PIKM 2008, 73-80. Web SearchBibTeXDownload
75XML-document-filtering automaton. Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen. PVLDB (1): 1666-1671 (2008). Web SearchBibTeXDownload
2007
74A Two-Phased Visual Query Interface for Relational Databases. Sami El-Mahgary, Eljas Soisalon-Soininen. DEXA 2007, 489-498. Web SearchBibTeXDownload
73Online Bulk Deletion. Timo Lilja, Riku Saikkonen, Seppo Sippu, Eljas Soisalon-Soininen. ICDE 2007, 956-965. Web SearchBibTeXDownload
2006
72B-tree concurrency control and recovery in page-server database systems. Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen. ACM Trans. Database Syst. (31): 82-132 (2006). Web SearchBibTeXDownload
2005
71Concurrency control and recovery for balanced B-link trees. Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen. VLDB J. (14): 257-277 (2005). Web SearchBibTeXDownload
2004
70Concurrency Control and I/O-Optimality in Bulk Insertion.. Kerttu Pollari-Malmi, Eljas Soisalon-Soininen. SPIRE 2004, 161-170. Web SearchBibTeXDownload
69On Classification of Strings. Eljas Soisalon-Soininen, Tatu Ylönen. SPIRE 2004, 321-330. Web SearchBibTeXDownload
2003
68Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis. Eljas Soisalon-Soininen, Peter Widmayer. Computer Science in Perspective 2003, 278-292. Web SearchBibTeXDownload
67Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer. Theory Comput. Syst. (36): 611-629 (2003). Web SearchBibTeXDownload
2002
66Distributed Highly Available Search Trees. Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer. SIROCCO 2002, 259-274. Web SearchBibTeX
65Amortized Complexity of Bulk Updates in AVL-Trees. Eljas Soisalon-Soininen, Peter Widmayer. SWAT 2002, 439-448. Web SearchBibTeXDownload
2001
64Relaxed balance for search trees with local rebalancing. Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen. Acta Inf. (37): 743-763 (2001). Web SearchBibTeXDownload
63Relaxed Balance Using Standard Rotations. Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer. Algorithmica (31): 501-512 (2001). Web SearchBibTeXDownload
62Transitive closure algorithm MEMTC and its performance analysis. Vesa Hirvisalo, Esko Nuutila, Eljas Soisalon-Soininen. Discrete Applied Mathematics (110): 77-84 (2001). Web SearchBibTeXDownload
61A Theory of Transactions on Recoverable Search Trees. Seppo Sippu, Eljas Soisalon-Soininen. ICDT 2001, 83-98. Web SearchBibTeXDownload
2000
60Group Updates for Red-Black Trees. Sabine Hanke, Eljas Soisalon-Soininen. CIAC 2000, 253-262. Web SearchBibTeXDownload
59Concurrency Control for B-Trees with Differential Indices. Kerttu Pollari-Malmi, Jarmo Ruuth, Eljas Soisalon-Soininen. IDEAS 2000, 287-295. Web SearchBibTeXDownload
1999
58Group Updates for Relaxed Height-Balanced Trees. Lauri Malmi, Eljas Soisalon-Soininen. PODS 1999, 358-367. Web SearchBibTeX
57Concurrency and Recovery in Full-Text Indexing. Eljas Soisalon-Soininen, Peter Widmayer. SPIRE/CRIWG 1999, 192-198. Web SearchBibTeXDownload
1997
56Relaxed Balancing in Search Trees. Eljas Soisalon-Soininen, Peter Widmayer. Advances in Algorithms, Languages, and Complexity 1997, 267-283. Web SearchBibTeX
55Relaxed Balanced Red-Black Trees. Sabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen. CIAC 1997, 193-204. Web SearchBibTeXDownload
54Relaxed Balance for Search Trees with Local Rebalancing. Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen. ESA 1997, 350-363. Web SearchBibTeXDownload
53Relaxed Balance through Standard Rotations. Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer. WADS 1997, 450-461. Web SearchBibTeXDownload
1996
52Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing. Otto Nurmi, Eljas Soisalon-Soininen. Acta Inf. (33): 547-557 (1996). Web SearchBibTeXDownload
51Concurrency Control in B-Trees with Batch Updates. Kerttu Pollari-Malmi, Eljas Soisalon-Soininen, Tatu Ylönen. IEEE Trans. Knowl. Data Eng. (8): 975-984 (1996). Web SearchBibTeXDownload
50An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries. Seppo Sippu, Eljas Soisalon-Soininen. J. ACM (43): 1046-1088 (1996). Web SearchBibTeXDownload
1995
49Partial Strictness in Two-Phase Locking. Eljas Soisalon-Soininen, Tatu Ylönen. ICDT 1995, 139-147. Web SearchBibTeXDownload
48Safety by Uninterpreted Locks. Georg Lausen, Eljas Soisalon-Soininen. Inf. Comput. (117): 37-49 (1995). Web SearchBibTeXDownload
1994
47Avoiding Redundant Computations in Evaluating Linear Queries. Seppo Sippu, Eljas Soisalon-Soininen. Australasian Database Conference 1994, 124-135. Web SearchBibTeX
46On Finding the Strongly Connected Components in a Directed Graph. Esko Nuutila, Eljas Soisalon-Soininen. Inf. Process. Lett. (49): 9-14 (1994). Web SearchBibTeXDownload
1991
45Efficient Evaluation for a Subset of Recursive Queries. Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen. J. Log. Program. (10): 301-332 (1991). Web SearchBibTeXDownload
44Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. Otto Nurmi, Eljas Soisalon-Soininen. PODS 1991, 192-198. Web SearchBibTeX
1990
43Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization. Seppo Sippu, Eljas Soisalon-Soininen. ICDT 1990, 485-498. Web SearchBibTeXDownload
42On the Power of Safe Locking. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer. J. Comput. Syst. Sci. (40): 269-288 (1990). Web SearchBibTeXDownload
41Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries. Juhani Kuittinen, Otto Nurmi, Seppo Sippu, Eljas Soisalon-Soininen. VLDB 1990, 372-379. Web SearchBibTeX
1989
40Locling Policies and Predeclared Transactions. Georg Lausen, Eljas Soisalon-Soininen. MFDBS 1989, 317-336. Web SearchBibTeXDownload
1988
39An Optimization Strategy for Recursive Queries in Logic Databases. Seppo Sippu, Eljas Soisalon-Soininen. ICDE 1988, 470-477. Web SearchBibTeXDownload
38Looping LR Parsers. Eljas Soisalon-Soininen, Jorma Tarhio. Inf. Process. Lett. (26): 251-253 (1988). Web SearchBibTeXDownload
37A Generalized Transitive Closure for Relational Queries. Seppo Sippu, Eljas Soisalon-Soininen. PODS 1988, 325-332. Web SearchBibTeX
1987
36Partitioning and separating sets of orthogonal polygons. Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood. Inf. Sci. (42): 31-49 (1987). Web SearchBibTeXDownload
35Efficient Evaluation for a Subset of Recursive Queries. Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen. PODS 1987, 284-293. Web SearchBibTeX
34Concurrency Control in Database Structures with Relaxed Balance. Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood. PODS 1987, 170-176. Web SearchBibTeX
1986
33Towards Online Schedulers Based on Pre-Analysis Locking. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer. ICDT 1986, 242-259. Web SearchBibTeXDownload
32Pre-analysis Locking. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer. Information and Control (70): 193-215 (1986). Web SearchBibTeXDownload
31A Note on Approximate Convex Hulls. Ivan Stojmenovic, Eljas Soisalon-Soininen. Inf. Process. Lett. (22): 55-56 (1986). Web SearchBibTeXDownload
1985
30On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract). Seppo Sippu, Eljas Soisalon-Soininen. ICALP 1985, 456-464. Web SearchBibTeXDownload
29Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer. VLDB 1985, 270-281. Web SearchBibTeX
1984
28The Complexity and Decidability of Separation. Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood. ICALP 1984, 119-127. Web SearchBibTeXDownload
27On the Complexity of Concurrency Control by Locking in Distributed Database Systems. Eljas Soisalon-Soininen, Peter Widmayer. Information and Control (60): 103-108 (1984). Web SearchBibTeXDownload
26On the Definition and Computation of Rectlinear Convex Hulls. Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood. Inf. Sci. (33): 157-171 (1984). Web SearchBibTeXDownload
25Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles. Eljas Soisalon-Soininen, Derick Wood. J. Algorithms (5): 199-214 (1984). Web SearchBibTeXDownload
24Maximal Concurrency by Locking. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer. PODS 1984, 38-44. Web SearchBibTeX
1983
23A Syntax-Error-Handling Technique and Its Experimental Analysis. Seppo Sippu, Eljas Soisalon-Soininen. ACM Trans. Program. Lang. Syst. (5): 656-679 (1983). Web SearchBibTeXDownload
22On Computing Approximate Convex Hulls. Eljas Soisalon-Soininen. Inf. Process. Lett. (16): 121-126 (1983). Web SearchBibTeXDownload
21The Complexity of LALR(k) Testing. Seppo Sippu, Eljas Soisalon-Soininen, Esko Ukkonen. J. ACM (30): 259-270 (1983). Web SearchBibTeXDownload
20On the Complexity of LL(k) Testing. Seppo Sippu, Eljas Soisalon-Soininen. J. Comput. Syst. Sci. (26): 244-268 (1983). Web SearchBibTeXDownload
1982
19Inessential Error Entries and Their Use in LR Parser Optimization. Eljas Soisalon-Soininen. ACM Trans. Program. Lang. Syst. (4): 179-195 (1982). Web SearchBibTeXDownload
18On a Covering Relation for Context-Free Grammars. Eljas Soisalon-Soininen, Derick Wood. Acta Inf. (17): 435-449 (1982). Web SearchBibTeXDownload
17Translations on a Subclass of LR(k) Grammars. Eljas Soisalon-Soininen. BIT (22): 303-312 (1982). Web SearchBibTeX
16On LL(k) Parsing. Seppo Sippu, Eljas Soisalon-Soininen. Information and Control (53): 141-164 (1982). Web SearchBibTeXDownload
15An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. Eljas Soisalon-Soininen, Derick Wood. PODS 1982, 108-116. Web SearchBibTeX
14Practical Error Recovery in LR Parsing. Seppo Sippu, Eljas Soisalon-Soininen. POPL 1982, 177-184. Web SearchBibTeXDownload
1981
13On LALR(1) Testing. Seppo Sippu, Eljas Soisalon-Soininen. ICALP 1981, 208-217. Web SearchBibTeXDownload
12On Structural Similarity of Context-Free Grammars. Eljas Soisalon-Soininen, Derick Wood. MFCS 1981, 491-498. Web SearchBibTeXDownload
11LALR(k) Testing is PSPACE-Complete. Esko Ukkonen, Eljas Soisalon-Soininen. STOC 1981, 202-206. Web SearchBibTeXDownload
1980
10On the Space Optimizing Effect of Eliminating Single Productions from LR Parsers. Eljas Soisalon-Soininen. Acta Inf. (14): 157-174 (1980). Web SearchBibTeXDownload
9Characterizations of the LL(k) Property. Seppo Sippu, Eljas Soisalon-Soininen. ICALP 1980, 596-608. Web SearchBibTeXDownload
8On Comparing LL(k) and LR(k) Grammars. Eljas Soisalon-Soininen. Mathematical Systems Theory (13): 323-329 (1980). Web SearchBibTeXDownload
1979
7A Method for Transforming Grammars into LL(k) Form. Eljas Soisalon-Soininen, Esko Ukkonen. Acta Inf. (12): 339-369 (1979). Web SearchBibTeXDownload
6Con Constructing LL(k) Parsers. Seppo Sippu, Eljas Soisalon-Soininen. ICALP 1979, 585-595. Web SearchBibTeXDownload
5Ch(k) Grammars: A Characterization of LL(k) Languages. Anton Nijholt, Eljas Soisalon-Soininen. MFCS 1979, 390-397. Web SearchBibTeXDownload
4On the Covering Problem for Left-Recursive Grammars. Eljas Soisalon-Soininen. Theor. Comput. Sci. (8): 1-11 (1979). Web SearchBibTeXDownload
1977
3On Defining Error Recovery in Context-Free Parsing. Seppo Sippu, Eljas Soisalon-Soininen. ICALP 1977, 492-503. Web SearchBibTeXDownload
2Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions. Eljas Soisalon-Soininen. POPL 1977, 183-193. Web SearchBibTeXDownload
1976
1A Characterization of LL(k) Languages. Eljas Soisalon-Soininen, Esko Ukkonen. ICALP 1976, 20-30. Web SearchBibTeX
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research