Laube U, E. Nebel M. Maximum Likelihood Analysis of Heapsort. In: Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009. Society for Industrial and Applied Mathematics; 2009: 41--50
AbstractIn this paper we present a new view of a classical data structure, the heap. We view a heap ...
Given a snapshot of a running program�s memory heap, and a set of types representing data in the pr...
Effective static analysis of heap manipulating programs is required to track precise information abo...
Laube U, Nebel M. Maximum likelihood analysis of algorithms and data structures. Theor. Comput. Sci....
AbstractA new heapsort algorithm is given in this paper. Its practical value is that the efficiency ...
AbstractWe present a new approach for an average-case analysis of algorithms and data structures tha...
Although discovered some 30 years ago, the Heapsort algorithm is still not completely understood. He...
This paper shows how heaping of duration data, e.g. caused by rounding due to memory effects, can be...
This paper shows how heaping of duration data eg caused by rounding due to memory eects can be analy...
Laube U, Nebel M. Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs. Algori...
A statistical approach to algorithmic analysis of high-dimensional nearest-neighbor searc
The object of the diploma thesis is detailed description of doublended priority queues. Heap data st...
Abstract-m this paper, lower and upper bounds for min-max pair heap construction has been presented....
AbstractBOTTOM-UP HEAPSORT is a variant of HEAPSORT which beats on average even the clever variants ...
This paper describes a general approach for optimized live heap space and live heap space-bound anal...
AbstractIn this paper we present a new view of a classical data structure, the heap. We view a heap ...
Given a snapshot of a running program�s memory heap, and a set of types representing data in the pr...
Effective static analysis of heap manipulating programs is required to track precise information abo...
Laube U, Nebel M. Maximum likelihood analysis of algorithms and data structures. Theor. Comput. Sci....
AbstractA new heapsort algorithm is given in this paper. Its practical value is that the efficiency ...
AbstractWe present a new approach for an average-case analysis of algorithms and data structures tha...
Although discovered some 30 years ago, the Heapsort algorithm is still not completely understood. He...
This paper shows how heaping of duration data, e.g. caused by rounding due to memory effects, can be...
This paper shows how heaping of duration data eg caused by rounding due to memory eects can be analy...
Laube U, Nebel M. Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs. Algori...
A statistical approach to algorithmic analysis of high-dimensional nearest-neighbor searc
The object of the diploma thesis is detailed description of doublended priority queues. Heap data st...
Abstract-m this paper, lower and upper bounds for min-max pair heap construction has been presented....
AbstractBOTTOM-UP HEAPSORT is a variant of HEAPSORT which beats on average even the clever variants ...
This paper describes a general approach for optimized live heap space and live heap space-bound anal...
AbstractIn this paper we present a new view of a classical data structure, the heap. We view a heap ...
Given a snapshot of a running program�s memory heap, and a set of types representing data in the pr...
Effective static analysis of heap manipulating programs is required to track precise information abo...
DOI
Add to ORKG