Ralph Neininger

45 papers A* 2C 4Journal 33Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The analysis of partial match queries in random multidimensional trees: A selected survey. Comput. Sci. Rev. Amalia Duch, Hsien-Kuei Hwang, Conrado Martínez, Ralph Neininger
2024	C	`conf`	On Fluctuations of Complexity Measures for the FIND Algorithm. AofA Jasper Ischebeck, Ralph Neininger
2024	J	`jnl`	On Policy Evaluation Algorithms in Distributional Reinforcement Learning. CoRR Julian Gerstenberg, Ralph Neininger, Denis Spiegel
2024	C	`conf`	Patricia's Bad Distributions. AofA Louigi Addario-Berry, Pat Morin, Ralph Neininger
2022	J	`jnl`	On solutions of the distributional Bellman equation. CoRR Julian Gerstenberg, Ralph Neininger, Denis Spiegel
2022	C	`conf`	On the Contraction Method with Reduced Independence Assumptions. AofA Ralph Neininger, Jasmin Straub
2021	J	`jnl`	A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees. Discret. Appl. Math. Michael Fuchs, Cecilia Holmgren, Dieter Mitsche, Ralph Neininger
2021	J	`jnl`	Node profiles of symmetric digital search trees: Concentration properties. Random Struct. Algorithms Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
2020	C	`conf`	Convergence Rates in the Probabilistic Analysis of Algorithms. AofA Ralph Neininger, Jasmin Straub
2019	J	`jnl`	Preface. Comb. Probab. Comput. Hsien-Kuei Hwang, Ralph Neininger, Marek Zaionc
2018	—	`conf`	Probabilistic Analysis of the Dual-Pivot Quicksort "Count". ANALCO Ralph Neininger, Jasmin Straub
2017	J	`jnl`	Dependence and phase changes in random Random Struct. Algorithms Hua-Huai Chern, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
2017	—	`conf`	External Profile of Symmetric Digital Search Trees (Extended Abstract). ANALCO Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
2017	J	`jnl`	Probabilistic Analysis of the Dual-Pivot Quicksort "Count". CoRR Ralph Neininger, Jasmin Straub
2017	—	`conf`	Rates of convergence for balanced irreducible two-color Pólya urns. ANALCO Andrea Kuntschik, Ralph Neininger
2016	J	`jnl`	Process convergence for the complexity of Radix Selection on Markov sources. CoRR Kevin Leckey, Ralph Neininger, Henning Sulzbach
2016	—	`conf`	The CLT Analogue for Cyclic Urns. ANALCO Noela S. Müller, Ralph Neininger
2015	J	`jnl`	A Limit Theorem for Radix Sort and Tries with Markovian Input. CoRR Kevin Leckey, Ralph Neininger, Wojciech Szpankowski
2015	J	`jnl`	Average Case and Distributional Analysis of Dual-Pivot Quicksort. ACM Trans. Algorithms Sebastian Wild, Markus E. Nebel, Ralph Neininger
2015	J	`jnl`	Refined quicksort asymptotics. Random Struct. Algorithms Ralph Neininger
2015	J	`jnl`	The CLT Analogue for Cyclic Urns. CoRR Noela S. Müller, Ralph Neininger
2014	—	`conf`	A statistical view on exchanges in Quickselect. ANALCO Benjamin Dadoun, Ralph Neininger
2014	J	`jnl`	Pólya Urns Via the Contraction Method. Comb. Probab. Comput. Margarete Knape, Ralph Neininger
2013	J	`jnl`	A statistical view on exchanges in Quickselect. CoRR Benjamin Dadoun, Ralph Neininger
2013	J	`jnl`	Asymptotic Analysis of Hoppe Trees. J. Appl. Probab. Kevin Leckey, Ralph Neininger
2013	J	`jnl`	Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort CoRR Sebastian Wild, Markus E. Nebel, Ralph Neininger
2013	A*	`conf`	Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model. SODA Ralph Neininger, Kevin Leckey, Wojciech Szpankowski
2012	J	`jnl`	A limit process for partial match queries in random quadtrees CoRR Nicolas Broutin, Ralph Neininger, Henning Sulzbach
2012	J	`jnl`	A refined Quicksort asymptotic CoRR Ralph Neininger
2012	J	`jnl`	Asymptotic analysis of Hoppe trees CoRR Kevin Leckey, Ralph Neininger
2012	J	`jnl`	On a functional contraction method CoRR Ralph Neininger, Henning Sulzbach
2012	A*	`conf`	Partial match queries in random quadtrees. SODA Nicolas Broutin, Ralph Neininger, Henning Sulzbach
2012	J	`jnl`	Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model CoRR Kevin Leckey, Ralph Neininger, Wojciech Szpankowski
2011	J	`jnl`	Partial match queries in random quadtrees CoRR Nicolas Broutin, Ralph Neininger, Henning Sulzbach
2006	J	`jnl`	Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees. Algorithmica Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
2004	J	`jnl`	Distances and Finger Search in Random Binary Search Trees. SIAM J. Comput. Luc Devroye, Ralph Neininger
2003	J	`jnl`	Random suffix search trees. Random Struct. Algorithms Luc Devroye, Ralph Neininger
2002	J	`jnl`	Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions. SIAM J. Comput. Hsien-Kuei Hwang, Ralph Neininger
2002	J	`jnl`	Rates of convergence for Quicksort. J. Algorithms Ralph Neininger, Ludger Rüschendorf
2002	J	`jnl`	The Wiener Index Of Random Trees. Comb. Probab. Comput. Ralph Neininger
2001	J	`jnl`	On a multivariate contraction method for random recursive structures with applications to Quicksort. Random Struct. Algorithms Ralph Neininger
2000	J	`jnl`	Asymptotic distributions for partial match queries in K-d trees. Random Struct. Algorithms Ralph Neininger
2000	J	`jnl`	Perfect simulation from the Quicksort limit distribution CoRR Luc Devroye, James Allen Fill, Ralph Neininger
1999	—	`—`	Limit laws for random recursive structures and algorithms. Ralph Neininger
1999	J	`jnl`	On the internal path length of d-dimensional quad trees. Random Struct. Algorithms Ralph Neininger, Ludger Rüschendorf

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.