Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Christoph
    Last name: Ambühl
    DBLP: 31/1787
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 19 to 28 of 29  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri.
    The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks.
    18th International Parallel and Distributed Processing Symposium (IPDPS 2004), CD-ROM / Abstracts Proceedings, 26-30 April 2004, Santa Fe, New Mexico, USA 2004 (0) 2004
    Conference paper
    Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri.
    Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
    STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Christoph Ambühl, Birgitta Weber.
    Parallel Prefetching and Caching Is Hard.
    STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri.
    Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
    SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, June 18-20, 2003, Umeå Sweden 2003 (0) 2003
    Conference paper
    Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri.
    Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
    Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers 2004 (0) 2003
    Conference paper
    Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach.
    Call Control in Rings.
    Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Christoph Ambühl, Uli Wagner.
    On the Clique Problem in Intersection Graphs of Ellipses.
    Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel.
    A new lower bound for the list update problem in the partial cost model.
    Theor. Comput. Sci. 2001, Volume 268 (0) 2001
    Conference paper
    Christoph Ambühl.
    Offline List Update is NP-Hard.
    Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings 2000 (0) 2000
    Conference paper
    Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner.
    Computing Largest Common Point Sets under Approximate Congruence.
    Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings 2000 (0) 2000
    Show item 19 to 28 of 29  

    Your query returned 29 matches in the database.