Michel Habib – författare
Visar alla böcker från författaren Michel Habib. Handla med fri frakt och snabb leverans.
9 produkter
STACS 2003
20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings
Häftad, 2003
1128 kr
Lägg i varukorg
The Symposium on Theoretical Aspects of Computer Science (STACS) is - ternately held in France and Germany. The latest conference, February 27 to March 1, 2003 at the Institute of Computer Science, Freie Universit. at Berlin is the twentieth in this series. The previous meetings took place in Paris …
STACS 2004
21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings
Av Volker Diekert, Michel Habib
Häftad, 2004
1128 kr
Lägg i varukorg
The Symposium on Theoretical Aspects of Computer Science (STACS) is alt- nately held in France and in Germany. The conference of March 25-27, 2004 at the Corum, Montpellier was the twenty-?rst in this series. Previous meetings took place in Paris (1984), Saarbruc .. ken (1985), Orsay (1986), Passau …
STACS 2004
21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings
Av Michel Habib, Volker Diekert
E-bok, 2004
1502 kr
Lägg i varukorg
STACS 2003
20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings
E-bok, 2003
1459 kr
Lägg i varukorg
Probabilistic Methods for Algorithmic Discrete Mathematics
Av Michel Habib, Colin McDiarmid m. fl.
Inbunden, 1998
1095 kr
Lägg i varukorg
Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random …
Probabilistic Methods for Algorithmic Discrete Mathematics
Av Michel Habib, Colin McDiarmid m. fl.
Häftad, 2010
1095 kr
Lägg i varukorg
Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random …
Graph-Theoretic Concepts in Computer Science
35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers
Av Christophe Paul, Michel Habib
Häftad, 2010
551 kr
Lägg i varukorg
The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24–26 2009. About 80 computer scientists from all over the world (Australia, Belgium, Canada, China, Czech Republic, France, Germany, Greece, Israel, Japan, Korea, The …
Graph-Theoretic Concepts in Computer Science
35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers
Av Michel Habib, Christophe Paul
E-bok, 2009
718 kr
Lägg i varukorg
The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24–26 2009. About 80 computer scientists from all over the world (Australia, Belgium, Canada, China, Czech Republic, France, Germany, Greece, Israel, Japan, Korea, The …
Probabilistic Methods for Algorithmic Discrete Mathematics
Av Bruce Reed, Jorge Ramirez-Alfonsin m. fl.
E-bok, 2013
1459 kr
Lägg i varukorg
Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be further from the truth. Introducing random …
