Randomized computations on large data sets: tight lower bounds
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the suitability of programming tasks for automated evaluation
Informatics in education
Monte Carlo methods and super-recursive algorithms
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Indistinguishability and first-order logic
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Synthesis of an approximate feedback nonlinear control based on optimization methods
WSEAS Transactions on Systems and Control
Using randomization to cope with circuit uncertainty
Proceedings of the Conference on Design, Automation and Test in Europe
Information complexity of online problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Advice complexity and barely random algorithms
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On the advice complexity of the k-server problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Advice complexity of online coloring for paths
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Infinite vs. finite size-bounded randomized computations
Journal of Computer and System Sciences
| Hi-index | 0.00 |