Eljas Soisalon-Soininen

101 papers A* 22A 5B 10C 8Misc 1Journal 39Unranked 13

Year	Rank	Type	Title / Venue / Authors
2024	—	`conf`	Lightweight Latches for B-Trees to Cope with High Contention. DEXA (2) Amir El-Shaikh, Bernhard Seeger, Eljas Soisalon-Soininen
2023	J	`jnl`	OVI-3: A NoSQL visual query system supporting efficient anti-joins. J. Intell. Inf. Syst. Sami El-Mahgary, Eljas Soisalon-Soininen, Pekka Orponen, Petri Rönnholm, Hannu Hyyppä
2017	—	`conf`	Extracting Service Process Models with Teams. SIMPDA Tuuli Klemetti, Reijo Salminen, Olli Martikainen, Riku Saikkonen, Eljas Soisalon-Soininen
2016	J	`jnl`	Cache-Sensitive Memory Layout for Dynamic Binary Trees. Comput. J. Riku Saikkonen, Eljas Soisalon-Soininen
2016	—	`conf`	Extracting Service Process Models from Location Data. SIMPDA (Revised Selected Papers) Ye Zhang, Olli Martikainen, Riku Saikkonen, Eljas Soisalon-Soininen
2016	—	`conf`	Location-based Automated Process Modelling. SIMPDA Ye Zhang, Olli Martikainen, Riku Saikkonen, Eljas Soisalon-Soininen
2016	A*	`conf`	Message from the ICDE 2016 Program Committee and general chairs. ICDE Mei Hsu, Alfons Kemper, Timos K. Sellis, Boris Novikov, Eljas Soisalon-Soininen
2015	J	`jnl`	A form-based query interface for complex queries. J. Vis. Lang. Comput. Sami El-Mahgary, Eljas Soisalon-Soininen
2015	B	`conf`	Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps. SEA Riku Saikkonen, Seppo Sippu, Eljas Soisalon-Soininen
2014	—	`book`	Transaction Processing - Management of the Logical Database and its Underlying Physical Structure Seppo Sippu, Eljas Soisalon-Soininen
2013	J	`jnl`	On the Recovery of R-Trees. IEEE Trans. Knowl. Data Eng. Tuukka Haapasalo, Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen
2013	C	`conf`	Online Matching of Multiple Regular Patterns with Gaps and Character Classes. LATA Seppo Sippu, Eljas Soisalon-Soininen
2012	B	`conf`	A General Method for Improving Insertion-Based Adaptive Sorting. ISAAC Riku Saikkonen, Eljas Soisalon-Soininen
2011	B	`conf`	Online Dictionary Matching with Variable-Length Gaps. SEA Tuukka Haapasalo, Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
2010	J	`jnl`	Evaluating Linear XPath Expressions by Pattern-Matching Automata. J. Univers. Comput. Sci. Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
2010	—	`conf`	Online Dictionary Matching for Streams of XML Documents. IFIP TCS Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
2009	B	`conf`	Bulk-Insertion Sort: Towards Composite Measures of Presortedness. SEA Riku Saikkonen, Eljas Soisalon-Soininen
2009	C	`conf`	Concurrent updating transactions on versioned data. IDEAS Tuukka Haapasalo, Seppo Sippu, Ibrahim Jaluta, Eljas Soisalon-Soininen
2009	—	`conf`	Processing Schema-Optimized XPath Filters by Deterministic Automata. SEDE Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
2009	B	`conf`	Schema-conscious filtering of XML documents. EDBT Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
2009	B	`conf`	Transactions on the multiversion B EDBT Tuukka Haapasalo, Ibrahim Jaluta, Bernhard Seeger, Seppo Sippu, Eljas Soisalon-Soininen
2008	—	`conf`	Cache-sensitive Memory Layout for Binary Trees. IFIP TCS Riku Saikkonen, Eljas Soisalon-Soininen
2008	—	`conf`	Concurrency control and recovery for multiversion database structures. PIKM Tuukka K. Haapasalo, Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen
2008	J	`jnl`	XML-document-filtering automaton. Proc. VLDB Endow. Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
2007	C	`conf`	A Two-Phased Visual Query Interface for Relational Databases. DEXA Sami El-Mahgary, Eljas Soisalon-Soininen
2007	A*	`conf`	Online Bulk Deletion. ICDE Timo Lilja, Riku Saikkonen, Seppo Sippu, Eljas Soisalon-Soininen
2006	J	`jnl`	B-tree concurrency control and recovery in page-server database systems. ACM Trans. Database Syst. Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen
2005	J	`jnl`	Concurrency control and recovery for balanced B-link trees. VLDB J. Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen
2004	C	`conf`	Concurrency Control and I/O-Optimality in Bulk Insertion.. SPIRE Kerttu Pollari-Malmi, Eljas Soisalon-Soininen
2004	C	`conf`	On Classification of Strings. SPIRE Eljas Soisalon-Soininen, Tatu Ylönen
2003	J	`jnl`	Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. Theory Comput. Syst. Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer
2003	—	`conf`	Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis. Computer Science in Perspective Eljas Soisalon-Soininen, Peter Widmayer
2002	—	`conf`	Amortized Complexity of Bulk Updates in AVL-Trees. SWAT Eljas Soisalon-Soininen, Peter Widmayer
2002	B	`conf`	Distributed Highly Available Search Trees. SIROCCO Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer
2001	A	`conf`	A Theory of Transactions on Recoverable Search Trees. ICDT Seppo Sippu, Eljas Soisalon-Soininen
2001	J	`jnl`	Relaxed Balance Using Standard Rotations. Algorithmica Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer
2001	J	`jnl`	Relaxed balance for search trees with local rebalancing. Acta Informatica Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen
2001	J	`jnl`	Transitive closure algorithm MEMTC and its performance analysis. Discret. Appl. Math. Vesa Hirvisalo, Esko Nuutila, Eljas Soisalon-Soininen
2000	C	`conf`	Concurrency Control for B-Trees with Differential Indices. IDEAS Kerttu Pollari-Malmi, Jarmo Ruuth, Eljas Soisalon-Soininen
2000	C	`conf`	Group Updates for Red-Black Trees. CIAC Sabine Hanke, Eljas Soisalon-Soininen
1999	—	`conf`	Concurrency and Recovery in Full-Text Indexing. SPIRE/CRIWG Eljas Soisalon-Soininen, Peter Widmayer
1999	A*	`conf`	Group Updates for Relaxed Height-Balanced Trees. PODS Lauri Malmi, Eljas Soisalon-Soininen
1997	A	`conf`	Relaxed Balance for Search Trees with Local Rebalancing. ESA Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen
1997	B	`conf`	Relaxed Balance through Standard Rotations. WADS Kim S. Larsen, Eljas Soisalon-Soininen, Peter Widmayer
1997	C	`conf`	Relaxed Balanced Red-Black Trees. CIAC Sabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen
1997	—	`conf`	Relaxed Balancing in Search Trees. Advances in Algorithms, Languages, and Complexity Eljas Soisalon-Soininen, Peter Widmayer
1996	J	`jnl`	An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries. J. ACM Seppo Sippu, Eljas Soisalon-Soininen
1996	J	`jnl`	Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing. Acta Informatica Otto Nurmi, Eljas Soisalon-Soininen
1996	J	`jnl`	Concurrency Control in B-Trees with Batch Updates. IEEE Trans. Knowl. Data Eng. Kerttu Pollari-Malmi, Eljas Soisalon-Soininen, Tatu Ylönen
1996	J	`jnl`	Relaxed avl trees, main-memory databases and concurrency. Int. J. Comput. Math. Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood
1995	A	`conf`	Partial Strictness in Two-Phase Locking. ICDT Eljas Soisalon-Soininen, Tatu Ylönen
1995	J	`jnl`	Safety by Uninterpreted Locks Inf. Comput. Georg Lausen, Eljas Soisalon-Soininen
1994	Misc	`conf`	Avoiding Redundant Computations in Evaluating Linear Queries. Australasian Database Conference Seppo Sippu, Eljas Soisalon-Soininen
1994	J	`jnl`	On Finding the Strongly Connected Components in a Directed Graph. Inf. Process. Lett. Esko Nuutila, Eljas Soisalon-Soininen
1991	J	`jnl`	Efficient Evaluation for a Subset of Recursive Queries. J. Log. Program. Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen
1991	A*	`conf`	Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees. PODS Otto Nurmi, Eljas Soisalon-Soininen
1990	A*	`conf`	Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries. VLDB Juhani Kuittinen, Otto Nurmi, Seppo Sippu, Eljas Soisalon-Soininen
1990	A	`conf`	Multiple SIP Strategies and Bottom-Up Adorning in Logic Query Optimization. ICDT Seppo Sippu, Eljas Soisalon-Soininen
1990	J	`jnl`	On the Power of Safe Locking. J. Comput. Syst. Sci. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
1990	—	`book`	Parsing Theory - Volume II: LR(k) and LL(k) Parsing Seppo Sippu, Eljas Soisalon-Soininen
1989	—	`conf`	Locling Policies and Predeclared Transactions. MFDBS Georg Lausen, Eljas Soisalon-Soininen
1988	A*	`conf`	A Generalized Transitive Closure for Relational Queries. PODS Seppo Sippu, Eljas Soisalon-Soininen
1988	A*	`conf`	An Optimization Strategy for Recursive Queries in Logic Databases. ICDE Seppo Sippu, Eljas Soisalon-Soininen
1988	J	`jnl`	Looping LR Parsers. Inf. Process. Lett. Eljas Soisalon-Soininen, Jorma Tarhio
1988	—	`book`	Parsing Theory - Volume I: Languages and Parsing Seppo Sippu, Eljas Soisalon-Soininen
1987	A*	`conf`	Concurrency Control in Database Structures with Relaxed Balance. PODS Otto Nurmi, Eljas Soisalon-Soininen, Derick Wood
1987	A*	`conf`	Efficient Evaluation for a Subset of Recursive Queries. PODS Gösta Grahne, Seppo Sippu, Eljas Soisalon-Soininen
1987	J	`jnl`	Partitioning and separating sets of orthogonal polygons. Inf. Sci. Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
1986	J	`jnl`	A Note on Approximate Convex Hulls. Inf. Process. Lett. Ivan Stojmenovic, Eljas Soisalon-Soininen
1986	J	`jnl`	Pre-analysis Locking Inf. Control. Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
1986	A	`conf`	Towards Online Schedulers Based on Pre-Analysis Locking. ICDT Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
1985	A*	`conf`	On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract). ICALP Seppo Sippu, Eljas Soisalon-Soininen
1985	A*	`conf`	Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. VLDB Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
1984	A*	`conf`	Maximal Concurrency by Locking. PODS Georg Lausen, Eljas Soisalon-Soininen, Peter Widmayer
1984	J	`jnl`	On the Complexity of Concurrency Control by Locking in Distributed Database Systems Inf. Control. Eljas Soisalon-Soininen, Peter Widmayer
1984	J	`jnl`	On the Definition and Computation of Rectlinear Convex Hulls. Inf. Sci. Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
1984	J	`jnl`	Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles. J. Algorithms Eljas Soisalon-Soininen, Derick Wood
1984	A*	`conf`	The Complexity and Decidability of Separation. ICALP Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
1983	J	`jnl`	A Syntax-Error-Handling Technique and Its Experimental Analysis. ACM Trans. Program. Lang. Syst. Seppo Sippu, Eljas Soisalon-Soininen
1983	J	`jnl`	On Computing Approximate Convex Hulls. Inf. Process. Lett. Eljas Soisalon-Soininen
1983	J	`jnl`	On the Complexity of LL(k) Testing. J. Comput. Syst. Sci. Seppo Sippu, Eljas Soisalon-Soininen
1983	J	`jnl`	The Complexity of LALR(k) Testing J. ACM Seppo Sippu, Eljas Soisalon-Soininen, Esko Ukkonen
1982	A*	`conf`	An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. PODS Eljas Soisalon-Soininen, Derick Wood
1982	J	`jnl`	Inessential Error Entries and Their Use in LR Parser Optimization. ACM Trans. Program. Lang. Syst. Eljas Soisalon-Soininen
1982	J	`jnl`	On LL(k) Parsing Inf. Control. Seppo Sippu, Eljas Soisalon-Soininen
1982	J	`jnl`	On a Covering Relation for Context-Free Grammars. Acta Informatica Eljas Soisalon-Soininen, Derick Wood
1982	A*	`conf`	Practical Error Recovery in LR Parsing. POPL Seppo Sippu, Eljas Soisalon-Soininen
1982	J	`jnl`	Translations on a Subclass of LR(k) Grammars. BIT Eljas Soisalon-Soininen
1981	A*	`conf`	LALR(k) Testing is PSPACE-Complete STOC Esko Ukkonen, Eljas Soisalon-Soininen
1981	A*	`conf`	On LALR(1) Testing. ICALP Seppo Sippu, Eljas Soisalon-Soininen
1981	B	`conf`	On Structural Similarity of Context-Free Grammars. MFCS Eljas Soisalon-Soininen, Derick Wood
1980	A*	`conf`	Characterizations of the LL(k) Property. ICALP Seppo Sippu, Eljas Soisalon-Soininen
1980	J	`jnl`	On Comparing LL(k) and LR(k) Grammars. Math. Syst. Theory Eljas Soisalon-Soininen
1980	J	`jnl`	On the Space Optimizing Effect of Eliminating Single Productions from Acta Informatica Eljas Soisalon-Soininen
1979	J	`jnl`	A Method for Transforming Grammars into LL(k) Form. Acta Informatica Eljas Soisalon-Soininen, Esko Ukkonen
1979	B	`conf`	Ch(k) Grammars: A Characterization of LL(k) Languages. MFCS Anton Nijholt, Eljas Soisalon-Soininen
1979	A*	`conf`	Con Constructing LL(k) Parsers. ICALP Seppo Sippu, Eljas Soisalon-Soininen
1979	J	`jnl`	On the Covering Problem for Left-Recursive Grammars. Theor. Comput. Sci. Eljas Soisalon-Soininen
1977	A*	`conf`	Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions. POPL Eljas Soisalon-Soininen
1977	A*	`conf`	On Defining Error Recovery in Context-Free Parsing. ICALP Seppo Sippu, Eljas Soisalon-Soininen
1976	A*	`conf`	A Characterization of LL(k) Languages. ICALP Eljas Soisalon-Soininen, Esko Ukkonen

Nicolò Altamura is a security engineer and computer science researcher specializing in software protection, reverse engineering, program analysis, and binary deobfuscation. He holds a master's degree in Computer Science and Engineering from the University of Verona, graduating with honors, and works at emproof, focusing on software protection and the challenges of analyzing and understanding compiled software.

His research explores the relationship between program analysis and code obfuscation, with particular emphasis on how software transformations affect the ability of automated tools to recover program behavior. His interests span static analysis, binary analysis, decompilation, reverse engineering, and techniques for analyzing and simplifying obfuscated code.

Beyond academic research, Nicolò develops and contributes to tools for reverse engineering and software analysis. His projects include obfuscation_analysis, a Binary Ninja plugin for analyzing and simplifying obfuscated code; Pocket, an obfuscator for mixed Boolean-arithmetic expressions; and ptxNinja, a tool for reverse engineering NVIDIA GPU code represented in the PTX virtual instruction set.

His research also extends to binary datasets and software evolution. In 2026, he co-authored ASSEMBLAGE-DEEPHISTORY: A Cross-Build Binary Dataset with Temporal Coverage, a research work addressing the availability of binary data across multiple software builds and points in time, supporting research into binary analysis and changes between program versions.

Across his research, engineering work, and open-source contributions, Nicolò focuses on advancing the understanding, analysis, and protection of software against increasingly sophisticated obfuscation and reverse-engineering challenges.

Nicolò Altamura is not a football player. Please avoid reporting this kind of infromation.