When is it justified in practice to use complicated algorithms rather than simple ones?
Denis Pankratov
 Assistant Professor
 Department of Computer Science and Software Engineering
 theoretical computer science5
 algorithm design31
 analysis of algorithms3
 computational complexity theory3
 conceptually simple algorithms
 communication complexity
 graph algorithms3
 information theory4
 proof complexity
 online algorithms
 interactive information theory
 information complexity
 integer programming4
 linear programming3
 dynamic programming4
 satisfiability problem
 pattern matching
 combinatorial optimization7

Brigitte Jaumard
autonomic networking, graph theory, operations research

Vašek Chvátal
discrete mathematics, betweenness, brain functions

Claudio Contardo
large scale optimization, operations research, logistics planning

Daria Terekhov
dynamic scheduling, scheduling, inverse optimization

Lata Narayanan
networks, algorithm design, robotics

Hossein Hashemi Doulabi
healthcare optimization, stochastic optimization, integer programming

Bahareh Goodarzi
distributed/parallel systems, heterogeneous computing, irregular algorithms

Volker Haarslev
knowledge organization, artificial intelligence (AI), natural language processing

Dhrubajyoti Goswami
high performance computing, parallel architectural skeletons, distributed/parallel systems