Zvi Lotker (Hebrew: צבי לוטקר) is an Israeli computer scientist and communications systems engineer who works in the fields of digital humanities, artificial intelligence, distributed computing, network algorithms, and communication networks. He is an associate professor in the Alexander Kofkin Faculty of Engineering at Bar-Ilan University.[1][2]
In 2018, Lotker was awarded the SIROCCO Prize for Innovation in Distributed Computing for his contributions to network algorithms, but especially for his contributions to the field of social networks.[3]
Lotker is the author of the book Analyzing Narratives in Social Networks (Springer, 2021).[4]
He is the son of the Israeli painter Oded Lotker.[5]
YouTube Encyclopedic
-
1/1Views:5 231
-
Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks
Transcription
Education
Lotker obtained his Ph.D. from Tel Aviv University in 2003, writing his thesis "Algorithms in Networks"[6] under the supervision of Boaz Patt-Shamir.[7]
Research
After receiving his doctorate, Lotker worked as a postdoctoral researcher at INRIA in Sophia Antipolis Mascot, France.[8][9] During this time he also worked in the same capacity at the Max-Planck-Institut für Informatik in Germany.[10] From 2004 to 2006, Lotker worked as a postdoctoral researcher at the Centrum voor Wiskunde en Informatica research group in the Netherlands.[11] He joined the Ben-Gurion University of the Negev in Israel as a lecturer in 2006 before becoming an associate professor in 2012.[12][13] In 2014, Lotker took a sabbatical and worked as a visiting professor in the Paris Diderot University in France.[14]
Selected publications
- Lotker, Z. (2021). Analyzing Narratives in Social Networks: Taking Turing to the Arts. Springer Nature.[4]
- Avin, C., Keller, B., Lotker, Z., Mathieu, C., Peleg, D., & Pignolet, Y. A. (2015, January). Homophily and the glass ceiling effect in social networks. In Proceedings of the 2015 conference on innovations in theoretical computer science (pp. 41–50).
- Alon, N., Avin, C., Koucký, M., Kozma, G., Lotker, Z., & Tuttle, M. R. (2011). Many random walks are faster than one. Combinatorics, Probability and Computing, 20(4), 481–502.[12]
- Avin, C., Koucký, M., & Lotker, Z. (2008, July). How to explore a fast-changing world (cover time of a simple random walk on evolving graphs). In International Colloquium on Automata, Languages, and Programming (pp. 121–132). Springer, Berlin, Heidelberg.
- Lotker, Z., Patt-Shamir, B., Pavlov, E., & Peleg, D. (2005). Minimum-weight spanning tree construction in O (log log n) communication rounds. SIAM Journal on Computing, 35(1), 120–131.
- Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., & Sviridenko, M. (2004). Buffer overflow management in QoS switches. SIAM Journal on Computing, 33(3), 563–583.
References
- ^ "Prof. Zvi Lotker". The Bar-Ilan University (BIU) Research Authority. Retrieved 2021-10-29.
- ^ "Exploring Social Networks, Communication Systems, Clustering and More with the Wolfram Language in These New Books—Wolfram Blog". blog.wolfram.com. Retrieved 2021-10-29.
- ^ "Sirocco 2018 - SIROCCO Prize". sites.google.com. Retrieved 2021-10-29.
- ^ a b Lotker, Zvi (2021). Analyzing Narratives in Social Networks. doi:10.1007/978-3-030-68299-6. ISBN 978-3-030-68298-9. S2CID 243229769.
- ^ "danapolymorphism - Oded_Lotker". sites.google.com. Retrieved 2021-12-20.
- ^ Lotker, Zvi (2003). ALGORITHMS IN NETWORKS (PDF). Tel Aviv: TEL-AVIV UNIVERSITY.
- ^ "Zvi Lotker - The Mathematics Genealogy Project". www.mathgenealogy.org. Retrieved 2021-10-29.
- ^ "ReaSoN". hypatia.cs.ualberta.ca. Retrieved 2021-12-27.
- ^ Klasing, Ralf; Lotker, Zvi; Navarra, Alfredo; Perennes, Stephane (2005), "From Balls and Bins to Points and Vertices", Algorithms and Computation, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 757–766, doi:10.1007/11602613_76, ISBN 978-3-540-30935-2, retrieved 2021-12-27
- ^ Elbassioni, Khaled; Lotker, Zvi; Seidel, Raimund (2006). "Upper bound on the number of vertices of polyhedra with -constraint matrices". Information Processing Letters. 100 (2): 69–71. arXiv:cs/0507038. doi:10.1016/j.ipl.2006.05.011. ISSN 0020-0190. S2CID 290901.
- ^ Fraigniaud, Pierre; Lebhar, Emmanuelle; Lotker, Zvi (2006), "A Doubling Dimension Threshold Θ(loglogn) for Augmented Graph Navigability", Algorithms – ESA 2006, Lecture Notes in Computer Science, vol. 4168, Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 376–386, doi:10.1007/11841036_35, ISBN 978-3-540-38875-3, S2CID 19650448, retrieved 2021-12-27
- ^ a b ALON, NOGA; AVIN, CHEN; KOUCKÝ, MICHAL; KOZMA, GADY; LOTKER, ZVI; TUTTLE, MARK R. (2011-04-07). "Many Random Walks Are Faster Than One". Combinatorics, Probability and Computing. 20 (4): 481–502. doi:10.1017/s0963548311000125. ISSN 0963-5483. S2CID 123641249.
- ^ "Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks". www.kdd.org. Retrieved 2021-12-27.
- ^ ""Zvi Lotker"". archives.liafa.univ-paris-diderot.fr. Retrieved 2021-12-27.
External links
- Home page
- Zvi Lotker publications indexed by Google Scholar
| International | |
|---|---|
| National | |
| Academics | |
This page was last edited on 11 June 2024, at 17:17