Showing
1 - 1
results of
1
for search '
Bernard Chazelle
'
Skip to content
VuFind
Back to Portal
Language
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文(繁體)
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Author
Bernard Chazelle
Bernard Chazelle
Bernard Chazelle
(born November 5, 1955) is a French American
computer scientist
. He is currently the
Eugene Higgins Professor
of
Computer Science
at
Princeton University
. Much of his work is in
computational geometry
, where he is known for his study of algorithms, such as
linear-time
triangulation
of a
simple polygon
, as well as major complexity results, such as
lower bound
techniques based on
discrepancy theory
. He is also known for his invention of the
soft heap
data structure and the most
asymptotically
efficient known deterministic algorithm for finding
minimum spanning tree
s.
Provided by Wikipedia
Showing
1 - 1
results of
1
for search '
Bernard Chazelle
'
, query time: 0.00s
Refine Results
Sort
Relevance
Date Descending
Date Ascending
Call Number
Author
Title
1
L'algorithmique et les sciences
by
Bernard
Chazelle
Published 2013
Call Number:
Loading…
Located:
Loading…
Get Fullteks
DOAB: description of the publication
Book Chapter
Save to List
Saved in:
Search Tools:
RSS Feed
–
Email Search