17 citations · 20 across the 6 of their papers we have counts for
6 papers
A Competitive Strategy for Distance-Aware Online Shape Allocation
Sándor P. Fekete, Nils Schweer, Jan-Marc Reinhardt
We consider the following online allocation problem: Given a unit square S, and a sequence of numbers n_i between 0 and 1, with partial sum bounded by 1; at each step i, select a r…
Maintaining Arrays of Contiguous Objects
Michael A. Bender, Sándor P. Fekete, Tom Kamphans +1
In this paper we consider methods for dynamically storing a set of different objects ("modules") in a physical array. Each module requires one free contiguous subinterval in order…
No-Break Dynamic Defragmentation of Reconfigurable Devices
Sandor Fekete, Tom Kamphans, Nils Schweer +5
We propose a new method for defragmenting the module layout of a reconfigurable device, enabled by a novel approach for dealing with communication needs between relocated modules a…
Online Square Packing
Sandor P. Fekete, Tom Kamphans, Nils Schweer
We analyze the problem of packing squares in an online fashion: Given a semi-infinite strip of width 1 and an unknown sequence of squares of side length in [0,1] that arrive from a…
Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town?
Erik D. Demaine, Sandor P. Fekete, Guenter Rote +3
An n-town, for a natural number n, is a group of n buildings, each occupying a distinct position on a 2-dimensional integer grid. If we measure the distance between two buildings a…
Maintaining Virtual Areas on FPGAs using Strip Packing with Delays
Josef Angermeier, Sandor P. Fekete, Tom Kamphans +2
Every year, the computing resources available on dynamically partially reconfigurable devices increase enormously. In the near future, we expect many applications to run on a singl…