Udvidet returret til d. 31. januar 2025

Bøger af Lars Arge

Filter
Filter
Sorter efterSorter Populære
  • - 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings
    af Lars Arge
    1.116,95 kr.

    This book constitutes the refereed proceedings of the 15th Annual European Symposium on Algorithms, ESA 2007, held in Eilat, Israel, in October 2007 in the context of the combined conference ALGO 2007.The 63 revised full papers presented together with abstracts of three invited lectures address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields.

  • - 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings
    af Lars Arge
    1.131,95 kr.

    This volume features the refereed proceedings from the 34th International Colloquium on Automata, Languages and Programming, held in Wroclaw, Poland in July 2007. Seventy-six full papers are presented, together with four invited lectures. The papers are grouped into three major tracks covering algorithms, automata, complexity, and games; logic, semantics, and theory of programming; and security and cryptography foundations.

  • - 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings
    af Lars Arge
    571,95 kr.

    This book constitutes the refereed proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006, held in Riga, Latvia, in July 2006. The proceedings includes 36 revised full papers presented together with 3 invited papers, addressing issues of theoretical algorithmics and applications in various fields including graph algorithms, computational geometry, scheduling, approximation algorithms, network algorithms, data storage and manipulation, combinatorics, sorting, searching, online algorithms, optimization, amd more.

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.