Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Zvi Galil
@article{DBLP:journals/cacm/RamachandranG22,
author = {Umakishore Ramachandran and
Zvi Galil},
title = {Creating a revolutionary academic program},
journal = {Commun. {ACM}},
volume = {65},
number = {10},
pages = {46--56},
year = {2022},
url = {https://doi.org/10.1145/3503915},
doi = {10.1145/3503915},
timestamp = {Wed, 05 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cacm/RamachandranG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/GuNPGIH22,
author = {Geonmo Gu and
Yehyun Nam and
Kunsoo Park and
Zvi Galil and
Giuseppe F. Italiano and
Wook{-}Shin Han},
title = {Efficient Graph Isomorphism Query Processing using Degree Sequences
and Color-Label Distributions},
booktitle = {38th {IEEE} International Conference on Data Engineering, {ICDE} 2022,
Kuala Lumpur, Malaysia, May 9-12, 2022},
pages = {872--884},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/ICDE53745.2022.00070},
doi = {10.1109/ICDE53745.2022.00070},
timestamp = {Fri, 05 Aug 2022 16:24:00 +0200},
biburl = {https://dblp.org/rec/conf/icde/GuNPGIH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/GuNPGIH21,
author = {Geonmo Gu and
Yehyun Nam and
Kunsoo Park and
Zvi Galil and
Giuseppe F. Italiano and
Wook{-}Shin Han},
title = {Scalable Graph Isomorphism: Combining Pairwise Color Refinement and
Backtracking via Compressed Candidate Space},
booktitle = {37th {IEEE} International Conference on Data Engineering, {ICDE} 2021,
Chania, Greece, April 19-22, 2021},
pages = {1368--1379},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ICDE51399.2021.00122},
doi = {10.1109/ICDE51399.2021.00122},
timestamp = {Fri, 25 Jun 2021 11:30:58 +0200},
biburl = {https://dblp.org/rec/conf/icde/GuNPGIH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/Galil20,
author = {Zvi Galil},
title = {{OMSCS:} the revolution will be digitized},
journal = {Commun. {ACM}},
volume = {63},
number = {8},
pages = {27--29},
year = {2020},
url = {https://doi.org/10.1145/3366191},
doi = {10.1145/3366191},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cacm/Galil20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/ApostolicoCFGM16,
author = {Alberto Apostolico and
Maxime Crochemore and
Martin Farach{-}Colton and
Zvi Galil and
S. Muthukrishnan},
title = {40 years of suffix trees},
journal = {Commun. {ACM}},
volume = {59},
number = {4},
pages = {66--73},
year = {2016},
url = {https://doi.org/10.1145/2810036},
doi = {10.1145/2810036},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cacm/ApostolicoCFGM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BreslauerG14,
author = {Dany Breslauer and
Zvi Galil},
title = {Real-Time Streaming String-Matching},
journal = {{ACM} Trans. Algorithms},
volume = {10},
number = {4},
pages = {22:1--22:12},
year = {2014},
url = {https://doi.org/10.1145/2635814},
doi = {10.1145/2635814},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BreslauerG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/ApostolicoCFGM13,
author = {Alberto Apostolico and
Maxime Crochemore and
Martin Farach{-}Colton and
Zvi Galil and
S. Muthukrishnan},
editor = {Johannes Fischer and
Peter Sanders},
title = {Forty Years of Text Indexing},
booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, {CPM} 2013,
Bad Herrenalb, Germany, June 17-19, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7922},
pages = {1--10},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38905-4\_1},
doi = {10.1007/978-3-642-38905-4\_1},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/ApostolicoCFGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BreslauerG11,
author = {Dany Breslauer and
Zvi Galil},
editor = {Raffaele Giancarlo and
Giovanni Manzini},
title = {Real-Time Streaming String-Matching},
booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011,
Palermo, Italy, June 27-29, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6661},
pages = {162--172},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21458-5\_15},
doi = {10.1007/978-3-642-21458-5\_15},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BreslauerG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Galil10,
author = {Zvi Galil},
editor = {Amihood Amir and
Laxmi Parida},
title = {Old and New in Stringology},
booktitle = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010,
New York, NY, USA, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6129},
pages = {26},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13509-5\_3},
doi = {10.1007/978-3-642-13509-5\_3},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Galil10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ColeGHMP04,
author = {Richard Cole and
Zvi Galil and
Ramesh Hariharan and
S. Muthukrishnan and
Kunsoo Park},
title = {Parallel two dimensional witness computation},
journal = {Inf. Comput.},
volume = {188},
number = {1},
pages = {20--67},
year = {2004},
url = {https://doi.org/10.1016/S0890-5401(03)00162-7},
doi = {10.1016/S0890-5401(03)00162-7},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/ColeGHMP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GalilPP04,
author = {Zvi Galil and
Jong Geun Park and
Kunsoo Park},
title = {Three-Dimensional Periodicity and Its Application to Pattern Matching},
journal = {{SIAM} J. Discret. Math.},
volume = {18},
number = {2},
pages = {362--381},
year = {2004},
url = {https://doi.org/10.1137/S0895480101390308},
doi = {10.1137/S0895480101390308},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GalilPP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ben-AmramG02,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
title = {Lower Bounds for Dynamic Data Structures on Algebraic RAMs},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {364--395},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0079-6},
doi = {10.1007/S00453-001-0079-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Ben-AmramG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Ben-AmramG01,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
title = {A Generalization of a Lower Bound Technique due to Fredman and Saks},
journal = {Algorithmica},
volume = {30},
number = {1},
pages = {34--66},
year = {2001},
url = {https://doi.org/10.1007/s004530010077},
doi = {10.1007/S004530010077},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Ben-AmramG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Ben-AmramG01,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
title = {Topological Lower Bounds on Algebraic Random Access Machines},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {3},
pages = {722--761},
year = {2001},
url = {https://doi.org/10.1137/S0097539797329397},
doi = {10.1137/S0097539797329397},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Ben-AmramG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FranklinGY00,
author = {Matthew K. Franklin and
Zvi Galil and
Moti Yung},
title = {Eavesdropping games: a graph-theoretic approach to privacy in distributed
systems},
journal = {J. {ACM}},
volume = {47},
number = {2},
pages = {225--243},
year = {2000},
url = {https://doi.org/10.1145/333979.333980},
doi = {10.1145/333979.333980},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FranklinGY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GalilIS99,
author = {Zvi Galil and
Giuseppe F. Italiano and
Neil Sarnak},
title = {Fully Dynamic Planarity Testing with Applications},
journal = {J. {ACM}},
volume = {46},
number = {1},
pages = {28--91},
year = {1999},
url = {https://doi.org/10.1145/300515.300517},
doi = {10.1145/300515.300517},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GalilIS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/crc/99/EppsteinGI99,
author = {David Eppstein and
Zvi Galil and
Giuseppe F. Italiano},
editor = {Mikhail J. Atallah},
title = {Dynamic Graph Algorithms},
booktitle = {Algorithms and Theory of Computation Handbook},
series = {Chapman {\&} Hall/CRC Applied Algorithms and Data Structures series},
publisher = {{CRC} Press},
year = {1999},
url = {https://doi.org/10.1201/9781420049503-c9},
doi = {10.1201/9781420049503-C9},
timestamp = {Fri, 17 Jul 2020 16:12:44 +0200},
biburl = {https://dblp.org/rec/books/crc/99/EppsteinGI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EppsteinGIS98,
author = {David Eppstein and
Zvi Galil and
Giuseppe F. Italiano and
Thomas H. Spencer},
title = {Separator-Based Sparsification {II:} Edge and Vertex Connectivity},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {1},
pages = {341--381},
year = {1998},
url = {https://doi.org/10.1137/S0097539794269072},
doi = {10.1137/S0097539794269072},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/EppsteinGIS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GalilM97,
author = {Zvi Galil and
Oded Margalit},
title = {All Pairs Shortest Distances for Graphs with Small Integer Length
Edges},
journal = {Inf. Comput.},
volume = {134},
number = {2},
pages = {103--139},
year = {1997},
url = {https://doi.org/10.1006/inco.1997.2620},
doi = {10.1006/INCO.1997.2620},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GalilM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EppsteinGIN97,
author = {David Eppstein and
Zvi Galil and
Giuseppe F. Italiano and
Amnon Nissenzweig},
title = {Sparsification - a technique for speeding up dynamic graph algorithms},
journal = {J. {ACM}},
volume = {44},
number = {5},
pages = {669--696},
year = {1997},
url = {https://doi.org/10.1145/265910.265914},
doi = {10.1145/265910.265914},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EppsteinGIN97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GalilM97,
author = {Zvi Galil and
Oded Margalit},
title = {All Pairs Shortest Paths for Graphs with Small Integer Length Edges},
journal = {J. Comput. Syst. Sci.},
volume = {54},
number = {2},
pages = {243--254},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1385},
doi = {10.1006/JCSS.1997.1385},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GalilM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AlonGM97,
author = {Noga Alon and
Zvi Galil and
Oded Margalit},
title = {On the Exponent of the All Pairs Shortest Path Problem},
journal = {J. Comput. Syst. Sci.},
volume = {54},
number = {2},
pages = {255--262},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1388},
doi = {10.1006/JCSS.1997.1388},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AlonGM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CrochemoreGGPR97,
author = {Maxime Crochemore and
Zvi Galil and
Leszek Gasieniec and
Kunsoo Park and
Wojciech Rytter},
title = {Constant-Time Randomized Parallel String Matching},
journal = {{SIAM} J. Comput.},
volume = {26},
number = {4},
pages = {950--960},
year = {1997},
url = {https://doi.org/10.1137/S009753979528007X},
doi = {10.1137/S009753979528007X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CrochemoreGGPR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sequences/Galil97,
author = {Zvi Galil},
editor = {Bruno Carpentieri and
Alfredo De Santis and
Ugo Vaccaro and
James A. Storer},
title = {Open Problems In Stringology, Thirteen years Later},
booktitle = {Compression and Complexity of {SEQUENCES} 1997, Positano, Amalfitan
Coast, Salerno, Italy, June 11-13, 1997, Proceedings},
pages = {347},
publisher = {{IEEE}},
year = {1997},
url = {https://doi.org/10.1109/SEQUEN.1997.666928},
doi = {10.1109/SEQUEN.1997.666928},
timestamp = {Wed, 16 Oct 2019 14:14:56 +0200},
biburl = {https://dblp.org/rec/conf/sequences/Galil97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/GalilPP97,
author = {Zvi Galil and
Jong Geun Park and
Kunsoo Park},
editor = {Charles E. Leiserson and
David E. Culler},
title = {Three-Dimensional Pattern Matching},
booktitle = {Proceedings of the 9th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '97, Newport, RI, USA, June 23-25, 1997},
pages = {53--62},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258492.258498},
doi = {10.1145/258492.258498},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/GalilPP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/ox/p/GalilY97,
author = {Zvi Galil and
I. Yudkiewicz},
editor = {Alberto Apostolico and
Zvi Galil},
title = {Off-line parallel exact string searching},
booktitle = {Pattern Matching Algorithms},
pages = {55--88},
publisher = {Oxford University Press},
year = {1997},
timestamp = {Thu, 12 Jan 2017 08:03:38 +0100},
biburl = {https://dblp.org/rec/books/ox/p/GalilY97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/ox/AG1997,
editor = {Alberto Apostolico and
Zvi Galil},
title = {Pattern Matching Algorithms},
publisher = {Oxford University Press},
year = {1997},
url = {https://global.oup.com/academic/product/pattern-matching-algorithms-9780195113679},
isbn = {978-019-511367-9},
timestamp = {Thu, 12 Jan 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/ox/AG1997.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EppsteinGIS96,
author = {David Eppstein and
Zvi Galil and
Giuseppe F. Italiano and
Thomas H. Spencer},
title = {Separator Based Sparsification. I. Planary Testing and Minimum Spanning
Trees},
journal = {J. Comput. Syst. Sci.},
volume = {52},
number = {1},
pages = {3--27},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0002},
doi = {10.1006/JCSS.1996.0002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/EppsteinGIS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilP96,
author = {Zvi Galil and
Kunsoo Park},
title = {Alphabet-Independent Two-Dimensional Witness Computation},
journal = {{SIAM} J. Comput.},
volume = {25},
number = {5},
pages = {907--935},
year = {1996},
url = {https://doi.org/10.1137/S0097539792241941},
doi = {10.1137/S0097539792241941},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BreslauerG95,
author = {Dany Breslauer and
Zvi Galil},
title = {Finding All Periods and Initial Palindromes of a String in Parallel},
journal = {Algorithmica},
volume = {14},
number = {4},
pages = {355--366},
year = {1995},
url = {https://doi.org/10.1007/BF01294132},
doi = {10.1007/BF01294132},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BreslauerG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Ben-AmramG95,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
title = {On the Power of the Shift Instruction},
journal = {Inf. Comput.},
volume = {117},
number = {1},
pages = {19--36},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1026},
doi = {10.1006/INCO.1995.1026},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Ben-AmramG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Galil95,
author = {Zvi Galil},
title = {A Constant-Time Optimal Parallel String-Matching Algorithm},
journal = {J. {ACM}},
volume = {42},
number = {4},
pages = {908--918},
year = {1995},
url = {https://doi.org/10.1145/210332.210341},
doi = {10.1145/210332.210341},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Galil95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ApostolicoBG95,
author = {Alberto Apostolico and
Dany Breslauer and
Zvi Galil},
title = {Parallel Detection of all Palindromes in a String},
journal = {Theor. Comput. Sci.},
volume = {141},
number = {1{\&}2},
pages = {163--173},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00083-U},
doi = {10.1016/0304-3975(94)00083-U},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ApostolicoBG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AlonGY95,
author = {Noga Alon and
Zvi Galil and
Moti Yung},
editor = {Paul G. Spirakis},
title = {Efficient Dynamic-Resharing "Verifiable Secret Sharing"
Against Mobile Adversary},
booktitle = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece,
September 25-27, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {979},
pages = {523--537},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60313-1\_168},
doi = {10.1007/3-540-60313-1\_168},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/AlonGY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalilMY95,
author = {Zvi Galil and
Alain J. Mayer and
Moti Yung},
title = {Resolving Message Complexity of Byzantine Agreement and beyond},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {724--733},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492674},
doi = {10.1109/SFCS.1995.492674},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalilMY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Ben-AmramG95,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
editor = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Ferenc G{\'{e}}cseg},
title = {Lower Bounds on Algebraic Random Access Machines (Extended Abstract)},
booktitle = {Automata, Languages and Programming, 22nd International Colloquium,
ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {944},
pages = {360--371},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60084-1\_88},
doi = {10.1007/3-540-60084-1\_88},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Ben-AmramG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DurisG95,
author = {Pavol Duris and
Zvi Galil},
editor = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Ferenc G{\'{e}}cseg},
title = {Sensing Versus Nonsensing Automata},
booktitle = {Automata, Languages and Programming, 22nd International Colloquium,
ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {944},
pages = {455--463},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60084-1\_96},
doi = {10.1007/3-540-60084-1\_96},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DurisG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GalilY95,
author = {Zvi Galil and
Xiangdong Yu},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Short length versions of Menger's theorem (Extended Abstract)},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {499--508},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225267},
doi = {10.1145/225058.225267},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GalilY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CzumajGGPP95,
author = {Artur Czumaj and
Zvi Galil and
Leszek Gasieniec and
Kunsoo Park and
Wojciech Plandowski},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Work-time-optimal parallel algorithms for string problems},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {713--722},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225289},
doi = {10.1145/225058.225289},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CzumajGGPP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/95,
editor = {Zvi Galil and
Esko Ukkonen},
title = {Combinatorial Pattern Matching, 6th Annual Symposium, {CPM} 95, Espoo,
Finland, July 5-7, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {937},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60044-2},
doi = {10.1007/3-540-60044-2},
isbn = {3-540-60044-2},
timestamp = {Thu, 29 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-062,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
title = {On Data Structure Tradeoffs and an Application to Union-Find},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR95-062}},
year = {1995},
url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-062/index.html},
eprinttype = {ECCC},
eprint = {TR95-062},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-062.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DubinerGM94,
author = {Moshe Dubiner and
Zvi Galil and
Edith Magen},
title = {Faster Tree Pattern Matching},
journal = {J. {ACM}},
volume = {41},
number = {2},
pages = {205--213},
year = {1994},
url = {https://doi.org/10.1145/174652.174653},
doi = {10.1145/174652.174653},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DubinerGM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AmirFGBP94,
author = {Amihood Amir and
Martin Farach and
Zvi Galil and
Raffaele Giancarlo and
Kunsoo Park},
title = {Dynamic Dictionary Matching},
journal = {J. Comput. Syst. Sci.},
volume = {49},
number = {2},
pages = {208--222},
year = {1994},
url = {https://doi.org/10.1016/S0022-0000(05)80047-9},
doi = {10.1016/S0022-0000(05)80047-9},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/AmirFGBP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/GalilP94,
author = {Zvi Galil and
Kunsoo Park},
title = {Parallel Algorithms for Dynamic Programming Recurrences with More
than {O(1)} Dependency},
journal = {J. Parallel Distributed Comput.},
volume = {21},
number = {2},
pages = {213--222},
year = {1994},
url = {https://doi.org/10.1006/jpdc.1994.1053},
doi = {10.1006/JPDC.1994.1053},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/GalilP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ApostolicoBG94,
author = {Alberto Apostolico and
Dany Breslauer and
Zvi Galil},
editor = {Patrice Enjalbert and
Ernst W. Mayr and
Klaus W. Wagner},
title = {Parallel Detection of all Palindromes in a String},
booktitle = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
Science, Caen, France, February 24-26, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {775},
pages = {497--506},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57785-8\_166},
doi = {10.1007/3-540-57785-8\_166},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ApostolicoBG94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DurisG93,
author = {Pavol Duris and
Zvi Galil},
title = {On the Power of Multiple Reads in a Chip},
journal = {Inf. Comput.},
volume = {104},
number = {2},
pages = {277--287},
year = {1993},
url = {https://doi.org/10.1006/inco.1993.1034},
doi = {10.1006/INCO.1993.1034},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/DurisG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/GalilM93,
author = {Zvi Galil and
Oded Margalit},
title = {Witnesses for Boolean Matrix Multiplication and for Transitive Closure},
journal = {J. Complex.},
volume = {9},
number = {2},
pages = {201--221},
year = {1993},
url = {https://doi.org/10.1006/jcom.1993.1014},
doi = {10.1006/JCOM.1993.1014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/GalilM93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/BreslauerG93,
author = {Dany Breslauer and
Zvi Galil},
title = {Efficient Comparison Based String Matching},
journal = {J. Complex.},
volume = {9},
number = {3},
pages = {339--365},
year = {1993},
url = {https://doi.org/10.1006/jcom.1993.1022},
doi = {10.1006/JCOM.1993.1022},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/BreslauerG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilI93,
author = {Zvi Galil and
Giuseppe F. Italiano},
title = {Maintaining the 3-Edge-Connected Components of a Graph On-Line},
journal = {{SIAM} J. Comput.},
volume = {22},
number = {1},
pages = {11--28},
year = {1993},
url = {https://doi.org/10.1137/0222002},
doi = {10.1137/0222002},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilI93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ColeCGGHMPR93,
author = {Richard Cole and
Maxime Crochemore and
Zvi Galil and
Leszek Gasieniec and
Ramesh Hariharan and
S. Muthukrishnan and
Kunsoo Park and
Wojciech Rytter},
title = {Optimally fast parallel algorithms for preprocessing and pattern matching
in one and two dimensions},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {248--258},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366862},
doi = {10.1109/SFCS.1993.366862},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ColeCGGHMPR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-AmramG93,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
title = {When can we sort in o(n log n) time?},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {538--546},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366833},
doi = {10.1109/SFCS.1993.366833},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-AmramG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FranklinGY93,
author = {Matthew K. Franklin and
Zvi Galil and
Moti Yung},
title = {Eavesdropping Games: {A} Graph-Theoretic Approach to Privacy in Distributed
Systems},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {670--679},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366820},
doi = {10.1109/SFCS.1993.366820},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FranklinGY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EppsteinGIS93,
author = {David Eppstein and
Zvi Galil and
Giuseppe F. Italiano and
Thomas H. Spencer},
editor = {S. Rao Kosaraju and
David S. Johnson and
Alok Aggarwal},
title = {Separator based sparsification for dynamic planar graph algorithms},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
Computing, May 16-18, 1993, San Diego, CA, {USA}},
pages = {208--217},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/167088.167159},
doi = {10.1145/167088.167159},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EppsteinGIS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/1993,
editor = {Alberto Apostolico and
Maxime Crochemore and
Zvi Galil and
Udi Manber},
title = {Combinatorial Pattern Matching, 4th Annual Symposium, {CPM} 93, Padova,
Italy, June 2-4, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {684},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/BFb0029791},
doi = {10.1007/BFB0029791},
isbn = {3-540-56764-X},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/1993.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EppsteinGGI92,
author = {David Eppstein and
Zvi Galil and
Raffaele Giancarlo and
Giuseppe F. Italiano},
title = {Sparse Dynamic Programming {I:} Linear Cost Functions},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {519--545},
year = {1992},
url = {https://doi.org/10.1145/146637.146650},
doi = {10.1145/146637.146650},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/EppsteinGGI92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EppsteinGGI92a,
author = {David Eppstein and
Zvi Galil and
Raffaele Giancarlo and
Giuseppe F. Italiano},
title = {Sparse Dynamic Programming {II:} Convex and Concave Cost Functions},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {546--567},
year = {1992},
url = {https://doi.org/10.1145/146637.146656},
doi = {10.1145/146637.146656},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/EppsteinGGI92a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ben-AmramG92,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
title = {On Pointers versus Addresses},
journal = {J. {ACM}},
volume = {39},
number = {3},
pages = {617--648},
year = {1992},
url = {https://doi.org/10.1145/146637.146666},
doi = {10.1145/146637.146666},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Ben-AmramG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilG92,
author = {Zvi Galil and
Raffaele Giancarlo},
title = {On the Exact Complexity of String Matching: Upper Bounds},
journal = {{SIAM} J. Comput.},
volume = {21},
number = {3},
pages = {407--437},
year = {1992},
url = {https://doi.org/10.1137/0221028},
doi = {10.1137/0221028},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BreslauerG92,
author = {Dany Breslauer and
Zvi Galil},
title = {A Lower Bound for Parallel String Matching},
journal = {{SIAM} J. Comput.},
volume = {21},
number = {5},
pages = {856--862},
year = {1992},
url = {https://doi.org/10.1137/0221050},
doi = {10.1137/0221050},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BreslauerG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilI92,
author = {Zvi Galil and
Giuseppe F. Italiano},
title = {Fully Dynamic Algorithms for 2-Edge Connectivity},
journal = {{SIAM} J. Comput.},
volume = {21},
number = {6},
pages = {1047--1069},
year = {1992},
url = {https://doi.org/10.1137/0221062},
doi = {10.1137/0221062},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilI92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Galil92,
author = {Zvi Galil},
title = {Renato Capocelli},
journal = {{SIGACT} News},
volume = {23},
number = {2},
pages = {104},
year = {1992},
url = {https://doi.org/10.1145/130956.130961},
doi = {10.1145/130956.130961},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Galil92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GalilP92,
author = {Zvi Galil and
Kunsoo Park},
title = {Dynamic Programming with Convexity, Concavity, and Sparsity},
journal = {Theor. Comput. Sci.},
volume = {92},
number = {1},
pages = {49--76},
year = {1992},
url = {https://doi.org/10.1016/0304-3975(92)90135-3},
doi = {10.1016/0304-3975(92)90135-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GalilP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RabaniG92,
author = {Yuval Rabani and
Zvi Galil},
title = {On the Space Complexity of Some Algorithms for Sequence Comparison},
journal = {Theor. Comput. Sci.},
volume = {95},
number = {2},
pages = {231--244},
year = {1992},
url = {https://doi.org/10.1016/0304-3975(92)90266-I},
doi = {10.1016/0304-3975(92)90266-I},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RabaniG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EppsteinGIN92,
author = {David Eppstein and
Zvi Galil and
Giuseppe F. Italiano and
Amnon Nissenzweig},
title = {Sparsification-A Technique for Speeding up Dynamic Graph Algorithms
(Extended Abstract)},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {60--69},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267818},
doi = {10.1109/SFCS.1992.267818},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EppsteinGIN92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalilP92,
author = {Zvi Galil and
Kunsoo Park},
title = {Truly Alphabet-Independent Two-Dimensional Pattern Matching},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {247--256},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267767},
doi = {10.1109/SFCS.1992.267767},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalilP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlonGMN92,
author = {Noga Alon and
Zvi Galil and
Oded Margalit and
Moni Naor},
title = {Witnesses for Boolean Matrix Multiplication and for Shortest Paths},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {417--426},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267748},
doi = {10.1109/SFCS.1992.267748},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlonGMN92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ApostolicoBG92,
author = {Alberto Apostolico and
Dany Breslauer and
Zvi Galil},
editor = {Werner Kuich},
title = {Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended
Abstract)},
booktitle = {Automata, Languages and Programming, 19th International Colloquium,
ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {623},
pages = {296--307},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55719-9\_82},
doi = {10.1007/3-540-55719-9\_82},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ApostolicoBG92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Galil92,
author = {Zvi Galil},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {A Constant-Time Optimal Parallel String-Matching Algorithm},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {69--76},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129720},
doi = {10.1145/129712.129720},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Galil92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GalilIS92,
author = {Zvi Galil and
Giuseppe F. Italiano and
Neil Sarnak},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {Fully Dynamic Planarity Testing (Extended Abstract)},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {495--506},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129761},
doi = {10.1145/129712.129761},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GalilIS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cpm/1992,
editor = {Alberto Apostolico and
Maxime Crochemore and
Zvi Galil and
Udi Manber},
title = {Combinatorial Pattern Matching, Third Annual Symposium, {CPM} 92,
Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {644},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56024-6},
doi = {10.1007/3-540-56024-6},
isbn = {3-540-56024-6},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/1992.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/istcs/1992,
editor = {Danny Dolev and
Zvi Galil and
Michael Rodeh},
title = {Theory of Computing and Systems, ISTCS'92, Israel Symposium, Haifa,
Israel, May 1992},
series = {Lecture Notes in Computer Science},
volume = {601},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/BFb0035160},
doi = {10.1007/BFB0035160},
isbn = {3-540-55553-6},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/istcs/1992.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/GalilI91,
author = {Zvi Galil and
Giuseppe F. Italiano},
title = {Data Structures and Algorithms for Disjoint Set Union Problems},
journal = {{ACM} Comput. Surv.},
volume = {23},
number = {3},
pages = {319--344},
year = {1991},
url = {https://doi.org/10.1145/116873.116878},
doi = {10.1145/116873.116878},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csur/GalilI91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalilI91,
author = {Zvi Galil and
Giuseppe F. Italiano},
title = {A Note on Set Union with Arbitrary Deunions},
journal = {Inf. Process. Lett.},
volume = {37},
number = {6},
pages = {331--335},
year = {1991},
url = {https://doi.org/10.1016/0020-0190(91)90151-7},
doi = {10.1016/0020-0190(91)90151-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GalilI91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DurisG91,
author = {Pavol Duris and
Zvi Galil},
title = {Two Lower Bounds in Asynchronous Distributed Computation},
journal = {J. Comput. Syst. Sci.},
volume = {42},
number = {3},
pages = {254--266},
year = {1991},
url = {https://doi.org/10.1016/0022-0000(91)90002-M},
doi = {10.1016/0022-0000(91)90002-M},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DurisG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilG91,
author = {Zvi Galil and
Raffaele Giancarlo},
title = {On the Exact Complexity of String Matching: Lower Bounds},
journal = {{SIAM} J. Comput.},
volume = {20},
number = {6},
pages = {1008--1020},
year = {1991},
url = {https://doi.org/10.1137/0220063},
doi = {10.1137/0220063},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilM91,
author = {Zvi Galil and
Oded Margalit},
title = {An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem},
journal = {{SIAM} J. Comput.},
volume = {20},
number = {6},
pages = {1157--1189},
year = {1991},
url = {https://doi.org/10.1137/0220072},
doi = {10.1137/0220072},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/GalilI91,
author = {Zvi Galil and
Giuseppe F. Italiano},
title = {Reducing edge connectivity to vertex connectivity},
journal = {{SIGACT} News},
volume = {22},
number = {1},
pages = {57--61},
year = {1991},
url = {https://doi.org/10.1145/122413.122416},
doi = {10.1145/122413.122416},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/GalilI91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AverbuchGW91,
author = {Amir Averbuch and
Zvi Galil and
Shmuel Winograd},
title = {Classification of All the Minimal Bilinear Algorithms for Computing
the Coefficients of the Product of Two Polynomials Modulo a Polynomial.
Part {II:} The Algebra G[u]/{\textless}u{\^{}}n{\textgreater}},
journal = {Theor. Comput. Sci.},
volume = {86},
number = {2},
pages = {143--203},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90017-V},
doi = {10.1016/0304-3975(91)90017-V},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AverbuchGW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlonGM91,
author = {Noga Alon and
Zvi Galil and
Oded Margalit},
title = {On the Exponent of the All Pairs Shortest Path Problem},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {569--575},
publisher = {{IEEE} Computer Society},
year = {1991},
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
biburl = {https://dblp.org/rec/conf/focs/AlonGM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-AmramG91,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
title = {Lower Bounds for Data Structure Problems on RAMs (Extended Abstract)},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {622--631},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185428},
doi = {10.1109/SFCS.1991.185428},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-AmramG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GalilI91,
author = {Zvi Galil and
Giuseppe F. Italiano},
editor = {Javier Leach Albert and
Burkhard Monien and
Mario Rodr{\'{\i}}guez{-}Artalejo},
title = {Maintaining Biconnected Components of Dynamic Planar Graphs},
booktitle = {Automata, Languages and Programming, 18th International Colloquium,
ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {510},
pages = {339--350},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54233-7\_146},
doi = {10.1007/3-540-54233-7\_146},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GalilI91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DurisG91,
author = {Pavol Duris and
Zvi Galil},
editor = {Javier Leach Albert and
Burkhard Monien and
Mario Rodr{\'{\i}}guez{-}Artalejo},
title = {On the Power of Multiple Reads in a Chip},
booktitle = {Automata, Languages and Programming, 18th International Colloquium,
ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {510},
pages = {697--706},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54233-7\_175},
doi = {10.1007/3-540-54233-7\_175},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DurisG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GalilM91,
author = {Zvi Galil and
Oded Margalit},
editor = {Javier Leach Albert and
Burkhard Monien and
Mario Rodr{\'{\i}}guez{-}Artalejo},
title = {An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem},
booktitle = {Automata, Languages and Programming, 18th International Colloquium,
ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {510},
pages = {719--727},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54233-7\_177},
doi = {10.1007/3-540-54233-7\_177},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GalilM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GalilI91,
author = {Zvi Galil and
Giuseppe F. Italiano},
editor = {Cris Koutsougeras and
Jeffrey Scott Vitter},
title = {Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended
Abstract)},
booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
May 5-8, 1991, New Orleans, Louisiana, {USA}},
pages = {317--327},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/103418.103454},
doi = {10.1145/103418.103454},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GalilI91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BreslauerG91,
author = {Dany Breslauer and
Zvi Galil},
editor = {Cris Koutsougeras and
Jeffrey Scott Vitter},
title = {A Lower Bound for Parallel String Matching},
booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
May 5-8, 1991, New Orleans, Louisiana, {USA}},
pages = {439--443},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/103418.103465},
doi = {10.1145/103418.103465},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BreslauerG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalilP90,
author = {Zvi Galil and
Kunsoo Park},
title = {A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming},
journal = {Inf. Process. Lett.},
volume = {33},
number = {6},
pages = {309--311},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90215-J},
doi = {10.1016/0020-0190(90)90215-J},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GalilP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilP90,
author = {Zvi Galil and
Kunsoo Park},
title = {An Improved Algorithm for Approximate String Matching},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {989--999},
year = {1990},
url = {https://doi.org/10.1137/0219067},
doi = {10.1137/0219067},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BreslauerG90,
author = {Dany Breslauer and
Zvi Galil},
title = {An Optimal O(log log n) Time Parallel String Matching Algorithm},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {1051--1058},
year = {1990},
url = {https://doi.org/10.1137/0219072},
doi = {10.1137/0219072},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BreslauerG90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ColussiGG90,
author = {Livio Colussi and
Zvi Galil and
Raffaele Giancarlo},
title = {On the Exact Complexity of String Matching (Extended Abstract)},
booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
Missouri, USA, October 22-24, 1990, Volume {I}},
pages = {135--144},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FSCS.1990.89532},
doi = {10.1109/FSCS.1990.89532},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ColussiGG90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DubinerGM90,
author = {Moshe Dubiner and
Zvi Galil and
Edith Magen},
title = {Faster Tree Pattern Matching},
booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
Missouri, USA, October 22-24, 1990, Volume {I}},
pages = {145--150},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FSCS.1990.89533},
doi = {10.1109/FSCS.1990.89533},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DubinerGM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigal/Galil90,
author = {Zvi Galil},
editor = {Tetsuo Asano and
Toshihide Ibaraki and
Hiroshi Imai and
Takao Nishizeki},
title = {Recent Progress in String Algorithms},
booktitle = {Algorithms, International Symposium {SIGAL} '90, Tokyo, Japan, August
16-18, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {450},
pages = {1},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52921-7\_49},
doi = {10.1007/3-540-52921-7\_49},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/sigal/Galil90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EppsteinGGI90,
author = {David Eppstein and
Zvi Galil and
Raffaele Giancarlo and
Giuseppe F. Italiano},
editor = {David S. Johnson},
title = {Sparse Dynamic Programming},
booktitle = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1990, San Francisco, California, {USA}},
pages = {513--522},
publisher = {{SIAM}},
year = {1990},
url = {http://dl.acm.org/citation.cfm?id=320176.320238},
timestamp = {Thu, 05 Jul 2018 07:28:50 +0200},
biburl = {https://dblp.org/rec/conf/soda/EppsteinGGI90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GalilKS89,
author = {Zvi Galil and
Ravi Kannan and
Endre Szemer{\'{e}}di},
title = {On 3-pushdown graphs with large separators},
journal = {Comb.},
volume = {9},
number = {1},
pages = {9--19},
year = {1989},
url = {https://doi.org/10.1007/BF02122679},
doi = {10.1007/BF02122679},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GalilKS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalilP89,
author = {Zvi Galil and
Victor Y. Pan},
title = {Parallel Evaluation of the Determinant and of the Inverse of a Matrix},
journal = {Inf. Process. Lett.},
volume = {30},
number = {1},
pages = {41--45},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90173-7},
doi = {10.1016/0020-0190(89)90173-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GalilP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GabowGS89,
author = {Harold N. Gabow and
Zvi Galil and
Thomas H. Spencer},
title = {Efficient implementation of graph algorithms using contraction},
journal = {J. {ACM}},
volume = {36},
number = {3},
pages = {540--572},
year = {1989},
url = {https://doi.org/10.1145/65950.65954},
doi = {10.1145/65950.65954},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GabowGS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/ChaimovichFG89,
author = {Mark Chaimovich and
Gregory Freiman and
Zvi Galil},
title = {Solving dense subset-sum problems by using analytical number theory},
journal = {J. Complex.},
volume = {5},
number = {3},
pages = {271--282},
year = {1989},
url = {https://doi.org/10.1016/0885-064X(89)90025-3},
doi = {10.1016/0885-064X(89)90025-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/ChaimovichFG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GalilKS89,
author = {Zvi Galil and
Ravi Kannan and
Endre Szemer{\'{e}}di},
title = {On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic
One-Tape Turing Machines},
journal = {J. Comput. Syst. Sci.},
volume = {38},
number = {1},
pages = {134--149},
year = {1989},
url = {https://doi.org/10.1016/0022-0000(89)90036-6},
doi = {10.1016/0022-0000(89)90036-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GalilKS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilHY89,
author = {Zvi Galil and
Stuart Haber and
Moti Yung},
title = {Minimum-Knowledge Interactive Proofs for Decision Problems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {4},
pages = {711--739},
year = {1989},
url = {https://doi.org/10.1137/0218049},
doi = {10.1137/0218049},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilHY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GalilG89,
author = {Zvi Galil and
Raffaele Giancarlo},
title = {Speeding up Dynamic Programming with Applications to Molecular Biology},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {107--118},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90101-1},
doi = {10.1016/0304-3975(89)90101-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GalilG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/GalilHY89,
author = {Zvi Galil and
Stuart Haber and
Moti Yung},
editor = {Joan Feigenbaum and
Michael Merritt},
title = {Security against Replay Chosen-Ciphertext Attack},
booktitle = {Distributed Computing And Cryptography, Proceedings of a {DIMACS}
Workshop, Princeton, New Jersey, USA, October 4-6, 1989},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {2},
pages = {183--190},
publisher = {{DIMACS/AMS}},
year = {1989},
url = {https://doi.org/10.1090/dimacs/002/12},
doi = {10.1090/DIMACS/002/12},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/GalilHY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/GalilHY89,
author = {Zvi Galil and
Stuart Haber and
Moti Yung},
editor = {Jean{-}Jacques Quisquater and
Joos Vandewalle},
title = {A Secure Public-key Authentication Scheme},
booktitle = {Advances in Cryptology - {EUROCRYPT} '89, Workshop on the Theory and
Application of of Cryptographic Techniques, Houthalen, Belgium, April
10-13, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {434},
pages = {3--15},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-46885-4\_2},
doi = {10.1007/3-540-46885-4\_2},
timestamp = {Fri, 17 Jul 2020 16:12:46 +0200},
biburl = {https://dblp.org/rec/conf/eurocrypt/GalilHY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EppsteinG89,
author = {David Eppstein and
Zvi Galil},
editor = {Giorgio Ausiello and
Mariangiola Dezani{-}Ciancaglini and
Simona Ronchi Della Rocca},
title = {Parallel Algorithmic Techniques for Combinatorial Computation},
booktitle = {Automata, Languages and Programming, 16th International Colloquium,
ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {372},
pages = {304--318},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/BFb0035768},
doi = {10.1007/BFB0035768},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EppsteinG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GalilP89,
author = {Zvi Galil and
Kunsoo Park},
editor = {Giorgio Ausiello and
Mariangiola Dezani{-}Ciancaglini and
Simona Ronchi Della Rocca},
title = {An Improved Algorithm for Approximate String Matching},
booktitle = {Automata, Languages and Programming, 16th International Colloquium,
ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {372},
pages = {394--404},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/BFb0035772},
doi = {10.1007/BFB0035772},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GalilP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/naacl/StolfoGMM89,
author = {Salvatore J. Stolfo and
Zvi Galil and
Kathleen R. McKeown and
Russell Mills},
title = {Speech Recognition in Parallel},
booktitle = {Speech and Natural Language: Proceedings of a Workshop Held at Cape
Cod, Massachusetts, USA, {HLT} 1989, October 15-18, 1989},
publisher = {{ACL}},
year = {1989},
url = {https://aclanthology.org/H89-2049/},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/naacl/StolfoGMM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BerkmanBGSV89,
author = {Omer Berkman and
Dany Breslauer and
Zvi Galil and
Baruch Schieber and
Uzi Vishkin},
editor = {David S. Johnson},
title = {Highly Parallelizable Problems (Extended Abstract)},
booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
May 14-17, 1989, Seattle, Washington, {USA}},
pages = {309--319},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73007.73036},
doi = {10.1145/73007.73036},
timestamp = {Wed, 24 Nov 2021 12:15:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BerkmanBGSV89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GalilP88,
author = {Zvi Galil and
Victor Y. Pan},
title = {Improved processor bounds for combinatorial problems in {RNC}},
journal = {Comb.},
volume = {8},
number = {2},
pages = {189--200},
year = {1988},
url = {https://doi.org/10.1007/BF02122800},
doi = {10.1007/BF02122800},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GalilP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GalilS88,
author = {Zvi Galil and
Baruch Schieber},
title = {On finding most uniform spanning trees},
journal = {Discret. Appl. Math.},
volume = {20},
number = {2},
pages = {173--175},
year = {1988},
url = {https://doi.org/10.1016/0166-218X(88)90062-5},
doi = {10.1016/0166-218X(88)90062-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GalilS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GalilT88,
author = {Zvi Galil and
{\'{E}}va Tardos},
title = {An O(n{\({^2}\)}(m + n log n)log n) min-cost flow algorithm},
journal = {J. {ACM}},
volume = {35},
number = {2},
pages = {374--386},
year = {1988},
url = {https://doi.org/10.1145/42282.214090},
doi = {10.1145/42282.214090},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GalilT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/GalilG88,
author = {Zvi Galil and
Raffaele Giancarlo},
title = {Data structures and algorithms for approximate string matching},
journal = {J. Complex.},
volume = {4},
number = {1},
pages = {33--72},
year = {1988},
url = {https://doi.org/10.1016/0885-064X(88)90008-8},
doi = {10.1016/0885-064X(88)90008-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/GalilG88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AverbuchGW88,
author = {Amir Averbuch and
Zvi Galil and
Shmuel Winograd},
title = {Classification of All the Minimal Bilinear Algorithms for Computing
the Coefficients of the Product of Two Polynomials Modulo a Polynomial,
Part {I:} The Algeabra G[u] / {\textless} Q(u){\^{}}l {\textgreater},
l {\textgreater} 1},
journal = {Theor. Comput. Sci.},
volume = {58},
pages = {17--56},
year = {1988},
url = {https://doi.org/10.1016/0304-3975(88)90017-5},
doi = {10.1016/0304-3975(88)90017-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AverbuchGW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EppsteinGG88,
author = {David Eppstein and
Zvi Galil and
Raffaele Giancarlo},
title = {Speeding up Dynamic Programming},
booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains,
New York, USA, 24-26 October 1988},
pages = {488--496},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SFCS.1988.21965},
doi = {10.1109/SFCS.1988.21965},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EppsteinGG88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-AmramG88,
author = {Amir M. Ben{-}Amram and
Zvi Galil},
title = {On Pointers versus Addresses (Extended Abstract)},
booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains,
New York, USA, 24-26 October 1988},
pages = {532--538},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SFCS.1988.21969},
doi = {10.1109/SFCS.1988.21969},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-AmramG88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DurisGS87,
author = {Pavol Duris and
Zvi Galil and
Georg Schnitger},
title = {Lower Bounds on Communication Complexity},
journal = {Inf. Comput.},
volume = {73},
number = {1},
pages = {1--22},
year = {1987},
url = {https://doi.org/10.1016/0890-5401(87)90037-X},
doi = {10.1016/0890-5401(87)90037-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/DurisGS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GalilY87,
author = {Zvi Galil and
Moti Yung},
title = {Partitioned Encryption and Achieving Simultaneity by Partitioning},
journal = {Inf. Process. Lett.},
volume = {26},
number = {2},
pages = {81--88},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90042-1},
doi = {10.1016/0020-0190(87)90042-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GalilY87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GalilHLSW87,
author = {Zvi Galil and
Christoph M. Hoffmann and
Eugene M. Luks and
Claus{-}Peter Schnorr and
Andreas Weber},
title = {An O(n{\({^3}\)}log n) deterministic and an O(n{\({^3}\)}) Las Vegs
isomorphism test for trivalent graphs},
journal = {J. {ACM}},
volume = {34},
number = {3},
pages = {513--531},
year = {1987},
url = {https://doi.org/10.1145/28869.28870},
doi = {10.1145/28869.28870},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GalilHLSW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AlonGM87,
author = {Noga Alon and
Zvi Galil and
V. D. Milman},
title = {Better Expanders and Superconcentrators},
journal = {J. Algorithms},
volume = {8},
number = {3},
pages = {337--347},
year = {1987},
url = {https://doi.org/10.1016/0196-6774(87)90014-9},
doi = {10.1016/0196-6774(87)90014-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AlonGM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GalilLY87,
author = {Zvi Galil and
Gad M. Landau and
Mordechai M. Yung},
title = {Distributed Algorithms in Synchronous Broadcasting Networks},
journal = {Theor. Comput. Sci.},
volume = {49},
pages = {171--184},
year = {1987},
url = {https://doi.org/10.1016/0304-3975(87)90006-5},
doi = {10.1016/0304-3975(87)90006-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GalilLY87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GalilG87,
author = {Zvi Galil and
Raffaele Giancarlo},
title = {Parallel String Matching with k Mismatches},
journal = {Theor. Comput. Sci.},
volume = {51},
pages = {341--348},
year = {1987},
url = {https://doi.org/10.1016/0304-3975(87)90042-9},
doi = {10.1016/0304-3975(87)90042-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GalilG87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/GalilHY87,
author = {Zvi Galil and
Stuart Haber and
Moti Yung},
editor = {Carl Pomerance},
title = {Cryptographic Computation: Secure Faut-Tolerant Protocols and the
Public-Key Model},
booktitle = {Advances in Cryptology - {CRYPTO} '87, {A} Conference on the Theory
and Applications of Cryptographic Techniques, Santa Barbara, California,
USA, August 16-20, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {293},
pages = {135--155},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-48184-2\_10},
doi = {10.1007/3-540-48184-2\_10},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/crypto/GalilHY87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DurisG87,
author = {Pavol Duris and
Zvi Galil},
title = {Two Lower Bounds in Asynchronous Distributed Computation (Preliminary
Version)},
booktitle = {28th Annual Symposium on Foundations of Computer Science, Los Angeles,
California, USA, 27-29 October 1987},
pages = {326--330},
publisher = {{IEEE} Computer Society},
year = {1987},
url = {https://doi.org/10.1109/SFCS.1987.60},
doi = {10.1109/SFCS.1987.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DurisG87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GabowGST86,
author = {Harold N. Gabow and
Zvi Galil and
Thomas H. Spencer and
Robert Endre Tarjan},
title = {Efficient algorithms for finding minimum spanning trees in undirected
and directed graphs},
journal = {Comb.},
volume = {6},
number = {2},
pages = {109--122},
year = {1986},
url = {https://doi.org/10.1007/BF02579168},
doi = {10.1007/BF02579168},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GabowGST86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/Galil86,
author = {Zvi Galil},
title = {Efficient Algorithms for Finding Maximum Matching in Graphs},
journal = {{ACM} Comput. Surv.},
volume = {18},
number = {1},
pages = {23--38},
year = {1986},
url = {https://doi.org/10.1145/6462.6502},
doi = {10.1145/6462.6502},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csur/Galil86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilMG86,
author = {Zvi Galil and
Silvio Micali and
Harold N. Gabow},
title = {An {O(EV} log {V)} Algorithm for Finding a Maximal Weighted Matching
in General Graphs},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {1},
pages = {120--130},
year = {1986},
url = {https://doi.org/10.1137/0215009},
doi = {10.1137/0215009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilMG86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/GalilG86,
author = {Zvi Galil and
Raffaele Giancarlo},
title = {Improved string matching with k mismatches},
journal = {{SIGACT} News},
volume = {17},
number = {4},
pages = {52--54},
year = {1986},
url = {https://doi.org/10.1145/8307.8309},
doi = {10.1145/8307.8309},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/GalilG86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalilT86,
author = {Zvi Galil and
{\'{E}}va Tardos},
title = {An O(n{\^{}}2 (m + n log n) log n) Min-Cost Flow Algorithm},
booktitle = {27th Annual Symposium on Foundations of Computer Science, Toronto,
Canada, 27-29 October 1986},
pages = {1--9},
publisher = {{IEEE} Computer Society},
year = {1986},
url = {https://doi.org/10.1109/SFCS.1986.7},
doi = {10.1109/SFCS.1986.7},
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
biburl = {https://dblp.org/rec/conf/focs/GalilT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AverbuchWG86,
author = {Amir Averbuch and
Shmuel Winograd and
Zvi Galil},
editor = {Laurent Kott},
title = {Classification of all the Minimal Bilinear Algorithms for Computing
the Coefficients of the Product of Two Polynomials Modulo a Polynomial},
booktitle = {Automata, Languages and Programming, 13th International Colloquium,
ICALP86, Rennes, France, July 15-19, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {226},
pages = {31--39},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-16761-7\_52},
doi = {10.1007/3-540-16761-7\_52},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AverbuchWG86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GalilKS86,
author = {Zvi Galil and
Ravi Kannan and
Endre Szemer{\'{e}}di},
editor = {Juris Hartmanis},
title = {On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic
One-Tape Turing Machines},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {39--49},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12135},
doi = {10.1145/12130.12135},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GalilKS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Galil85,
author = {Zvi Galil},
title = {Optimal Parallel Algorithms for String Matching},
journal = {Inf. Control.},
volume = {67},
number = {1-3},
pages = {144--157},
year = {1985},
url = {https://doi.org/10.1016/S0019-9958(85)80031-0},
doi = {10.1016/S0019-9958(85)80031-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Galil85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/GalilHY85,
author = {Zvi Galil and
Stuart Haber and
Moti Yung},
editor = {Hugh C. Williams},
title = {Symmetric Public-Key Encryption},
booktitle = {Advances in Cryptology - {CRYPTO} '85, Santa Barbara, California,
USA, August 18-22, 1985, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {218},
pages = {128--137},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/3-540-39799-X\_12},
doi = {10.1007/3-540-39799-X\_12},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/crypto/GalilHY85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalilHY85,
author = {Zvi Galil and
Stuart Haber and
Moti Yung},
title = {A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge
Public-Key Cryptosystems (Extended Abstract)},
booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland,
Oregon, USA, 21-23 October 1985},
pages = {360--371},
publisher = {{IEEE} Computer Society},
year = {1985},
url = {https://doi.org/10.1109/SFCS.1985.1},
doi = {10.1109/SFCS.1985.1},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalilHY85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalilP85,
author = {Zvi Galil and
Victor Y. Pan},
title = {Improved Processor Bounds for Algebraic and Combinatorial Problems
in {RNC}},
booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland,
Oregon, USA, 21-23 October 1985},
pages = {490--495},
publisher = {{IEEE} Computer Society},
year = {1985},
url = {https://doi.org/10.1109/SFCS.1985.33},
doi = {10.1109/SFCS.1985.33},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalilP85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LandauYG85,
author = {Gad M. Landau and
Mordechai M. Yung and
Zvi Galil},
editor = {Wilfried Brauer},
title = {Distributed Algorithms in Synchronous Broadcasting Networks (Extended
Abstract)},
booktitle = {Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece,
July 15-19, 1985, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {194},
pages = {363--372},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/BFb0015762},
doi = {10.1007/BFB0015762},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/LandauYG85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/popl/1985,
editor = {Mary S. Van Deusen and
Zvi Galil and
Brian K. Reid},
title = {Conference Record of the Twelfth Annual {ACM} Symposium on Principles
of Programming Languages, New Orleans, Louisiana, USA, January 1985},
publisher = {{ACM} Press},
year = {1985},
url = {http://dl.acm.org/citation.cfm?id=318593},
isbn = {0-89791-147-4},
timestamp = {Mon, 21 May 2012 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/popl/1985.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DurisGPR84,
author = {Pavol Duris and
Zvi Galil and
Wolfgang J. Paul and
R{\"{u}}diger Reischuk},
title = {Two Nonlinear Lower Bounds for On-Line Computations},
journal = {Inf. Control.},
volume = {60},
number = {1-3},
pages = {1--11},
year = {1984},
url = {https://doi.org/10.1016/S0019-9958(84)80019-4},
doi = {10.1016/S0019-9958(84)80019-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/DurisGPR84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DurisG84,
author = {Pavol Duris and
Zvi Galil},
title = {A Time-Space Tradeoff for Language Recognition},
journal = {Math. Syst. Theory},
volume = {17},
number = {1},
pages = {3--12},
year = {1984},
url = {https://doi.org/10.1007/BF01744430},
doi = {10.1007/BF01744430},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DurisG84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DurisG84,
author = {Pavol Duris and
Zvi Galil},
title = {Two Tapes are Better than One for Nondeterministic Machines},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {2},
pages = {219--227},
year = {1984},
url = {https://doi.org/10.1137/0213016},
doi = {10.1137/0213016},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DurisG84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GabowGS84,
author = {Harold N. Gabow and
Zvi Galil and
Thomas H. Spencer},
title = {Efficient Implementation of Graph Algorithms Using Contraction},
booktitle = {25th Annual Symposium on Foundations of Computer Science, West Palm
Beach, Florida, USA, 24-26 October 1984},
pages = {347--357},
publisher = {{IEEE} Computer Society},
year = {1984},
url = {https://doi.org/10.1109/SFCS.1984.715935},
doi = {10.1109/SFCS.1984.715935},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GabowGS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurisGS84,
author = {Pavol Duris and
Zvi Galil and
Georg Schnitger},
editor = {Richard A. DeMillo},
title = {Lower Bounds on Communication Complexity},
booktitle = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
April 30 - May 2, 1984, Washington, DC, {USA}},
pages = {81--91},
publisher = {{ACM}},
year = {1984},
url = {https://doi.org/10.1145/800057.808668},
doi = {10.1145/800057.808668},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DurisGS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Galil84,
author = {Zvi Galil},
editor = {Richard A. DeMillo},
title = {Optimal Parallel Algorithms for String Matching},
booktitle = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
April 30 - May 2, 1984, Washington, DC, {USA}},
pages = {240--248},
publisher = {{ACM}},
year = {1984},
url = {https://doi.org/10.1145/800057.808687},
doi = {10.1145/800057.808687},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Galil84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GalilP83,
author = {Zvi Galil and
Wolfgang J. Paul},
title = {An Efficient General-Purpose Parallel Computer},
journal = {J. {ACM}},
volume = {30},
number = {2},
pages = {360--387},
year = {1983},
url = {https://doi.org/10.1145/322374.322382},
doi = {10.1145/322374.322382},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GalilP83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/LevenG83,
author = {Daniel Leven and
Zvi Galil},
title = {{NP} Completeness of Finding the Chromatic Index of Regular Graphs},
journal = {J. Algorithms},
volume = {4},
number = {1},
pages = {35--44},
year = {1983},
url = {https://doi.org/10.1016/0196-6774(83)90032-9},
doi = {10.1016/0196-6774(83)90032-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/LevenG83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GalilS83,
author = {Zvi Galil and
Joel I. Seiferas},
title = {Time-Space-Optimal String Matching},
journal = {J. Comput. Syst. Sci.},
volume = {26},
number = {3},
pages = {280--294},
year = {1983},
url = {https://doi.org/10.1016/0022-0000(83)90002-8},
doi = {10.1016/0022-0000(83)90002-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GalilS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caap/Galil83,
author = {Zvi Galil},
editor = {Giorgio Ausiello and
Marco Protasi},
title = {Efficient Algorithms for Finding Maximal Matching in Graphs},
booktitle = {CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila,
Italy, March 9-11, 1983, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {159},
pages = {90--113},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-12727-5\_4},
doi = {10.1007/3-540-12727-5\_4},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/caap/Galil83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurisGPR83,
author = {Pavol Duris and
Zvi Galil and
Wolfgang J. Paul and
R{\"{u}}diger Reischuk},
editor = {David S. Johnson and
Ronald Fagin and
Michael L. Fredman and
David Harel and
Richard M. Karp and
Nancy A. Lynch and
Christos H. Papadimitriou and
Ronald L. Rivest and
Walter L. Ruzzo and
Joel I. Seiferas},
title = {Two Nonlinear Lower Bounds},
booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
25-27 April, 1983, Boston, Massachusetts, {USA}},
pages = {127--132},
publisher = {{ACM}},
year = {1983},
url = {https://doi.org/10.1145/800061.808741},
doi = {10.1145/800061.808741},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DurisGPR83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GalilD82,
author = {Pavol Duris and
Zvi Galil},
title = {On Reversal-Bounded Counter Machines and on Pushdown Automata with
a Bound on the Size of their Pushdown Store},
journal = {Inf. Control.},
volume = {54},
number = {3},
pages = {217--227},
year = {1982},
url = {https://doi.org/10.1016/S0019-9958(82)80023-5},
doi = {10.1016/S0019-9958(82)80023-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GalilD82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GreenbergLPG82,
author = {Albert G. Greenberg and
Richard E. Ladner and
Mike Paterson and
Zvi Galil},
title = {Efficient Parallel Algorithms for Linear Recurrence Computation},
journal = {Inf. Process. Lett.},
volume = {15},
number = {1},
pages = {31--35},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90081-3},
doi = {10.1016/0020-0190(82)90081-3},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/GreenbergLPG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Galil82,
author = {Zvi Galil},
title = {An Almost Linear-Time Algorithm for Computing a Dependency Basis in
a Relational Database},
journal = {J. {ACM}},
volume = {29},
number = {1},
pages = {96--102},
year = {1982},
url = {https://doi.org/10.1145/322290.322296},
doi = {10.1145/322290.322296},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Galil82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DurisG82,
author = {Pavol Duris and
Zvi Galil},
title = {Fooling a two Way Automaton or one Pushdown Store is better than one
Counter for two Way Machines},
journal = {Theor. Comput. Sci.},
volume = {21},
pages = {39--53},
year = {1982},
url = {https://doi.org/10.1016/0304-3975(82)90087-1},
doi = {10.1016/0304-3975(82)90087-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DurisG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalilHLSW82,
author = {Zvi Galil and
Christoph M. Hoffmann and
Eugene M. Luks and
Claus{-}Peter Schnorr and
Andreas Weber},
title = {An O(n{\^{}}3 log n) Deterministic and an O(n{\^{}}3) Probabilistic
Isomorphism Test for Trivalent Graphs},
booktitle = {23rd Annual Symposium on Foundations of Computer Science, Chicago,
Illinois, USA, 3-5 November 1982},
pages = {118--125},
publisher = {{IEEE} Computer Society},
year = {1982},
url = {https://doi.org/10.1109/SFCS.1982.62},
doi = {10.1109/SFCS.1982.62},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalilHLSW82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalilMG82,
author = {Zvi Galil and
Silvio Micali and
Harold N. Gabow},
title = {Priority Queues with Variable Priority and an {O(EV} log {V)} Algorithm
for Finding a Maximal Weighted Matching in General Graphs},
booktitle = {23rd Annual Symposium on Foundations of Computer Science, Chicago,
Illinois, USA, 3-5 November 1982},
pages = {255--261},
publisher = {{IEEE} Computer Society},
year = {1982},
url = {https://doi.org/10.1109/SFCS.1982.36},
doi = {10.1109/SFCS.1982.36},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalilMG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DurisG82,
author = {Pavol Duris and
Zvi Galil},
editor = {Mogens Nielsen and
Erik Meineche Schmidt},
title = {On Reversal-Bounded Counter Machines and on Pushdown Automata with
a Bound on the Size of the Pushdown Store},
booktitle = {Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark,
July 12-16, 1982, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {140},
pages = {166--175},
publisher = {Springer},
year = {1982},
url = {https://doi.org/10.1007/BFb0012766},
doi = {10.1007/BFB0012766},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DurisG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurisG82,
author = {Pavol Duris and
Zvi Galil},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {Two Tapes are Better than One for Nondeterministic Machines},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {1--7},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802171},
doi = {10.1145/800070.802171},
timestamp = {Wed, 14 Nov 2018 10:51:38 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DurisG82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Galil81,
author = {Zvi Galil},
title = {String Matching in Real Time},
journal = {J. {ACM}},
volume = {28},
number = {1},
pages = {134--149},
year = {1981},
url = {https://doi.org/10.1145/322234.322244},
doi = {10.1145/322234.322244},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Galil81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GabberG81,
author = {Ofer Gabber and
Zvi Galil},
title = {Explicit Constructions of Linear-Sized Superconcentrators},
journal = {J. Comput. Syst. Sci.},
volume = {22},
number = {3},
pages = {407--420},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90040-4},
doi = {10.1016/0022-0000(81)90040-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GabberG81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GalilS81,
author = {Zvi Galil and
Joel I. Seiferas},
title = {Linear-Time String-Matching Using only a Fixed Number of Local Storage
Locations},
journal = {Theor. Comput. Sci.},
volume = {13},
pages = {331--336},
year = {1981},
url = {https://doi.org/10.1016/S0304-3975(81)80006-0},
doi = {10.1016/S0304-3975(81)80006-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GalilS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Galil81,
author = {Zvi Galil},
title = {On the Theoretical Efficiency of Various Network Flow Algorithms},
journal = {Theor. Comput. Sci.},
volume = {14},
pages = {103--111},
year = {1981},
url = {https://doi.org/10.1016/0304-3975(81)90008-6},
doi = {10.1016/0304-3975(81)90008-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Galil81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DurisG81,
author = {Pavol Duris and
Zvi Galil},
title = {A Time-Space Tradeoff for Language Recognition},
booktitle = {22nd Annual Symposium on Foundations of Computer Science, Nashville,
Tennessee, USA, 28-30 October 1981},
pages = {53--57},
publisher = {{IEEE} Computer Society},
year = {1981},
url = {https://doi.org/10.1109/SFCS.1981.9},
doi = {10.1109/SFCS.1981.9},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DurisG81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GalilS81,
author = {Zvi Galil and
Joel I. Seiferas},
title = {Time-Space-Optimal String Matching},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {106--113},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802463},
doi = {10.1145/800076.802463},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GalilS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurisG81,
author = {Pavol Duris and
Zvi Galil},
title = {Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One
Counter for Two Way Machines (Preliminary Version)},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {177--188},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802471},
doi = {10.1145/800076.802471},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DurisG81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GalilP81,
author = {Zvi Galil and
Wolfgang J. Paul},
title = {An Efficient General Purpose Parallel Computer},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {247--262},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802478},
doi = {10.1145/800076.802478},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GalilP81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/Galil80,
author = {Zvi Galil},
title = {Applications of Efficient Mergeable Heaps for Optimization Problems
on Trees},
journal = {Acta Informatica},
volume = {13},
pages = {53--58},
year = {1980},
url = {https://doi.org/10.1007/BF00288535},
doi = {10.1007/BF00288535},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/Galil80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/Galil80a,
author = {Zvi Galil},
title = {An \emph{ {O(V5/3} {E2/3)} } Algorithm for the Maximal Flow Problem},
journal = {Acta Informatica},
volume = {14},
pages = {221--242},
year = {1980},
url = {https://doi.org/10.1007/BF00264254},
doi = {10.1007/BF00264254},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/Galil80a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GalilN80,
author = {Zvi Galil and
Amnon Naamad},
title = {An O(EVlog{\({^2}\)}V) Algorithm for the Maximal Flow Problem},
journal = {J. Comput. Syst. Sci.},
volume = {21},
number = {2},
pages = {203--217},
year = {1980},
url = {https://doi.org/10.1016/0022-0000(80)90035-5},
doi = {10.1016/0022-0000(80)90035-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GalilN80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Galil80,
author = {Zvi Galil},
title = {Finding the Vertex Connectivity of Graphs},
journal = {{SIAM} J. Comput.},
volume = {9},
number = {1},
pages = {197--199},
year = {1980},
url = {https://doi.org/10.1137/0209016},
doi = {10.1137/0209016},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Galil80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalilS80,
author = {Zvi Galil and
Joel I. Seiferas},
title = {Saving Space in Fast String-Matching},
journal = {{SIAM} J. Comput.},
volume = {9},
number = {2},
pages = {417--438},
year = {1980},
url = {https://doi.org/10.1137/0209032},
doi = {10.1137/0209032},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalilS80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gi/GalilP80,
author = {Zvi Galil and
Wolfgang J. Paul},
editor = {Reinhard Wilhelm},
title = {Effizienz Paralleler Rechner},
booktitle = {{GI} - 10. Jahrestagung, Saarbr{\"{u}}cken, 30. September - 2.
Oktober 1980, Proceedings},
series = {Informatik-Fachberichte},
volume = {33},
pages = {54--64},
publisher = {Springer},
year = {1980},
url = {https://doi.org/10.1007/978-3-642-67838-7\_4},
doi = {10.1007/978-3-642-67838-7\_4},
timestamp = {Tue, 23 May 2017 01:10:33 +0200},
biburl = {https://dblp.org/rec/conf/gi/GalilP80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Galil80,
author = {Zvi Galil},
editor = {J. W. de Bakker and
Jan van Leeuwen},
title = {An Almost Linaer Time Algorithm for Computing a Dependency Basis in
a Relational Data Base},
booktitle = {Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout,
The Netherlands, July 14-18, 1980, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {85},
pages = {246--256},
publisher = {Springer},
year = {1980},
url = {https://doi.org/10.1007/3-540-10003-2\_75},
doi = {10.1007/3-540-10003-2\_75},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Galil80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/Galil79,
author = {Zvi Galil},
title = {On Improving the Worse Case Running Time of the Boyer-Moore String
Matching Algorithm},
journal = {Commun. {ACM}},
volume = {22},
number = {9},
pages = {505--508},
year = {1979},
url = {https://doi.org/10.1145/359146.359148},
doi = {10.1145/359146.359148},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/Galil79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GalilM79,
author = {Zvi Galil and
Nimrod Megiddo},
title = {A Fast Selection Algorithm and the Problem of Optimum Distribution
of Effort},
journal = {J. {ACM}},
volume = {26},
number = {1},
pages = {58--64},
year = {1979},
url = {https://doi.org/10.1145/322108.322114},
doi = {10.1145/322108.322114},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GalilM79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/MegiddoG79,
author = {Nimrod Megiddo and
Zvi Galil},
title = {On Fulkerson's Conjecture About Consistent Labeling Processes},
journal = {Math. Oper. Res.},
volume = {4},
number = {3},
pages = {265--267},
year = {1979},
url = {https://doi.org/10.1287/moor.4.3.265},
doi = {10.1287/MOOR.4.3.265},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/MegiddoG79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RosenbergWG79,
author = {Arnold L. Rosenberg and
Derick Wood and
Zvi Galil},
title = {Storage Representations for Tree-Like Data Structures},
journal = {Math. Syst. Theory},
volume = {13},
pages = {105--130},
year = {1979},
url = {https://doi.org/10.1007/BF01744292},
doi = {10.1007/BF01744292},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/RosenbergWG79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GabberG79,
author = {Ofer Gabber and
Zvi Galil},
title = {Explicit Constructions of Linear Size Superconcentrators},
booktitle = {20th Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 29-31 October 1979},
pages = {364--370},
publisher = {{IEEE} Computer Society},
year = {1979},
url = {https://doi.org/10.1109/SFCS.1979.16},
doi = {10.1109/SFCS.1979.16},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GabberG79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GalilN79,
author = {Zvi Galil and
Amnon Naamad},
editor = {Michael J. Fischer and
Richard A. DeMillo and
Nancy A. Lynch and
Walter A. Burkhard and
Alfred V. Aho},
title = {Network Flow and Generalized Path Compression},
booktitle = {Proceedings of the 11h Annual {ACM} Symposium on Theory of Computing,
April 30 - May 2, 1979, Atlanta, Georgia, {USA}},
pages = {13--26},
publisher = {{ACM}},
year = {1979},
url = {https://doi.org/10.1145/800135.804394},
doi = {10.1145/800135.804394},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GalilN79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RosenbergWG79,
author = {Arnold L. Rosenberg and
Derick Wood and
Zvi Galil},
editor = {Michael J. Fischer and
Richard A. DeMillo and
Nancy A. Lynch and
Walter A. Burkhard and
Alfred V. Aho},
title = {Storage Representations for Tree-Like Data Structures},
booktitle = {Proceedings of the 11h Annual {ACM} Symposium on Theory of Computing,
April 30 - May 2, 1979, Atlanta, Georgia, {USA}},
pages = {99--107},
publisher = {{ACM}},
year = {1979},
url = {https://doi.org/10.1145/800135.804403},
doi = {10.1145/800135.804403},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RosenbergWG79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GalilS78,
author = {Zvi Galil and
Joel I. Seiferas},
title = {A Linear-Time On-Line Recognition Algorithm for "Palstar"},
journal = {J. {ACM}},
volume = {25},
number = {1},
pages = {102--111},
year = {1978},
url = {https://doi.org/10.1145/322047.322056},
doi = {10.1145/322047.322056},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GalilS78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Galil78,
author = {Zvi Galil},
title = {Palindrome Recognition in Real Time by a Multitape Turing Machine},
journal = {J. Comput. Syst. Sci.},
volume = {16},
number = {2},
pages = {140--157},
year = {1978},
url = {https://doi.org/10.1016/0022-0000(78)90042-9},
doi = {10.1016/0022-0000(78)90042-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Galil78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Galil78,
author = {Zvi Galil},
title = {Killing two birds with one stone},
journal = {{SIGACT} News},
volume = {10},
number = {1},
pages = {22--24},
year = {1978},
url = {https://doi.org/10.1145/1008605.1008607},
doi = {10.1145/1008605.1008607},
timestamp = {Tue, 03 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Galil78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Galil78,
author = {Zvi Galil},
title = {A New Algorithm for the Maximal Flow Problem},
booktitle = {19th Annual Symposium on Foundations of Computer Science, Ann Arbor,
Michigan, USA, 16-18 October 1978},
pages = {231--245},
publisher = {{IEEE} Computer Society},
year = {1978},
url = {https://doi.org/10.1109/SFCS.1978.5},
doi = {10.1109/SFCS.1978.5},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Galil78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Galil78,
author = {Zvi Galil},
editor = {Giorgio Ausiello and
Corrado B{\"{o}}hm},
title = {On Improving the Worst Case Running Time of the Boyer-Moore String
Matching Algorithm},
booktitle = {Automata, Languages and Programming, Fifth Colloquium, Udine, Italy,
July 17-21, 1978, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {62},
pages = {241--250},
publisher = {Springer},
year = {1978},
url = {https://doi.org/10.1007/3-540-08860-1\_18},
doi = {10.1007/3-540-08860-1\_18},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Galil78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Galil77,
author = {Zvi Galil},
title = {Some Open Problems in the Theory of Computation as Questions about
Two-Way Deterministic Pushdown Automaton Languages},
journal = {Math. Syst. Theory},
volume = {10},
pages = {211--228},
year = {1977},
url = {https://doi.org/10.1007/BF01683273},
doi = {10.1007/BF01683273},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Galil77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/SeiferasG77,
author = {Joel I. Seiferas and
Zvi Galil},
title = {Real-Time Recognition of Substring Repetition and Reversal},
journal = {Math. Syst. Theory},
volume = {11},
pages = {111--146},
year = {1977},
url = {https://doi.org/10.1007/BF01768472},
doi = {10.1007/BF01768472},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/SeiferasG77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Galil77,
author = {Zvi Galil},
title = {On Resolution with Clauses of Bounded Size},
journal = {{SIAM} J. Comput.},
volume = {6},
number = {3},
pages = {444--459},
year = {1977},
url = {https://doi.org/10.1137/0206031},
doi = {10.1137/0206031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Galil77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Galil77,
author = {Zvi Galil},
title = {On the Complexity of Regular Resolution and the Davis-Putnam Procedure},
journal = {Theor. Comput. Sci.},
volume = {4},
number = {1},
pages = {23--46},
year = {1977},
url = {https://doi.org/10.1016/0304-3975(77)90054-8},
doi = {10.1016/0304-3975(77)90054-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Galil77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GalilM77,
author = {Zvi Galil and
Nimrod Megiddo},
title = {Cyclic Ordering is NP-Complete},
journal = {Theor. Comput. Sci.},
volume = {5},
number = {2},
pages = {179--182},
year = {1977},
url = {https://doi.org/10.1016/0304-3975(77)90005-6},
doi = {10.1016/0304-3975(77)90005-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GalilM77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalilS77,
author = {Zvi Galil and
Joel I. Seiferas},
title = {Saving Space in Fast String-Matching},
booktitle = {18th Annual Symposium on Foundations of Computer Science, Providence,
Rhode Island, USA, 31 October - 1 November 1977},
pages = {179--188},
publisher = {{IEEE} Computer Society},
year = {1977},
url = {https://doi.org/10.1109/SFCS.1977.27},
doi = {10.1109/SFCS.1977.27},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalilS77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/Galil76,
author = {Zvi Galil},
title = {Hierarchies of Complete Problems},
journal = {Acta Informatica},
volume = {6},
pages = {77--88},
year = {1976},
url = {https://doi.org/10.1007/BF00263744},
doi = {10.1007/BF00263744},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/Galil76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computing/MehlhornG76,
author = {Kurt Mehlhorn and
Zvi Galil},
title = {Monotone switching circuits and boolean matrix product},
journal = {Computing},
volume = {16},
number = {1-2},
pages = {99--111},
year = {1976},
url = {https://doi.org/10.1007/BF02241983},
doi = {10.1007/BF02241983},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computing/MehlhornG76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Galil76,
author = {Zvi Galil},
title = {Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition
Algorithms},
journal = {Inf. Process. Lett.},
volume = {4},
number = {4},
pages = {85--87},
year = {1976},
url = {https://doi.org/10.1016/0020-0190(76)90050-8},
doi = {10.1016/0020-0190(76)90050-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Galil76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GalilS76,
author = {Zvi Galil and
Janos Simon},
title = {A Note on Multiple-Entry Finite Automata},
journal = {J. Comput. Syst. Sci.},
volume = {12},
number = {3},
pages = {350--351},
year = {1976},
url = {https://doi.org/10.1016/S0022-0000(76)80006-2},
doi = {10.1016/S0022-0000(76)80006-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GalilS76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalilS76,
author = {Zvi Galil and
Joel I. Seiferas},
title = {Recognizing Certain Repetitions and Reversals Within Strings},
booktitle = {17th Annual Symposium on Foundations of Computer Science, Houston,
Texas, USA, 25-27 October 1976},
pages = {236--252},
publisher = {{IEEE} Computer Society},
year = {1976},
url = {https://doi.org/10.1109/SFCS.1976.25},
doi = {10.1109/SFCS.1976.25},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalilS76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Galil76,
author = {Zvi Galil},
editor = {S. Michaelson and
Robin Milner},
title = {On Enumeration Procedures for Theorem Proving and for Integer Programming},
booktitle = {Third International Colloquium on Automata, Languages and Programming,
University of Edinburgh, UK, July 20-23, 1976},
pages = {355--381},
publisher = {Edinburgh University Press},
year = {1976},
timestamp = {Mon, 08 Jul 2019 10:58:24 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Galil76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Galil76,
author = {Zvi Galil},
editor = {Ashok K. Chandra and
Detlef Wotschke and
Emily P. Friedman and
Michael A. Harrison},
title = {Real-Time Algorithms for String-Matching and Palindrome Recognition},
booktitle = {Proceedings of the 8th Annual {ACM} Symposium on Theory of Computing,
May 3-5, 1976, Hershey, Pennsylvania, {USA}},
pages = {161--173},
publisher = {{ACM}},
year = {1976},
url = {https://doi.org/10.1145/800113.803644},
doi = {10.1145/800113.803644},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Galil76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Galil75,
author = {Zvi Galil},
title = {The Complexity of Resolution Procedures for Theorem Proving in the
Propositional Calculus},
school = {Cornell University, {USA}},
year = {1975},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Galil75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Galil75,
author = {Zvi Galil},
title = {Functional Schemas with Nested Predicates},
journal = {Inf. Control.},
volume = {27},
number = {4},
pages = {349--368},
year = {1975},
url = {https://doi.org/10.1016/S0019-9958(75)90175-8},
doi = {10.1016/S0019-9958(75)90175-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Galil75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Galil75,
author = {Zvi Galil},
title = {On converting on-line algorithms into real-time and on real-time algorithms
for string-matching and palindrome recognition},
journal = {{SIGACT} News},
volume = {7},
number = {4},
pages = {26--30},
year = {1975},
url = {https://doi.org/10.1145/990502.990505},
doi = {10.1145/990502.990505},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Galil75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MehlhornG75,
author = {Kurt Mehlhorn and
Zvi Galil},
editor = {Jir{\'{\i}} Becv{\'{a}}r},
title = {Monotone Switching Circuits and Boolean Matrix Product},
booktitle = {Mathematical Foundations of Computer Science 1975, 4th Symposium,
Mari{\'{a}}nsk{\'{e}} L{\'{a}}zne, Czechoslovakia,
September 1-5, 1975, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {32},
pages = {315--319},
publisher = {Springer},
year = {1975},
url = {https://doi.org/10.1007/3-540-07389-2\_214},
doi = {10.1007/3-540-07389-2\_214},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MehlhornG75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Galil75,
author = {Zvi Galil},
editor = {William C. Rounds and
Nancy Martin and
Jack W. Carlyle and
Michael A. Harrison},
title = {On the Validity and Complexity of Bounded Resolution},
booktitle = {Proceedings of the 7th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1975, Albuquerque, New Mexico, {USA}},
pages = {72--82},
publisher = {{ACM}},
year = {1975},
url = {https://doi.org/10.1145/800116.803755},
doi = {10.1145/800116.803755},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Galil75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Galil74,
author = {Zvi Galil},
title = {On some direct encodings of nondeterministic Turing machines operating
in polynomial time into p-complete problems},
journal = {{SIGACT} News},
volume = {6},
number = {1},
pages = {19--24},
year = {1974},
url = {https://doi.org/10.1145/1811129.1811131},
doi = {10.1145/1811129.1811131},
timestamp = {Wed, 04 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Galil74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Galil74,
author = {Zvi Galil},
title = {Two Way Deterministic Pushdown Automaton Languages and Some Open Problems
in the Theory of Computation},
booktitle = {15th Annual Symposium on Switching and Automata Theory, New Orleans,
Louisiana, USA, October 14-16, 1974},
pages = {170--177},
publisher = {{IEEE} Computer Society},
year = {1974},
url = {https://doi.org/10.1109/SWAT.1974.29},
doi = {10.1109/SWAT.1974.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Galil74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 02:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
