Zvi Galil (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Zvi Galil" in English language version.

refsWebsite

Global rank English rank

13doi.org

2^nd place

13worldcat.org

5^th place

6semanticscholar.org

11^th place

8^th place

5columbia.edu

488^th place

374^th place

3siam.org

low place

6,473^rd place

3gatech.edu

4,448^th place

2,923^rd place

3acm.org

1,185^th place

840^th place

2forbes.com

54^th place

48^th place

2nytimes.com

7^th place

1mathgenealogy.org

4,501^st place

3,002^nd place

1stringology.org

low place

1uni-trier.de

7,690^th place

low place

1isiknowledge.com

low place

1books.google.com

3^rd place

1jpost.com

544^th place

387^th place

1tau.ac.il

4,464^th place

4,468^th place

1haaretz.com

497^th place

371^st place

1wsj.com

79^th place

65^th place

1insidehighered.com

4,161^st place

2,305^th place

1chronicle.com

3,169^th place

1,838^th place

1issuu.com

537^th place

476^th place

1handle.net

102^nd place

76^th place

1nae.edu

low place

7,932^nd place

1amacad.org

3,464^th place

2,377^th place

1uwaterloo.ca

3,153^rd place

2,332^nd place

1academicinfluence.com

low place

1bwog.com

low place

academicinfluence.com

Larson, Erik J.; PhD (19 March 2020). "Top Influential Computer Scientists Today". academicinfluence.com. Retrieved 2021-05-05.

acm.org

cacm.acm.org

Galil, Zvi. "OMSCS: The Revolution Will Be Digitized". cacm.acm.org. Retrieved 2020-07-27.

portal.acm.org

"Front matter". ACM SIGACT News. 19 (1). Fall 1987.

fellows.acm.org

ACM Fellow Award / Zvi Galil

amacad.org

Academy Elects 225th Class of Fellows and Foreign Honorary Members, American Association for the Advancement of Science, April 26, 2005

books.google.com

McCaughey, Robert (2014). A Lever Long Enough: A History of Columbia's School of Engineering and Applied Science since 1864. Columbia University Press. p. 240. ISBN 9780231166881.

bwog.com

"Columbia Announces 2024 Commencement Honorary Degree Recipients - Bwog". Bwog - Columbia Student News. 2024-04-10. Retrieved 2025-01-29.

chronicle.com

"What Georgia Tech's Online Degree in Computer Science Means for Low-Cost Programs". www.chronicle.com. 6 November 2014. Retrieved 2022-03-25.

columbia.edu

"Zvi Galil Named Dean of Columbia's Engineering School" (Press release). Columbia University. July 14, 1995. Retrieved 2019-06-05.
"Zvi Galil Elected to National Academy of Engineering". Columbia News. Columbia University. Retrieved May 11, 2012.

cs.columbia.edu

"New York Area Theory Day". www.cs.columbia.edu. Retrieved 2020-06-03.

cc-seas.columbia.edu

"Zvi Galil Award". Columbia College. Retrieved 2019-06-05.

college.columbia.edu

"Quigley, Galil To Receive Great Teacher Awards". Columbia College Today. September 2009. Retrieved 2019-06-05.

doi.org

Eppstein, David; Italiano, Giuseppe F. (March 1999). "PREFACE: Festschrift for Zvi Galil". Journal of Complexity. 15 (1): 1–3. doi:10.1006/jcom.1998.0492.
Zvi, Galil; David Eppstein; Giuseppe F. Italiano; Amnon Nissenzweig (September 1997). "Sparsification - a technique for speeding up dynamic graph algorithms". Journal of the ACM. 44 (5): 669–696. doi:10.1145/265910.265914. S2CID 340999.
Galil, Zvi (1981-01-01). "String Matching in Real Time". Journal of the ACM. 28 (1): 134–149. doi:10.1145/322234.322244. ISSN 0004-5411. S2CID 9164969.
Galil, Zvi (1978-04-01). "Palindrome recognition in real time by a multitape turing machine". Journal of Computer and System Sciences. 16 (2): 140–157. doi:10.1016/0022-0000(78)90042-9. ISSN 0022-0000.
Galil, Zvi; Seiferas, Joel (1983-06-01). "Time-space-optimal string matching". Journal of Computer and System Sciences. 26 (3): 280–294. doi:10.1016/0022-0000(83)90002-8. hdl:1802/10578. ISSN 0022-0000.
Breslauer, Dany; Galil, Zvi (1990-12-01). "An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm". SIAM Journal on Computing. 19 (6): 1051–1058. doi:10.1137/0219072. ISSN 0097-5397.
Breslauer, Dany; Galil, Zvi (1992-10-01). "A Lower Bound for Parallel String Matching". SIAM Journal on Computing. 21 (5): 856–862. doi:10.1137/0221050. ISSN 0097-5397.
Crochemore, Maxime; Galil, Zvi; Gasieniec, Leszek; Park, Kunsoo; Rytter, Wojciech (1997-08-01). "Constant-Time Randomized Parallel String Matching". SIAM Journal on Computing. 26 (4): 950–960. doi:10.1137/S009753979528007X. ISSN 0097-5397.
Galil, Zvi; Hoffmann, Christoph M.; Luks, Eugene M.; Schnorr, Claus P.; Weber, Andreas (1987-07-01). "An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs". Journal of the ACM. 34 (3): 513–531. doi:10.1145/28869.28870. ISSN 0004-5411. S2CID 18031646.
Gabow, Harold N.; Galil, Zvi; Spencer, Thomas; Tarjan, Robert E. (1986-06-01). "Efficient algorithms for finding minimum spanning trees in undirected and directed graphs". Combinatorica. 6 (2): 109–122. doi:10.1007/BF02579168. ISSN 1439-6912. S2CID 35618095.
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Nissenzweig, Amnon (1997-09-01). "Sparsification—a technique for speeding up dynamic graph algorithms". Journal of the ACM. 44 (5): 669–696. doi:10.1145/265910.265914. ISSN 0004-5411. S2CID 340999.
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F. (1992-07-01). "Sparse dynamic programming I: linear cost functions". Journal of the ACM. 39 (3): 519–545. doi:10.1145/146637.146650. ISSN 0004-5411. S2CID 17060840.
Gabber, Ofer; Galil, Zvi (1981-06-01). "Explicit constructions of linear-sized superconcentrators". Journal of Computer and System Sciences. 22 (3): 407–420. doi:10.1016/0022-0000(81)90040-4. ISSN 0022-0000.

forbes.com

Nietzel, Michael T. "Georgia Tech's Online MS In Computer Science Continues To Thrive. Why That's Important For The Future of MOOCs". Forbes. Retrieved 2022-03-25.
Busteed, Brandon. "The Greatest Degree Program Ever". Forbes. Retrieved 2023-11-17.

gatech.edu

cc.gatech.edu

"College's Skyrocketing Stature, Global Impact Highlight Galil's Legacy". Georgia Tech College of Computing. April 16, 2019. Retrieved 2019-06-05.
"New Endowed Chair Honors Inclusion and Diversity". College of Computing. 2021-06-02. Retrieved 2021-06-09.

news.gatech.edu

"Institute names next College of Computing Dean" (Press release). Georgia Institute of Technology. 2010-04-09. Retrieved 2010-04-09.

haaretz.com

Ilani, Ofri; Kashti, Or (2009-07-02). "Tel Aviv University president quits / Sources: Galil was forced out of office". Haaretz. Retrieved 2011-06-27.

handle.net

hdl.handle.net

Galil, Zvi; Seiferas, Joel (1983-06-01). "Time-space-optimal string matching". Journal of Computer and System Sciences. 26 (3): 280–294. doi:10.1016/0022-0000(83)90002-8. hdl:1802/10578. ISSN 0022-0000.

insidehighered.com

"Analysis shows Georgia Tech's online master's in computer science expanded access | Inside Higher Ed". www.insidehighered.com. 20 March 2018. Retrieved 2022-03-25.

isiknowledge.com

hcr3.isiknowledge.com

"ISI Highly Cited Researchers Version 1.1: Zvi Galil". ISI Web of Knowledge. Retrieved 2011-06-27.

issuu.com

"Georgia Tech Alumni Magazine, Vol. 95 No. 3, Fall 2019". Issuu. 11 October 2019. Retrieved 2020-04-21.

jpost.com

"Computer expert nominated for TAU presidency". The Jerusalem Post. November 5, 2006.

mathgenealogy.org

Zvi Galil at the Mathematics Genealogy Project

nae.edu

"Dr. Zvi Galil". NAE Members. National Academy of Engineering. Retrieved May 11, 2012.

nytimes.com

query.nytimes.com

Arenson, Karen W. (1997-10-01). "Chinese Tycoon Gives Columbia $26 Million". The New York Times. Retrieved 2010-04-20.

nytimes.com

Lewin, Tamar (2013-08-18). "Master's Degree Is New Frontier of Study Online". The New York Times. ISSN 0362-4331. Retrieved 2023-01-02.

semanticscholar.org

api.semanticscholar.org

Zvi, Galil; David Eppstein; Giuseppe F. Italiano; Amnon Nissenzweig (September 1997). "Sparsification - a technique for speeding up dynamic graph algorithms". Journal of the ACM. 44 (5): 669–696. doi:10.1145/265910.265914. S2CID 340999.
Galil, Zvi (1981-01-01). "String Matching in Real Time". Journal of the ACM. 28 (1): 134–149. doi:10.1145/322234.322244. ISSN 0004-5411. S2CID 9164969.
Galil, Zvi; Hoffmann, Christoph M.; Luks, Eugene M.; Schnorr, Claus P.; Weber, Andreas (1987-07-01). "An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs". Journal of the ACM. 34 (3): 513–531. doi:10.1145/28869.28870. ISSN 0004-5411. S2CID 18031646.
Gabow, Harold N.; Galil, Zvi; Spencer, Thomas; Tarjan, Robert E. (1986-06-01). "Efficient algorithms for finding minimum spanning trees in undirected and directed graphs". Combinatorica. 6 (2): 109–122. doi:10.1007/BF02579168. ISSN 1439-6912. S2CID 35618095.
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Nissenzweig, Amnon (1997-09-01). "Sparsification—a technique for speeding up dynamic graph algorithms". Journal of the ACM. 44 (5): 669–696. doi:10.1145/265910.265914. ISSN 0004-5411. S2CID 340999.
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F. (1992-07-01). "Sparse dynamic programming I: linear cost functions". Journal of the ACM. 39 (3): 519–545. doi:10.1145/146637.146650. ISSN 0004-5411. S2CID 17060840.

siam.org

epubs.siam.org

Breslauer, Dany; Galil, Zvi (1990-12-01). "An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm". SIAM Journal on Computing. 19 (6): 1051–1058. doi:10.1137/0219072. ISSN 0097-5397.
Breslauer, Dany; Galil, Zvi (1992-10-01). "A Lower Bound for Parallel String Matching". SIAM Journal on Computing. 21 (5): 856–862. doi:10.1137/0221050. ISSN 0097-5397.
Crochemore, Maxime; Galil, Zvi; Gasieniec, Leszek; Park, Kunsoo; Rytter, Wojciech (1997-08-01). "Constant-Time Randomized Parallel String Matching". SIAM Journal on Computing. 26 (4): 950–960. doi:10.1137/S009753979528007X. ISSN 0097-5397.

stringology.org

"Introduction to Stringology". The Prague Stringology Club. Czech Technical University in Prague. Retrieved May 14, 2012.

tau.ac.il

english.tau.ac.il

Basch_Interactive (1980-01-01). "Presidents of Tel Aviv University | Tel Aviv University | Tel Aviv University". English.tau.ac.il. Retrieved 2020-02-18.

uni-trier.de

informatik.uni-trier.de

"Zvi Galil". The DBLP Computer Science Bibliography. Digital Bibliography & Library Project. Retrieved 2016-03-24.

uwaterloo.ca

newsrelease.uwaterloo.ca

Smyth, Pamela. "University of Waterloo to award eight honorary degrees at spring convocation". Waterloo Communications. University of Waterloo. Retrieved May 11, 2012.

worldcat.org

search.worldcat.org

Lewin, Tamar (2013-08-18). "Master's Degree Is New Frontier of Study Online". The New York Times. ISSN 0362-4331. Retrieved 2023-01-02.
Varadarajan, Tunku (2021-04-02). "Opinion | The Man Who Made Online College Work". Wall Street Journal. ISSN 0099-9660. Retrieved 2021-11-01.
Galil, Zvi (1981-01-01). "String Matching in Real Time". Journal of the ACM. 28 (1): 134–149. doi:10.1145/322234.322244. ISSN 0004-5411. S2CID 9164969.
Galil, Zvi (1978-04-01). "Palindrome recognition in real time by a multitape turing machine". Journal of Computer and System Sciences. 16 (2): 140–157. doi:10.1016/0022-0000(78)90042-9. ISSN 0022-0000.
Galil, Zvi; Seiferas, Joel (1983-06-01). "Time-space-optimal string matching". Journal of Computer and System Sciences. 26 (3): 280–294. doi:10.1016/0022-0000(83)90002-8. hdl:1802/10578. ISSN 0022-0000.
Breslauer, Dany; Galil, Zvi (1990-12-01). "An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm". SIAM Journal on Computing. 19 (6): 1051–1058. doi:10.1137/0219072. ISSN 0097-5397.
Breslauer, Dany; Galil, Zvi (1992-10-01). "A Lower Bound for Parallel String Matching". SIAM Journal on Computing. 21 (5): 856–862. doi:10.1137/0221050. ISSN 0097-5397.
Crochemore, Maxime; Galil, Zvi; Gasieniec, Leszek; Park, Kunsoo; Rytter, Wojciech (1997-08-01). "Constant-Time Randomized Parallel String Matching". SIAM Journal on Computing. 26 (4): 950–960. doi:10.1137/S009753979528007X. ISSN 0097-5397.
Galil, Zvi; Hoffmann, Christoph M.; Luks, Eugene M.; Schnorr, Claus P.; Weber, Andreas (1987-07-01). "An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs". Journal of the ACM. 34 (3): 513–531. doi:10.1145/28869.28870. ISSN 0004-5411. S2CID 18031646.
Gabow, Harold N.; Galil, Zvi; Spencer, Thomas; Tarjan, Robert E. (1986-06-01). "Efficient algorithms for finding minimum spanning trees in undirected and directed graphs". Combinatorica. 6 (2): 109–122. doi:10.1007/BF02579168. ISSN 1439-6912. S2CID 35618095.
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Nissenzweig, Amnon (1997-09-01). "Sparsification—a technique for speeding up dynamic graph algorithms". Journal of the ACM. 44 (5): 669–696. doi:10.1145/265910.265914. ISSN 0004-5411. S2CID 340999.
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F. (1992-07-01). "Sparse dynamic programming I: linear cost functions". Journal of the ACM. 39 (3): 519–545. doi:10.1145/146637.146650. ISSN 0004-5411. S2CID 17060840.
Gabber, Ofer; Galil, Zvi (1981-06-01). "Explicit constructions of linear-sized superconcentrators". Journal of Computer and System Sciences. 22 (3): 407–420. doi:10.1016/0022-0000(81)90040-4. ISSN 0022-0000.

wsj.com

Varadarajan, Tunku (2021-04-02). "Opinion | The Man Who Made Online College Work". Wall Street Journal. ISSN 0099-9660. Retrieved 2021-11-01.