125
click to vote
ISAAC
15 years 6 months ago
2003 Springer 
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
ISAAC
15 years 6 months ago
2003 Springer 
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
109
click to vote
ISAAC
15 years 6 months ago
2003 Springer 
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
110
click to vote
ISAAC
15 years 6 months ago
2003 Springer 
Abstract. We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only a small increase in cost, constructing a nearly optimal binary search ...
107
click to vote
ISAAC
15 years 6 months ago
2003 Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
|
Algorithms