Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

We present a construction for the holomorph of an inverse semigroup, derived from the cartesian closed structure of the category… Expand

2011

2011

This paper offers an exercise for revisiting the main sorting algorithms after they have been taught to students. This is done in… Expand

2002

2002

The paper presents an efficient algorithm for post compression optimal rate allocation and packetization within JPEG2000 encoding… Expand

2001

2001

The measurement of force distributions in sandpiles provides a useful way to test concepts and models of the way forces propagate… Expand

Highly Cited

1996

Highly Cited

1996

The paper deals with nonlinear multicommodity flow problems with convex costs. A decomposition method is proposed to solve them… Expand

1995

1995

Part of this work has been presented in [17]. This paper analyzes the performances of portable distributed priority queues by… Expand

1993

1993

This paper presents the k-d heap, an efficient data structure that implements a multi-dimensional priority queue. The basic form… Expand

1991

1991

Abstract A probabilistic analysis is presented of certain pointer-based implementations of dictionaries, linear lists, and… Expand

1990

1990

Abstract With the concept of d-heap, a generalized heapsort algorithm is presented. The worst-case analysis of d-heapsort shows… Expand

1984

1984

It is possible to improve the worst-case behavior of operations on heaps, when counting number of comparisons between elements in… Expand