1
Rajeev Motwani
(Professor and Director of Graduate Studies, Stanford University)
|
|||||
|
|
|
||||
| Expertise: Communication Complexity / Lower Bounds; XML Data; Approximation Algorithms / Perfect Graphs; Convex Polygons / Planar Arrangements; | |||||
2
Micha Sharir
(Professor, Tel Aviv University)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; | |||||
3
Prabhakar Raghavan
( Consulting Professor of Computer Science, Yahoo)
|
|||||
|
|
||||
| Expertise: Communication Complexity / Lower Bounds; Convex Polygons / Planar Arrangements; XML Data; Approximation Algorithms / Perfect Graphs; Web Mining; | |||||
4
Kurt Mehlhorn
(Department 1: Algorithms and Complexity)
|
|||||
|
|
|
||||
| Expertise: Approximation Algorithms / Perfect Graphs; Convex Polygons / Planar Arrangements; Communication Complexity / Lower Bounds; Parallel Algorithm / Optimal Edge Search; Automata Theory / Slender Languages; | |||||
5
Michael T. Goodrich
(Director, Department of Computer Science
University of California
)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Approximation Algorithms / Perfect Graphs; Communication Complexity / Lower Bounds; Security Views / New Denial; | |||||
6
Jean-Claude Latombe
(Professor, School of Engineering
Computer Science Department
Stanford University)
|
|||||
|
|
|
||||
| Expertise: Mobile Robot / Hybrid Control; Data Compression / Arithmetic Coding; Learning Search Control Rules / Explanation-based Approach; Rough Set; Convex Polygons / Planar Arrangements; | |||||
7
Ming C. Lin
(Professor)
|
|||||
|
|
|
||||
| Expertise: Interactive Visualization / Computer graphics; Virtual Environments; Convex Polygons / Planar Arrangements; Mobile Robot / Hybrid Control; | |||||
8
Joseph S. B. Mitchell
(Professor , State University of New York at Stony Brook )
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Approximation Algorithms / Perfect Graphs; Interactive Visualization / Computer graphics; Communication Complexity / Lower Bounds; | |||||
10
Nathan Linial
(Professor , School of Computer Science and Engineering
The Hebrew University of Jerusalem )
|
|||||
|
|
|
||||
| Expertise: Communication Complexity / Lower Bounds; Random graph / Independence number; Finite Sets / New Designs; Convex Polygons / Planar Arrangements; DNA sequence / ENZYME database; Data Compression / Arithmetic Coding; | |||||
11
Baruch Schieber
( manager , Theory of Computation group
IBM T.J. Watson Research Center )
|
|||||
|
|
|
||||
| Expertise: Approximation Algorithms / Perfect Graphs; Communication Complexity / Lower Bounds; Dynamic Networks / Extended Abstract; Convex Polygons / Planar Arrangements; Parallel Algorithms / Wormhole Networks; | |||||
12
Amit Sahai
(Associate Professor of Computer Science , Center for Information and Computation Security )
|
|||||
|
|
|
||||
| Expertise: Signature Schemes / Authenticated Key Exchange Secure; Communication Complexity / Lower Bounds; Convex Polygons / Planar Arrangements; | |||||
13
Gary L. Miller
(Professor, School of Computer Science
Carnegie Mellon University)
|
|||||
|
|
||||
| Expertise: Communication Complexity / Lower Bounds; Convex Polygons / Planar Arrangements; Approximation Algorithms / Perfect Graphs; | |||||
14
Jiri Matousek
(Department of Applied Mathematics
)
|
|||||
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Random graph / Independence number; Communication Complexity / Lower Bounds; | |||||
15
Haim Kaplan
(School of Computer Science
Tel Aviv University )
|
|||||
|
|
|
||||
| Expertise: Approximation Algorithms / Perfect Graphs; Communication Complexity / Lower Bounds; Convex Polygons / Planar Arrangements; Wireless network / End-to-end Routing Behavior; Data Compression / Arithmetic Coding; | |||||
16
Emo Welzl
(Professor, Department of Computer Science
Institute of Theoretical Computer Science)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Automata Theory / Slender Languages; Approximation Algorithms / Perfect Graphs; | |||||
17
Tamal K. Dey
(Professor , Department of Computer Science and Engineering
The Ohio State University
)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; | |||||
18
Sariel Har-Peled
(Nonvisiting Nonassistant Associate Professor, Computer Science
UIUC
)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Machine Learning; | |||||
19
Joseph F. O'Rourke
(Olin Professor and Chair of Computer Science, Mathematics
Smith College)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; | |||||
20
Raimund Seidel
(Chair of Theoretical Computer Science ,
Theoretical Computer Science )
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; | |||||
21
Sandor P. Fekete
(Institut f??r Mathematische Optimierung
Fachbereich Mathematik
Technische Universit?t Braunschweig
)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Approximation Algorithms / Perfect Graphs; Sensor Networks / Outdoor wireless; Reconfigurable Hardware; | |||||
22
Sajal K. Das
(Professor, University Texas at Arlington
)
|
|||||
|
|
|
||||
| Expertise: Wireless Networks / Priority Scheduling; Convex Polygons / Planar Arrangements; Approximation Algorithms / Perfect Graphs; | |||||
23
Sampath Kannan
(Professor, Department of Computer and Information Science
University of Pennsylvania)
|
|||||
|
|
|
||||
| Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs; Data Compression / Arithmetic Coding; Model Checking / Hybrid Systems; Convex Polygons / Planar Arrangements; | |||||
24
Alon Itai
(chair , Computer Science)
|
|||||
|
|
|
||||
| Expertise: Dynamic Networks / Extended Abstract; Communication Complexity / Lower Bounds; Parallel Algorithm / Optimal Edge Search; Approximation Algorithms / Perfect Graphs; Natural Language System / Statistical Machine Translation; Convex Polygons / Planar Arrangements; | |||||
25
Gautam Das
(Associate Professor
Head, Computer Science and Engineering Department
University of Texas at Arlington
)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; XML Data; Data mining; Approximation Algorithms / Perfect Graphs; | |||||
26
Janos Pach
(Professor, Computer Science,Electrical Engineering)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Random graph / Independence number; Finite Sets / New Designs; Communication Complexity / Lower Bounds; | |||||
27
Mario Szegedy
(Professor , Department of Computer Science
State University of NJ
)
|
|||||
|
|
||||
| Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs; Convex Polygons / Planar Arrangements; | |||||
28
Mathieu Desbrun
(Associate Professor , Computer Science and Computational Science & Engineering)
|
|||||
|
|
|
||||
| Expertise: Interactive Visualization / Computer graphics; Surface interpolation / Geometric modeling; Convex Polygons / Planar Arrangements; Mobile Robot / Hybrid Control; | |||||
29
Jarek Rossignac
(Professor , Interactive and Intelligent Division
College of Computing
Georgia Tech)
|
|||||
|
|
|
||||
| Expertise: Interactive Visualization / Computer graphics; Surface interpolation / Geometric modeling; Convex Polygons / Planar Arrangements; Wavelet image coding / Video compression; | |||||
30
D. T. Lee
(Institute of Information Science
Academia Sinica)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Approximation Algorithms / Perfect Graphs; Power optimization / Synchronous Sequential Circuits; | |||||
31
Peter Eades
(Chair of Software Technology, School of Information Technologies
University of Sydney
)
|
|||||
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Information Visualization / Turning Data; Approximation Algorithms / Perfect Graphs; | |||||
32
Ralf Hartmut Guting
(full professor , Computer Science
University of Hagen)
|
|||||
|
|
|
||||
| Expertise: XML Data; Spatial data; Parallel Algorithm / Optimal Edge Search; Convex Polygons / Planar Arrangements; Database Systems; | |||||
33
Kenneth L. Clarkson
(member, Mathematical and Algorithmic Sciences Research Center)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Communication Complexity / Lower Bounds; Intelligent Systems / Knowledge Management; | |||||
34
Dan Halperin
(School of Computer Science
Tel Aviv University )
|
|||||
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Surface interpolation / Geometric modeling; | |||||
35
Dorothea Wagner
(Member)
|
|||||
|
|
|
||||
| Expertise: Approximation Algorithms / Perfect Graphs; Convex Polygons / Planar Arrangements; | |||||
36
Mohammad Taghi Hajiaghayi
(Senior Researcher , Algorithms and Theoretical Computer Science group
AT&T Labs - Research)
|
|||||
|
|
|
||||
| Expertise: Approximation Algorithms / Perfect Graphs; Communication Complexity / Lower Bounds; Convex Polygons / Planar Arrangements; Random graph / Independence number; | |||||
37
Evangelos Kranakis
( Professor , Carleton University)
|
|||||
|
|
|
||||
| Expertise: Dynamic Networks / Extended Abstract; Approximation Algorithms / Perfect Graphs; Convex Polygons / Planar Arrangements; Security Views / New Denial; | |||||
38
Gabriel Robins
(Professor, Department of Computer Science
School of Engineering and Applied Science
University of Virginia
)
|
|||||
|
|
|
||||
| Expertise: Power optimization / Synchronous Sequential Circuits; Adaptive Mobile Applications / Pervasive Computing Systems; Convex Polygons / Planar Arrangements; | |||||
39
Steven M. LaValle
(Associate Professor, Department of Computer Science
University of Illinois)
|
|||||
|
|
|
||||
| Expertise: Mobile Robot / Hybrid Control; Convex Polygons / Planar Arrangements; | |||||
41
Andrzej Lingas
(Professor of Computer Science, Computer Science
Lund University)
|
|||||
|
|
|
||||
| Expertise: Approximation Algorithms / Perfect Graphs; Convex Polygons / Planar Arrangements; Communication Complexity / Lower Bounds; | |||||
42
Nina Amenta
(professor , Computer Science
University of California)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Interactive Visualization / Computer graphics; Expression data / Microarray experiment; | |||||
43
Michael Garland
(adjunct professor, Department of Computer Science
University of Illinois)
|
|||||
|
|
|
||||
| Expertise: Interactive Visualization / Computer graphics; Convex Polygons / Planar Arrangements; | |||||
44
Alok Aggarwal |
|||||
|
|
||||
| Expertise: Communication Complexity / Lower Bounds; Convex Polygons / Planar Arrangements; Approximation Algorithms / Perfect Graphs; | |||||
45
Ravi Janardan
( Professor, Dept. of Computer Science & Engineering
University of Minnesota)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Data mining; Surface interpolation / Geometric modeling; Communication Complexity / Lower Bounds; | |||||
46
Petra Mutzel |
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Combinatorial optimization problem / Linear Programming; Data Compression / Arithmetic Coding; | |||||
47
Ilan Newman
(professor , CS dept. of Haifa University)
|
|||||
|
|
|
||||
| Expertise: Communication Complexity / Lower Bounds; Convex Polygons / Planar Arrangements; Approximation Algorithms / Perfect Graphs; | |||||
48
James F. O'Brien
(professor, EECS
Computer Science Division
633 Soda Hall
Mail Code 1776
University of California at Berkeley
Berkeley
California 94720-1776)
|
|||||
|
|
|
||||
| Expertise: Interactive Visualization / Computer graphics; Object Recognition / Two-View Motion Estimation; Convex Polygons / Planar Arrangements; | |||||
49
Klara Kedem
(Member , Computer Science Department
Ben-Gurion University
)
|
|||||
|
|
|
||||
| Expertise: Convex Polygons / Planar Arrangements; Data Compression / Arithmetic Coding; Character Recognition; | |||||
50
Robert Sedgewick
(Professor, Department of Computer Science
Princeton University)
|
|||||
|
|
||||
| Expertise: Communication Complexity / Lower Bounds; Approximation Algorithms / Perfect Graphs; Computer / Systems; Convex Polygons / Planar Arrangements; | |||||
Copyright (c) 2006-2009 KEG, Tsinghua. All Rights Reserved. | 京ICP备09068414号