Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Zbl 0608.05027
Gabow, H. N.; Galil, Z.; Spencer, T.; Tarjan, R. E. |
|
1986
|
Explicit constructions of linear-sized superconcentrators. Zbl 0487.05045
Gabber, Ofer; Galil, Zvi |
|
1981
|
NP-completeness of finding the chromatic index of regular graphs. Zbl 0509.68037
Leven, Daniel; Galil, Zvi |
|
1983
|
Sparsification – a technique for speeding up dynamic graph algorithms. Zbl 0891.68072
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Nissenzweig, Amnon |
|
1997
|
D-optimum weighing designs. Zbl 0466.62066
Galil, Z.; Kiefer, J. |
|
1980
|
Time-space-optimal string matching. Zbl 0509.68101
Galil, Zvi; Seiferas, Joel |
|
1983
|
On the exponent of all pairs shortest path problem. Zbl 0877.68090
Alon, Noga; Galil, Zvi; Margalit, Oded |
|
1997
|
Efficient algorithms for finding maximum matching in graphs. Zbl 0606.68064
Galil, Zvi |
|
1986
|
Pattern matching algorithms. Zbl 0874.68006
|
|
1997
|
An improved algorithm for approximate string matching. Zbl 0711.68048
Galil, Zvi; Park, Kunsoo |
|
1990
|
Improved string matching with k mismatches. Zbl 0608.68058
Galil, Zvi; Giancarlo, Raffaele |
|
1985
|
Data structures and algorithms for approximate string matching. Zbl 0646.68078
Galil, Z.; Giancarlo, R. |
|
1988
|
Construction methods for D-optimum weighing designs when n=3(mod 4). Zbl 0489.62068
Galil, Z.; Kiefer, J. |
|
1982
|
On the complexity of regular resolution and the Davis-Putnam procedure. Zbl 0385.68048
Galil, Zvi |
|
1977
|
Sparsification – a technique for speeding up dynamic graph algorithms. (Extended abstract). Zbl 0977.68560
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Nissenzweig, Amnon |
|
1992
|
Resolving message complexity of Byzantine agreement and beyond. Zbl 0938.68658
Galil, Zvi; Mayer, Alain; Yung, Moti |
|
1995
|
Witnesses for Boolean matrix multiplication and for shortest paths. Zbl 0977.68562
Alon, Noga; Galil, Zvi; Margalit, Oded; Naor, Moni |
|
1992
|
Better expanders and superconcentrators. Zbl 0641.68102
Alon, N.; Galil, Z.; Milman, V. D. |
|
1987
|
Parallel detection of all palindromes in a string. Zbl 0873.68039
Apostolico, Alberto; Breslauer, Dany; Galil, Zvi |
|
1995
|
Optimal parallel algorithms for string matching. Zbl 0588.68022
Galil, Zvi |
|
1985
|
Comparison of rotatable designs for regression on balls. I. (quadratic). Zbl 0394.62058
Galil, Z.; Kiefer, J. |
|
1977
|
Sparse dynamic programming I: Linear cost functions. Zbl 0807.90120
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F. |
|
1992
|
On O(EV log V) algorithm for finding a maximal weighted matching in general graphs. Zbl 0589.68050
Galil, Zvi; Micali, Silvio; Gabow, Harold |
|
1986
|
An almost linear-time algorithm for computing a dependency basis in a relational database. Zbl 0485.68090
Galil, Zvi |
|
1982
|
Comparison of simplex designs for quadratic mixture models. Zbl 0372.62058
Galil, Z.; Kiefer, J. |
|
1977
|
Truly alphabet-independent two-dimensional pattern matching. Zbl 0942.68707
Galil, Zvi; Park, Kunsoo |
|
1992
|
Monotone switching circuits and Boolean matrix product. Zbl 0323.94019
Mehlhorn, K.; Galil, Z. |
|
1976
|
A linear-time algorithm for concave one-dimensional dynamic programming. Zbl 0694.68032
Galil, Zvi; Park, Kunsoo |
|
1990
|
Dynamic dictionary matching. Zbl 0942.68783
Amir, Amihood; Farach, Martin; Galil, Zvi; Giancarlo, Raffaele; Park, Kunsoo |
|
1994
|
Cyclic ordering is NP-complete. Zbl 0383.68045
Galil, Zvi; Megiddo, Nimrod |
|
1978
|
Lower bounds on communication complexity. Zbl 0635.68034
Duris, Pavol; Galil, Zvi; Schnitger, Georg |
|
1987
|
All pairs shortest distances for graphs with small integer length edges. Zbl 0879.68081
Galil, Zvi; Margalit, Oded |
|
1997
|
Finding the vertex connectivity of graphs. Zbl 0446.68053
Galil, Zvi |
|
1980
|
Hierarchies of complete problems. Zbl 0304.68044
Galil, Zvi |
|
1976
|
Speeding up dynamic programming with applications to molecular biology. Zbl 0673.90090
Galil, Zvi; Giancarlo, Raffaele |
|
1989
|
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. Zbl 1133.68469
Franklin, Matthew; Galil, Zvi; Yung, Moti |
|
2000
|
Finding all periods and initial palindromes of a string in parallel. Zbl 0833.68053
Breslauer, D.; Galil, Z. |
|
1995
|
On improving the worst case running time of the Boyer-Moore string matching algorithm. Zbl 0413.68041
Galil, Zvi |
|
1979
|
Separator based sparsification. I: Planarity testing and minimum spanning trees. Zbl 0846.68079
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Spencer, Thomas H. |
|
1996
|
Comparison of design for quadratic regression of cubes. Zbl 0381.62062
Galil, Z.; Kiefer, J. |
|
1977
|
Separator based sparsification for dynamic planar graph algorithms. Zbl 1310.05197
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Spencer, Thomas H. |
|
1993
|
An optimal O(log log n) time parallel string matching algorithm. Zbl 0711.68057
Breslauer, Dany; Galil, Zvi |
|
1990
|
On finding most uniform spanning trees. Zbl 0645.05035
Galil, Zvi; Schieber, Baruch |
|
1988
|
An \(O(EV\log^2V)\) algorithm for the maximal flow problem. Zbl 0449.90094
Galil, Zvi; Naamad, Amnon |
|
1980
|
A linear-time on-line recognition algorithm for ”palstar”. Zbl 0365.68058
Galil, Zvi; Seiferas, Joel |
|
1978
|
Fooling a two way automaton or one pushdown store is better than one counter for two way machines. Zbl 0486.68084
Duris, Pavol; Galil, Zvi |
|
1982
|
A fast selection algorithm and the problem of optimum distribution of effort. Zbl 0404.90062
Galil, Zvi; Megiddo, Nimrod |
|
1979
|
Real-time streaming string-matching. Zbl 1339.68324
Breslauer, Dany; Galil, Zvi |
|
2011
|
All pairs shortest paths for graphs with small integer length edges. Zbl 0877.68089
Galil, Zvi; Margalit, Oded |
|
1997
|
String matching in real time. Zbl 0454.68009
Galil, Zvi |
|
1981
|
Time- and space-saving computer methods, related to Mitchell’s DETMAX, for finding D-optimum designs. Zbl 0459.62060
Galil, Z.; Kiefer, J. |
|
1980
|
Improved processor bounds for combinatorial problems in RNC. Zbl 0685.68048
Galil, Z.; Pan, V. |
|
1988
|
A lower bound for parallel string matching. Zbl 0756.68048
Breslauer, Dany; Galil, Zvi |
|
1992
|
Open problems in stringology. Zbl 0607.68054
Galil, Zvi |
|
1985
|
Alphabet-independent two-dimensional witness computation. Zbl 0861.68032
Galil, Zvi; Park, Kunsoo |
|
1996
|
Some open problems in the theory of computation as questions about two- way deterministic pushdown automaton languages. Zbl 0356.68064
Galil, Zvi |
|
1977
|
Extrapolation designs and \(\Phi_p\)-optimum designs for cubic regression on the \(q\)-ball. Zbl 0412.62055
Galil, Z.; Kiefer, J. |
|
1979
|
An O(n \(2(m+n\,\log \,n)\log \,n)\) min-cost flow algorithm. Zbl 0652.90039
Galil, Zvi; Tardos, Éva |
|
1988
|
Sparse dynamic programming. II: Convex and concave cost functions. Zbl 0816.90130
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F. |
|
1992
|
Separator-based sparsification. II: Edge and vertex connectivity. Zbl 0914.68042
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Spencer, Thomas H. |
|
1998
|
On the exact complexity of string matching: Upper bounds. Zbl 0761.68046
Galil, Zvi; Giancarlo, Raffaele |
|
1992
|
An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem. Zbl 0456.68044
Galil, Zvi |
|
1980
|
Optimum weighing designs. Zbl 0462.62059
Kiefer, J.; Galil, Z. |
|
1980
|
On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store. Zbl 0523.68037
Duris, Pavol; Galil, Zvi |
|
1982
|
Fully dynamic planarity testing with applications. Zbl 1064.05502
Galil, Zvi; Italiano, Giuseppe F.; Sarnak, Neil |
|
1999
|
A time-space tradeoff for language recognition. Zbl 0533.68047
Dúriś, Pavol; Galil, Zvi |
|
1984
|
Real-time streaming string-matching. Zbl 1398.68701
Breslauer, Dany; Galil, Zvi |
|
2014
|
Dynamic programming with convexity, concavity and sparsity. Zbl 0763.90088
Galil, Zvi; Park, Kunsoo |
|
1992
|
Optimal parallel algorithms for periods, palindromes and squares (extended abstract). Zbl 1425.68466
Apostolico, Alberto; Breslauer, Dany; Galil, Zvi |
|
1992
|
Faster tree pattern matching. Zbl 0806.68055
Dubiner, Moshe; Galil, Zvi; Magen, Edith |
|
1994
|
Combinatorial algorithms on words. (Proceedings of the NATO Advanced Research Workshop on Combinatorial Algorithms on Words held at Maratea, Italy, June 18-22, 1984). Zbl 0564.00027
|
|
1985
|
Saving space in fast string-matching. Zbl 0446.68041
Galil, Zvi; Seiferas, Joel |
|
1980
|
Maintaining the 3-edge-connected components of a graph on-line. Zbl 0767.68080
Galil, Zvi; Italiano, Giuseppe F. |
|
1993
|
Parallel string matching with k mismatches. Zbl 0636.68084
Galil, Zvi; Giancarlo, Raffaele |
|
1987
|
On pointers versus addresses. Zbl 0799.68114
Ben-Amram, Amir M.; Galil, Zvi |
|
1992
|
Real-time algorithms for string-matching and palindrome recognition. Zbl 0365.68032
Galil, Zvi |
|
1976
|
Palindrome recognition in real time by a multitape Turing machine. Zbl 0386.03020
Galil, Zvi |
|
1978
|
Maintaining biconnected components of dynamic planar graphs. Zbl 0764.68117
Galil, Zvi; Italiano, Giuseppe F. |
|
1991
|
Two fast simulations which imply some fast string matching and palindrome-recognition algorithms. Zbl 0328.68047
Galil, Zvi |
|
1976
|
An almost linear-time algorithm for the dense subset-sum problem. Zbl 0736.68041
Galil, Zvi; Margalit, Oded |
|
1991
|
An improved algorithm for approximate string matching. Zbl 0683.68034
Galil, Zvi; Park, Kunsoo |
|
1989
|
Minimum-knowledge interactive proofs for decision problems. Zbl 0678.94007
Galil, Zvi; Haber, Stuart; Yung, Moti |
|
1989
|
Solving dense subset-sum problems by using analytical number theory. Zbl 0686.68030
Chaimovich, Mark; Freiman, Gregory; Galil, Zvi |
|
1989
|
Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency. Zbl 0820.90122
Galil, Zvi; Park, Kunsoo |
|
1994
|
On the power of the shift instruction. Zbl 0828.68074
Ben-Amram, Amir M.; Galil, Zvi |
|
1995
|
Sparse dynamic programming. Zbl 0785.90094
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F. |
|
1990
|
Witnesses for Boolean matrix multiplication and for transitive closure. Zbl 0785.65053
Galil, Zvi; Margalit, Olded |
|
1993
|
On resolution with clauses of bounded size. Zbl 0368.68085
Galil, Zvi |
|
1977
|
Short length versions of Menger’s theorem. (Extended abstract). Zbl 0978.68557
Galil, Zvi; Yu, Xiangdong |
|
1995
|
Efficient parallel algorithms for linear recurrence computation. Zbl 0487.68028
Greenberg, Albert C.; Ladner, Richard E.; Paterson, Michael S.; Galil, Zvi |
|
1982
|
Parallel evaluation of the determinant and of the inverse of a matrix. Zbl 0664.68040
Galil, Zvi; Pan, Victor |
|
1989
|
On the exact complexity of string matching: Lower bounds. Zbl 0738.68042
Galil, Zvi; Giancarlo, Raffaele |
|
1991
|
On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines. Zbl 0676.68019
Galil, Zvi; Kannan, Ravi; Szemerédi, Endre |
|
1989
|
An efficient general-purpose parallel computer. Zbl 0515.68022
Galil, Zvi; Paul, Wolfgang J. |
|
1983
|
Fully dynamic algorithms for 2-edge connectivity. Zbl 0760.68022
Galil, Zvi; Italiano, Giuseppe F. |
|
1992
|
On 3-pushdown graphs with large separators. Zbl 0726.05042
Galil, Z.; Kannan, R.; Szemerédi, E. |
|
1989
|
Two tapes are better than one for nondeterministic machines. Zbl 0558.68045
Dúriś, Pavol; Galil, Zvi |
|
1984
|
Two nonlinear lower bounds for on-line computations. Zbl 0589.68039
Ďuriš, Pavol; Galil, Zvi; Paul, Wolfgang; Reischuk, Ruediger |
|
1984
|
Comparison of Box-Draper and d-optimum designs for experiments with mixtures. Zbl 0369.62087
Galil, Z.; Kiefer, J. |
|
1977
|
Comparison of designs equivalent under one or two criteria. Zbl 0533.62063
Galil, Z.; Kiefer, J. |
|
1983
|
Real-time streaming string-matching. Zbl 1398.68701
Breslauer, Dany; Galil, Zvi |
|
2014
|
Forty years of text indexing. Zbl 1381.68067
Apostolico, Alberto; Crochemore, Maxime; Farach-Colton, Martin; Galil, Zvi; Muthukrishnan, S. |
|
2013
|
Real-time streaming string-matching. Zbl 1339.68324
Breslauer, Dany; Galil, Zvi |
|
2011
|
Three-dimensional periodicity and its application to pattern matching. Zbl 1087.68080
Galil, Zvi; Park, Jong Geun; Park, Kunsoo |
|
2004
|
Lower bounds for dynamic data structures on algebraic RAMs. Zbl 1050.68025
Ben-Amram, A. M.; Galil, Z. |
|
2002
|
A generalization of a lower bound technique due to Fredman and Saks. Zbl 0992.68034
Ben-Amram, A. M.; Galil, Z. |
|
2001
|
Topological lower bounds on algebraic random access machines. Zbl 1017.68057
Ben-Amram, Amir M.; Galil, Zvi |
|
2001
|
Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. Zbl 1133.68469
Franklin, Matthew; Galil, Zvi; Yung, Moti |
|
2000
|
Fully dynamic planarity testing with applications. Zbl 1064.05502
Galil, Zvi; Italiano, Giuseppe F.; Sarnak, Neil |
|
1999
|
Separator-based sparsification. II: Edge and vertex connectivity. Zbl 0914.68042
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Spencer, Thomas H. |
|
1998
|
Sparsification – a technique for speeding up dynamic graph algorithms. Zbl 0891.68072
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Nissenzweig, Amnon |
|
1997
|
On the exponent of all pairs shortest path problem. Zbl 0877.68090
Alon, Noga; Galil, Zvi; Margalit, Oded |
|
1997
|
Pattern matching algorithms. Zbl 0874.68006
|
|
1997
|
All pairs shortest distances for graphs with small integer length edges. Zbl 0879.68081
Galil, Zvi; Margalit, Oded |
|
1997
|
All pairs shortest paths for graphs with small integer length edges. Zbl 0877.68089
Galil, Zvi; Margalit, Oded |
|
1997
|
Constant-time randomized parallel string matching. Zbl 0885.68078
Crochemore, Maxime; Galil, Zvi; Gasieniec, Leszek; Park, Kunsoo; Rytter, Wojciech |
|
1997
|
Separator based sparsification. I: Planarity testing and minimum spanning trees. Zbl 0846.68079
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Spencer, Thomas H. |
|
1996
|
Alphabet-independent two-dimensional witness computation. Zbl 0861.68032
Galil, Zvi; Park, Kunsoo |
|
1996
|
Resolving message complexity of Byzantine agreement and beyond. Zbl 0938.68658
Galil, Zvi; Mayer, Alain; Yung, Moti |
|
1995
|
Parallel detection of all palindromes in a string. Zbl 0873.68039
Apostolico, Alberto; Breslauer, Dany; Galil, Zvi |
|
1995
|
Finding all periods and initial palindromes of a string in parallel. Zbl 0833.68053
Breslauer, D.; Galil, Z. |
|
1995
|
On the power of the shift instruction. Zbl 0828.68074
Ben-Amram, Amir M.; Galil, Zvi |
|
1995
|
Short length versions of Menger’s theorem. (Extended abstract). Zbl 0978.68557
Galil, Zvi; Yu, Xiangdong |
|
1995
|
Work-time-optimal parallel algorithms for string problems. (Extended abstract). Zbl 0978.68531
Czumaj, Artur; Galil, Zvi; Gąsieniec, Leszek; Park, Kunsoo; Plandowski, Wojciech |
|
1995
|
A constant-time optimal parallel string-matching algorithm. Zbl 0885.68082
Galil, Zvi |
|
1995
|
Sensing versus nonsensing automata. Zbl 1412.68127
Ďuriš, Pavol; Galil, Zvi |
|
1995
|
Lower bounds on algebraic random access machines. Zbl 1412.68057
Ben-Amram, Amir M.; Galil, Zvi |
|
1995
|
Dynamic dictionary matching. Zbl 0942.68783
Amir, Amihood; Farach, Martin; Galil, Zvi; Giancarlo, Raffaele; Park, Kunsoo |
|
1994
|
Faster tree pattern matching. Zbl 0806.68055
Dubiner, Moshe; Galil, Zvi; Magen, Edith |
|
1994
|
Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency. Zbl 0820.90122
Galil, Zvi; Park, Kunsoo |
|
1994
|
Parallel detection of all palindromes in a string. Zbl 0941.68825
Apostolico, Alberto; Breslauer, Dany; Galil, Zvi |
|
1994
|
Separator based sparsification for dynamic planar graph algorithms. Zbl 1310.05197
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Spencer, Thomas H. |
|
1993
|
Maintaining the 3-edge-connected components of a graph on-line. Zbl 0767.68080
Galil, Zvi; Italiano, Giuseppe F. |
|
1993
|
Witnesses for Boolean matrix multiplication and for transitive closure. Zbl 0785.65053
Galil, Zvi; Margalit, Olded |
|
1993
|
Efficient comparison based string matching. Zbl 0783.68052
Breslauer, Dany; Galil, Zvi |
|
1993
|
On the power of multiple reads in a chip. Zbl 0783.68061
Ďuriš, Pavol; Galil, Zvi |
|
1993
|
Sparsification – a technique for speeding up dynamic graph algorithms. (Extended abstract). Zbl 0977.68560
Eppstein, David; Galil, Zvi; Italiano, Giuseppe F.; Nissenzweig, Amnon |
|
1992
|
Witnesses for Boolean matrix multiplication and for shortest paths. Zbl 0977.68562
Alon, Noga; Galil, Zvi; Margalit, Oded; Naor, Moni |
|
1992
|
Sparse dynamic programming I: Linear cost functions. Zbl 0807.90120
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F. |
|
1992
|
Truly alphabet-independent two-dimensional pattern matching. Zbl 0942.68707
Galil, Zvi; Park, Kunsoo |
|
1992
|
A lower bound for parallel string matching. Zbl 0756.68048
Breslauer, Dany; Galil, Zvi |
|
1992
|
Sparse dynamic programming. II: Convex and concave cost functions. Zbl 0816.90130
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F. |
|
1992
|
On the exact complexity of string matching: Upper bounds. Zbl 0761.68046
Galil, Zvi; Giancarlo, Raffaele |
|
1992
|
Dynamic programming with convexity, concavity and sparsity. Zbl 0763.90088
Galil, Zvi; Park, Kunsoo |
|
1992
|
Optimal parallel algorithms for periods, palindromes and squares (extended abstract). Zbl 1425.68466
Apostolico, Alberto; Breslauer, Dany; Galil, Zvi |
|
1992
|
On pointers versus addresses. Zbl 0799.68114
Ben-Amram, Amir M.; Galil, Zvi |
|
1992
|
Fully dynamic algorithms for 2-edge connectivity. Zbl 0760.68022
Galil, Zvi; Italiano, Giuseppe F. |
|
1992
|
On the space complexity of some algorithms for sequence comparison. Zbl 0745.68060
Rabani, Yuval; Galil, Zvi |
|
1992
|
Combinatorial pattern matching. 3rd annual symposium, Tucson, AZ, USA, April 29 – May 1, 1992. Proceedings. Zbl 0825.00058
|
|
1992
|
Maintaining biconnected components of dynamic planar graphs. Zbl 0764.68117
Galil, Zvi; Italiano, Giuseppe F. |
|
1991
|
An almost linear-time algorithm for the dense subset-sum problem. Zbl 0736.68041
Galil, Zvi; Margalit, Oded |
|
1991
|
On the exact complexity of string matching: Lower bounds. Zbl 0738.68042
Galil, Zvi; Giancarlo, Raffaele |
|
1991
|
Two lower bounds in asynchronous distributed computation. Zbl 0731.68043
Duris, Pavol; Galil, Zvi |
|
1991
|
A note on set union with arbitrary deunions. Zbl 0714.68039
Galil, Zvi; Italiano, Giuseppe F. |
|
1991
|
An almost linear-time algorithm for the dense subset-sum problem. Zbl 0769.68043
Galil, Zvi; Margalit, Oded |
|
1991
|
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u]/\langle{} u^ n \rangle\). Zbl 0744.68071
Averbuch, Amir; Galil, Zvi; Winograd, Shmuel |
|
1991
|
An improved algorithm for approximate string matching. Zbl 0711.68048
Galil, Zvi; Park, Kunsoo |
|
1990
|
A linear-time algorithm for concave one-dimensional dynamic programming. Zbl 0694.68032
Galil, Zvi; Park, Kunsoo |
|
1990
|
An optimal O(log log n) time parallel string matching algorithm. Zbl 0711.68057
Breslauer, Dany; Galil, Zvi |
|
1990
|
Sparse dynamic programming. Zbl 0785.90094
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele; Italiano, Giuseppe F. |
|
1990
|
Efficient algorithms with applications to molecular biology. Zbl 0687.68024
Eppstein, David; Galil, Zvi; Giancarlo, Raffaele |
|
1990
|
Speeding up dynamic programming with applications to molecular biology. Zbl 0673.90090
Galil, Zvi; Giancarlo, Raffaele |
|
1989
|
An improved algorithm for approximate string matching. Zbl 0683.68034
Galil, Zvi; Park, Kunsoo |
|
1989
|
Minimum-knowledge interactive proofs for decision problems. Zbl 0678.94007
Galil, Zvi; Haber, Stuart; Yung, Moti |
|
1989
|
Solving dense subset-sum problems by using analytical number theory. Zbl 0686.68030
Chaimovich, Mark; Freiman, Gregory; Galil, Zvi |
|
1989
|
Parallel evaluation of the determinant and of the inverse of a matrix. Zbl 0664.68040
Galil, Zvi; Pan, Victor |
|
1989
|
On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines. Zbl 0676.68019
Galil, Zvi; Kannan, Ravi; Szemerédi, Endre |
|
1989
|
On 3-pushdown graphs with large separators. Zbl 0726.05042
Galil, Z.; Kannan, R.; Szemerédi, E. |
|
1989
|
Parallel algorithmic techniques for combinatorial computation. Zbl 0691.68037
Eppstein, David; Galil, Zvi |
|
1989
|
Data structures and algorithms for approximate string matching. Zbl 0646.68078
Galil, Z.; Giancarlo, R. |
|
1988
|
On finding most uniform spanning trees. Zbl 0645.05035
Galil, Zvi; Schieber, Baruch |
|
1988
|
Improved processor bounds for combinatorial problems in RNC. Zbl 0685.68048
Galil, Z.; Pan, V. |
|
1988
|
An O(n \(2(m+n\,\log \,n)\log \,n)\) min-cost flow algorithm. Zbl 0652.90039
Galil, Zvi; Tardos, Éva |
|
1988
|
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u]/<Q(u)^{\ell}>\), \(\ell >1\). Zbl 0656.68040
Averbuch, Amir; Galil, Zvi; Winograd, Shmuel |
|
1988
|
Better expanders and superconcentrators. Zbl 0641.68102
Alon, N.; Galil, Z.; Milman, V. D. |
|
1987
|
Lower bounds on communication complexity. Zbl 0635.68034
Duris, Pavol; Galil, Zvi; Schnitger, Georg |
|
1987
|
Parallel string matching with k mismatches. Zbl 0636.68084
Galil, Zvi; Giancarlo, Raffaele |
|
1987
|
Partitioned encryption and achieving simultaneity by partitioning. Zbl 0637.94015
Galil, Zvi; Yung, Moti |
|
1987
|
Distributed algorithms in synchronous broadcasting networks. Zbl 0612.68007
Galil, Zvi; Landau, Gad M.; Yung, Mordechai M. |
|
1987
|
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Zbl 0608.05027
Gabow, H. N.; Galil, Z.; Spencer, T.; Tarjan, R. E. |
|
1986
|
Efficient algorithms for finding maximum matching in graphs. Zbl 0606.68064
Galil, Zvi |
|
1986
|
On O(EV log V) algorithm for finding a maximal weighted matching in general graphs. Zbl 0589.68050
Galil, Zvi; Micali, Silvio; Gabow, Harold |
|
1986
|
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. Zbl 0636.68035
Averbuch, Amir; Winograd, Shmuel; Galil, Zvi |
|
1986
|
Improved string matching with k mismatches. Zbl 0608.68058
Galil, Zvi; Giancarlo, Raffaele |
|
1985
|
Optimal parallel algorithms for string matching. Zbl 0588.68022
Galil, Zvi |
|
1985
|
Open problems in stringology. Zbl 0607.68054
Galil, Zvi |
|
1985
|
Combinatorial algorithms on words. (Proceedings of the NATO Advanced Research Workshop on Combinatorial Algorithms on Words held at Maratea, Italy, June 18-22, 1984). Zbl 0564.00027
|
|
1985
|
Computing \(D\)-optimum weighing designs: where statistics combinatorics, and computation meet. Zbl 1373.62397
Galil, Zvi |
|
1985
|
A time-space tradeoff for language recognition. Zbl 0533.68047
Dúriś, Pavol; Galil, Zvi |
|
1984
|
Two tapes are better than one for nondeterministic machines. Zbl 0558.68045
Dúriś, Pavol; Galil, Zvi |
|
1984
|
Two nonlinear lower bounds for on-line computations. Zbl 0589.68039
Ďuriš, Pavol; Galil, Zvi; Paul, Wolfgang; Reischuk, Ruediger |
|
1984
|
NP-completeness of finding the chromatic index of regular graphs. Zbl 0509.68037
Leven, Daniel; Galil, Zvi |
|
1983
|
Time-space-optimal string matching. Zbl 0509.68101
Galil, Zvi; Seiferas, Joel |
|
1983
|
An efficient general-purpose parallel computer. Zbl 0515.68022
Galil, Zvi; Paul, Wolfgang J. |
|
1983
|
Comparison of designs equivalent under one or two criteria. Zbl 0533.62063
Galil, Z.; Kiefer, J. |
|
1983
|
Efficient algorithms for finding maximal matching in graphs. Zbl 0527.68050
Galil, Zvi |
|
1983
|
Construction methods for D-optimum weighing designs when n=3(mod 4). Zbl 0489.62068
Galil, Z.; Kiefer, J. |
|
1982
|
An almost linear-time algorithm for computing a dependency basis in a relational database. Zbl 0485.68090
Galil, Zvi |
|
1982
|
Fooling a two way automaton or one pushdown store is better than one counter for two way machines. Zbl 0486.68084
Duris, Pavol; Galil, Zvi |
|
1982
|
On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store. Zbl 0523.68037
Duris, Pavol; Galil, Zvi |
|
1982
|
...and 42 more Documents |