Ph.D and MS.c Theses, since 1988.
No.  |
Student's Name |
Graduation
Year |
Degree |
Abstracts |
ResearchName |
| 1 |
Livshits Ariel |
2022 |
MSc |
Abstracts
|
Probable Approximate Coordination |
| 2 |
Zamir Nitzan |
2019 |
MSc |
Abstracts
|
Belief Requirements in Probabilistic Systems |
| 3 |
Dan Asa |
2018 |
MSc |
Abstracts
|
Using Time Without Clocks |
| 4 |
Saat Efi |
2017 |
MSc |
Abstracts
|
The Impact of Using Time in Software Defined Networks |
| 5 |
Mizrahi Tal |
2016 |
PhD |
Abstracts
|
Using Time in Software Defined Networks |
| 6 |
Patkin Katia |
2015 |
MSc |
Abstracts
|
A Priority-Based Analysis of Mutual Exclusion |
| 7 |
Emmer Moshe |
2013 |
MSc |
Abstracts
|
Bounded Model Checking at Word Level via Encoding into Effectively Propositional Logic |
| 8 |
Ben-Zvi Ido |
2011 |
PhD |
Abstracts
|
Causality, Knowledge and Coordination in Distributed Systems |
| 9 |
Televitckiy Evgeny |
2009 |
MSc |
Abstracts
|
Rank Aggregation for Synthesis of Recommendation Lists |
| 10 |
Guralnik Elena |
2009 |
MSc |
Abstracts
|
Safe Composition of Distributed Programs |
| 11 |
Mizrahi Tal |
2006 |
MSc |
Abstracts
|
Maintaining Simultaneously Consistent Views of a Distributed System using Common Knowledge |
| 12 |
Trock Dan |
2004 |
MSc |
Abstracts
|
Sampling-Based Distributed Mining of Association Rules |
| 13 |
Kiper Ron |
2004 |
MSc |
Abstracts
|
Hole Analysis Coverage Using BDD'S |
| 14 |
Shimony Benny |
2004 |
MSc |
Abstracts
|
A New Correctness Proof of Gallager, Humblet and Spira's Minimum Spanning Tree Protocol |
| 15 |
Polyakov Sergey |
2003 |
MSc |
Abstracts
|
Researching the Java Memory Model |
| 16 |
Ben-Shoshan Yaron |
2003 |
MSc |
Abstracts
|
Labeling Fork-Join Task Graphs for Data Race Detection |
| 17 |
Zamsky Arkady |
1999 |
PhD |
| Approximation and Randomization in Byzantine Agreement |
Last updated on: Thursday ,March 10, 2022
|
