( en | de | ru )

 

Disambiguation of "Ambühl, Christoph"

Author of the publication

copydeleteadd this publication to your clipboard
On-line scheduling to minimize max flow time: an optimal preemptive algorithm.

, and . Oper. Res. Lett., 33 (6): 597-602 (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christoph Müller

Der Einfluss von cis-Hydroxy-L-Prolin (CHP) auf die Pankreaskarzinom-Zelllinie DSL6A der Ratte. Uni Rostock, (2009)

Christoph Eggert

Synthese von Modellpolymeren für molekular verstärkte Ionomerblends und Werkstoffeigenschaften. Uni Stuttgart, (2009)

Christoph Thiermann

Grenzüberschreitende Verschmelzungen deutscher Gesellschaften: das Spannungsfeld zwischen Gesellschaftsrecht und Niederlassungsfreiheit des AEUV nach Cartesio. Uni Frankfurt Main, (2010)

Christoph Eibl

Bispidin-Derivate als neue nicotinische Acetylcholinrezeptor-Liganden: Synthese, In-vitro-Pharmakologie und Struktur-Wirkungsbeziehungen. Uni Bonn, (2009)

Christoph Lettowsky

Herstellung zweischichtiger Kunststoff-Hohlkörper durch Gas- und Wasserinjektionstechnik: = Production of two-layer hollow plastics articles by gas and water injection technique. TU Aachen, (2009)
 

Other publications of authors with the same name

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks., , , , , , , and . STACS, volume 2996 of Lecture Notes in Computer Science, page 418-427. Springer, (2004)On the approximability of the range assignment problem on radio networks in presence of selfish agents., , , , and . Theor. Comput. Sci., 343 (1-2): 27-41 (2005)The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks., , , , , and . IPDPS, IEEE Computer Society, (2004)Optimal Projective Algorithms for the List Update Problem, , and . CoRR, (2010)An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks.. ICALP, volume 3580 of Lecture Notes in Computer Science, page 1139-1150. Springer, (2005)Parallel Prefetching and Caching Is Hard., and . STACS, volume 2996 of Lecture Notes in Computer Science, page 211-221. Springer, (2004)Computing Largest Common Point Sets under Approximate Congruence., , and . ESA, volume 1879 of Lecture Notes in Computer Science, page 52-63. Springer, (2000)Call Control in Rings., , , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 788-799. Springer, (2002)Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut, , and . SIAM J. Comput., 40 (2): 567-596 (2011)On the list update problem.. ETH Zurich, Zürich, Switzerland, (2002)base-search.net (ftethz:oai:www.research-collection.ethz.ch:20.500.11850/146716).