Algorithms and Data Structures Publications

  1. S. Even and A. Itai, Queues, Stacks and Graphs. International Symposium on the Theory of Machines and Computations, Haifa, (1971). pdf
  2. A. Itai, Optimal Alphabetic Trees. SIAM J. on Computing, 5, 9-18, (1976). pdf
  3. S. Even, A. Itai and A. Shamir, On the Complexity of Timetable and Multi-Commodity Flow. SIAM J. on Computing, 5, 691-703, (1976). pdf
  4. A. Itai, Two Commodity Flow, J. ACM, 25, 596-611, (1978). pdf
  5. A. Itai and M. Rodeh, Finding a Minimum Circuit in a Graph. SIAM J. on Computing, 7, 413-423, (1978). pdf
  6. Y. Perl, A. Itai and H. Avni, Interpolation Search - A log log N Search. Communications of the ACM, 25, 550-553, (1978). pdf
  7. A. Itai, M. Rodeh and S. Tanimoto, Some Matching Problems in Bipartite Graphs. J. ACM, 25, 517-525, (1978). pdf
  8. A. Itai, R. J. Lipton, C. H. Papadimitriou and M. Rodeh, Covering a Graph by Simple Cycles. SIAM J. on Computing, 10, 746-750, (1981). pdf (preliminary version ICALP 1979).
  9. A. Itai and Y. Shiloach, Maximum Flow in Planar Networks. SIAM J. on Computing, 8, 135-150, (1979). pdf
  10. A. Itai, A. G. Konheim and M. Rodeh, Sparse Tables O(log n) on the Average and O(log^2 n) in the Worst Case. ICALP 8, Acre, Israel, (July 1981). pdf
  11. A. Itai, C. H. Papadimitriou and J. Schwarcfiter, Hamilton Paths in Grid Graphs. SIAM J. on Computing, 11, 676-686, (1982). pdf
  12. A. Itai and M. Rodeh, Representations of Graphs. Acta Informatica, 17, 215-219, (1982) pdf.
  13. A. Israeli and A. Itai. A Fast and Simple Randomized Parallel Algorithm for Maximal Matching. Information Processing Letters, 22, 77-80, (1986). pdf
  14. O. Shmueli and A. Itai, Complexity of Views: Tree and Cyclic Schemas. SIAM J. Computing, 16-1, 17-37, (1987). pdf
  15. A. Itai and Y. Raz, The Number of Buffers Required for Sequential Processing of a Disk File. Comm. ACM. 31(11), 1138-1342, (1988). pdf
  16. A. Zehavi and A. Itai, Three Tree-Paths. J. of Graph Theory, vol. 13(2), 177-188, (1989). pdf
  17. Y. Gil and A. Itai, How to Pack Trees. J. Algorithms 32, 108-132, (1999). pdf
  18. Y. Dinitz, A. Itai and M. Rodeh, On an Algorithm of Zemlyachenko for Subtree Isomorphism. Information Processing Letters, 70(3), 141-146, (1999). pdf
  19. A. Efrat, A. Itai, M. Katz, Improvements in Bottleneck Matching and Related Problems, Using Geometry. Algorithmica, 31, 1-28, (2001). pdf
  20. A. Itai, M. Rodeh H. Shachnai, The Passport Control Problem or How to Keep an Unstable Service System Load Balanced? Theoretical Computer Science, 282, 303-318, (2002). pdf
  21. A. Itai and M. Shadmon, The stratified index---How to create balanced search structures (May 2000). pdf
  22. Alexander Gaysinsky, Alon Itai and Hadas Shachnai, Strongly Competitive Algorithms for Caching with Pipelined Prefetching. ESA 2001. IPL version pdf.
  23. A. Itai, Producing Permutations and Combinations in Lexicographical Order. Journal of the Brazilian Computer Society. pdf.
  24. Fanica Gavril and Alon Itai, Covering a tree by a forest. Conference honoring Martin Golumbic's 60th birthday. Haifa, September 2008. LNCS proceedings. pdf