Searching for authors named Micha Hofri – sorted by Relevance.
-
2001 Computer Science Department MQP Review
- members. 1.3 Procedure The peer review was conducted during the Summer of 2001 by Micha Hofri, department
- Add To MetaCart
-
Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms
- Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms Micha Hofri Philippe Jacquet
- Cited by 1 (1 self) – Add To MetaCart
-
Ecient reorganization of binary search trees
- Efficient Reorganization of Binary Search Trees Micha Hofri † Hadas Shachnai ‡ Dept. of Computer
- Cited by 1 (0 self) – Add To MetaCart
-
Efficient reorganization of binary search trees
- Efficient Reorganization of Binary Search Trees Micha Hofri + Hadas Shachnai # Dept
- Cited by 1 (0 self) – Add To MetaCart
-
1999 Computer Science Department MQP Review
- WPI-CS-TR-99-24 August 1999 1999 Computer Science Department MQP Review by Micha Hofri Craig E
- Add To MetaCart
-
MAXIMUM SIZE OF A DYNAMIC DATA STRUCTURE: Hashing with Lazy Deletion Revisited
- Micha Hofri y Wojciech Szpankowski z Department of Statistics Dept. of Computer Science Dept
- Cited by 4 (4 self) – Add To MetaCart
-
The Maximum of a Random Walk and Its Application to Rectangle Packing
- Flajolet, Leopold Flatto, Micha Hofri N3223 Juillet 1997 TH ` EME 2 The Maximum of a Random Walk and Its
- Cited by 1 (0 self) – Add To MetaCart
-
Improvements to Collaborative Filtering Algorithms
- of Department Prof. Micha Hofri Abstract The explosive growth of mailing lists, Web sites and Usenet news has
- Cited by 8 (0 self) – Add To MetaCart
-
Computation in Optimal Extension Fields
- Reader ECE and CS Departments CS Department Dr. Micha Hofri Department Head CS Department ii Abstract
- Cited by 4 (3 self) – Add To MetaCart
-
The Maximum of a Random Walk and Its Application to Rectangle Packing
- ., Philippe Flajolet 2;4 , Leopold Flatto 1 , and Micha Hofri 3 1. Bell Labs, Lucent Technologies, 700
- Add To MetaCart

