The page you are requesting does not exist. You can start your search here!
Sort by
Refine Your Search
-
. What makes a problem computationally hard or easy? How can we show that every algorithm that solves a certain problem must necessarily consume a large amount of resources (such as time or memory, say
-
Engineering, Master of Science or equivalent degree with relevance for the subject. Additional requirements: Very good oral and written ability in English, as large parts of the research work will be carried
-
Science in Engineering, Computer Science and Engineering, Data and Communication Technology, and Risk, Safety and Crisis Management. We contribute specifically with expertise in the interaction between
Searches related to big data
Enter an email to receive alerts for big-data positions