Yazar

Zvi Galil

13 cilt bulundu.

Cilt sonuçları

Theory of Computing and Systems

Danny Dolev, Zvi Galil, Michael Rodeh · Springer Science & Business Media

236 sayfa · 1992-05-06

Computers

Combinatorial Pattern Matching

Zvi Galil, Esko Ukkonen · Lecture Notes in Computer Science

424 sayfa · 1995-06-21

Computers

Combinatorial Pattern Matching

Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber · Springer

318 sayfa · 1992-12-17

Computers

The Bible, the Talmud, and the New Testament

Elijah Zvi Soloveitchik · University of Pennsylvania Press

440 sayfa · 2019-04-30

Religion

Lower Galilee During the Iron Age

Zvi Gal · Eisenbrauns

132 sayfa · 1992

History

Graph theoryMaintaining Biconnected Components of Dynamic Planar GraphsColumbia University. Dept. of Computer Science, Zvi Galil, Giuseppe F. Italiano

Maintaining Biconnected Components of Dynamic Planar Graphs

Columbia University. Dept. of Computer Science, Zvi Galil, Giuseppe F. Italiano · Yayınevi bilinmiyor

26 sayfa · 1991

Graph theory

CiltParallel Detection of All Palindromes in a StringPurdue University. Dept. of Computer Sciences, Alberto Apostolico, Dany Breslauer, Institut national de recherche en informatique et en automatique (France), Zvi Galil

Parallel Detection of All Palindromes in a String

Purdue University. Dept. of Computer Sciences, Alberto Apostolico, Dany Breslauer, Institut national de recherche en informatique et en automatique (France), Zvi Galil · Yayınevi bilinmiyor

11 sayfa · 1993

Kategori yok

Graph theoryFully Dynamic Algorithms for 2-edge ConnectivityColumbia University. Dept. of Computer Science, Zvi Galil, Giuseppe F. Italiano

Fully Dynamic Algorithms for 2-edge Connectivity

Columbia University. Dept. of Computer Science, Zvi Galil, Giuseppe F. Italiano · Yayınevi bilinmiyor

58 sayfa · 1991

Graph theory

CiltAn O(n Squared Log N(m+nlog N)) Minimum Cost Flow AlgorithmMathematical Sciences Research Institute (Berkeley, Calif.)., Z. Galil, E. Tardos

An O(n Squared Log N(m+nlog N)) Minimum Cost Flow Algorithm

Mathematical Sciences Research Institute (Berkeley, Calif.)., Z. Galil, E. Tardos · Yayınevi bilinmiyor

15 sayfa · 1986

Kategori yok

Graph theoryMaintaining the 3-edge-connected Components of a Graph On-lineColumbia University. Dept. of Computer Science, Zvi Galil, Giuseppe F. Italiano

Maintaining the 3-edge-connected Components of a Graph On-line

Columbia University. Dept. of Computer Science, Zvi Galil, Giuseppe F. Italiano · Yayınevi bilinmiyor

48 sayfa · 1991

Graph theory

Dynamic programmingDynamic Programming with Convexity, Concavity, and SparsityColumbia University. Dept. of Computer Science, Zvi Galil, Kunsoo Park

Dynamic Programming with Convexity, Concavity, and Sparsity

Columbia University. Dept. of Computer Science, Zvi Galil, Kunsoo Park · Yayınevi bilinmiyor

50 sayfa · 1990

Dynamic programming

CiltA Private Interactive Test of a Boolean Predicate and Minimum-knowledge Public-key CryptosystemsColumbia University. Department of Computer Science, Z. Galil, S. Haber, M. M. Yung

A Private Interactive Test of a Boolean Predicate and Minimum-knowledge Public-key Cryptosystems

Columbia University. Department of Computer Science, Z. Galil, S. Haber, M. M. Yung · Yayınevi bilinmiyor

Sayfa sayısı yok · 1985

Kategori yok

CiltSymmetric Public-key EncryptionColumbia University. Department of Computer Science, Z. Galil, S. Haber, M. M. Yung

Symmetric Public-key Encryption

Columbia University. Department of Computer Science, Z. Galil, S. Haber, M. M. Yung · Yayınevi bilinmiyor

Sayfa sayısı yok · 1985

Kategori yok