Report (716)

11221.
Report
Dietzfelbinger, M.; Tamaki, H.: On the probability of rendezvous in graphs. Max-Planck-Institut für Informatik, Saarbrücken (2003), 30 pp.
11222.
Report
Dietzfelbinger, M.; Woelfel, P.: Almost random graphs with simple hash functions. Max-Planck-Institut für Informatik, Saarbrücken (2003), 23 pp.
11223.
Report
Eisenbrand, F.: Fast Integer Programming in Fixed Dimension. Max-Planck-Institut für Informatik, Saarbrücken (2003), 14 pp.
11224.
Report
Fogel, E.; Halperin, D.; Wein, R.; Teillaud, M.; Berberich, E.; Eigenwillig, A.; Hert, S.; Kettner, L.: Specification of the Traits Classes for CGAL Arrangements of Curves. INRIA, Sophia-Antipolis (2003)
11225.
Report
Hangelbroek, T.; Nürnberger, G.; Rössl, C.; Seidel, H.-P.; Zeilfelder, F.: The dimension of $C^1$ splines of arbitrary degree on a tetrahedral partition. Max-Planck-Institut für Informatik, Saarbrücken (2003), 39 pp.
11226.
Report
Jaeger, M.: A representation theorem and applications to measure selection and noninformative priors. Max-Planck-Institut für Informatik, Saarbrücken (2003), 35 pp.
11227.
Report
Katriel, I.; Thiel, S.: Fast bound consistency for the global cardinality constraint. Max-Planck-Institut für Informatik, Saarbrücken (2003), 30 pp.
11228.
Report
Kazakov, Y.; de Nivelle, H.: Subsumption of concepts in $DL$ ${\cal FL}_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. Max-Planck-Institut für Informatik, Saarbrücken (2003), 12 pp.
11229.
Report
Kovács, A.: Sum-Multicoloring on paths. Max-Planck-Institut für Informatik, Saarbrücken (2003), 20 pp.
11230.
Report
Krysta, P.; Czumaj, A.; Vöcking, B.: Selfish traffic allocation for server farms. Max-Planck-Institut für Informatik, Saarbrücken (2003), 43 pp.
11231.
Report
Krysta, P.; Sanders, P.; Vöcking, B.: Scheduling and traffic allocation for tasks with bounded splittability. Max-Planck-Institut für Informatik, Saarbrücken (2003), 15 pp.
11232.
Report
Maier, P.: Compositional circular assume-guarantee rules cannot be sound and complete. Max-Planck-Institut für Informatik, Saarbrücken (2003), 22 pp.
11233.
Report
Podelski, A.; Rybalchenko, A.: Software model checking of liveness properties via transition invariants. Max-Planck-Institut für Informatik, Saarbrücken (2003), 29 pp.
11234.
Report
Rössl, C.; Zeilfelder, F.; Nürnberger, G.; Seidel, H.-P.: Visualization of volume data with quadratic super splines. Max-Planck-Institut für Informatik, Saarbrücken (2003), 15 pp.
11235.
Report
Sanders, P.: Polynomial time algorithms for network information flow. Max-Planck-Institut für Informatik, Saarbrücken (2003), 18 pp.
11236.
Report
Sanders, P.; Dementiev, R.: Asynchronous parallel disk sorting. Max-Planck-Institut für Informatik, Saarbrücken (2003), 22 pp.
11237.
Report
Schäfer, G.: A note on the smoothed complexity of the single-source shortest path problem. Max-Planck-Institut für Informatik, Saarbrücken (2003), 8 pp.
11238.
Report
Schäfer, G.; Becchetti, L.; Leonardi, S.; Marchetti-Spaccamela, A.; Vredeveld, T.: Average case and smoothed competitive analysis of the multi-level feedback algorithm. Max-Planck-Institut für Informatik, Saarbrücken (2003), 31 pp.
11239.
Report
Schäfer, G.; Leonardi, S.: Cross-monotonic cost sharing methods for connected facility location games. Max-Planck-Institut für Informatik, Saarbrücken (2003), 10 pp.
11240.
Report
Schäfer, G.; Sivadasan, N.: Topology matters: smoothed competitive analysis of metrical task systems. Max-Planck-Institut für Informatik, Saarbrücken (2003), 28 pp.
Go to Editor View