The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Eljas Soisalon-Soininen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  75. Concurrency control and recovery for multiversion database structures. [Citation Graph (, )][DBLP]


  76. Schema-conscious filtering of XML documents. [Citation Graph (, )][DBLP]


  77. Transactions on the multiversion B+-tree. [Citation Graph (, )][DBLP]


  78. Concurrent updating transactions on versioned data. [Citation Graph (, )][DBLP]


  79. Cache-sensitive Memory Layout for Binary Trees. [Citation Graph (, )][DBLP]


  80. Processing Schema-Optimized XPath Filters by Deterministic Automata. [Citation Graph (, )][DBLP]


  81. Bulk-Insertion Sort: Towards Composite Measures of Presortedness. [Citation Graph (, )][DBLP]


Search in 0.146secs, Finished in 0.149secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002