Travelled to:
1 × Belgium
1 × Canada
1 × Israel
1 × Italy
2 × Finland
2 × USA
Collaborated with:
M.Rodeh J.Y.Gil G.M.Benedek O.Shmueli ∅ A.G.Konheim R.Alur R.P.Kurshan M.Yannakakis
Talks about:
circuit (2) graph (2) nonuniform (1) implement (1) prioriti (1) learnabl (1) approxim (1) success (1) program (1) problem (1)
Person: Alon Itai
DBLP: Itai:Alon
Contributed to:
Wrote 8 papers:
- ECOOP-1998-GilI #analysis #complexity #object-oriented #source code
- The Complexity of Type Analysis of Object Oriented Programs (JYG, AI), pp. 601–634.
- CAV-1992-AlurIKY #approximate #verification
- Timing Verification by Successive Approximation (RA, AI, RPK, MY), pp. 137–150.
- ICALP-1988-BenedekI
- Nonuniform Learnability (GMB, AI), pp. 82–92.
- SIGMOD-1984-ShmueliI #maintenance
- Maintenance of Views (OS, AI), pp. 240–255.
- ICALP-1981-ItaiKR #implementation
- A Sparse Table Implementation of Priority Queues (AI, AGK, MR), pp. 417–431.
- ICALP-1978-ItaiR #graph
- Covering a Graph by Circuits (AI, MR), pp. 289–299.
- ICALP-1977-ItaiR #problem
- Some Matching Problems (AI, MR), pp. 258–268.
- STOC-1977-Itai #graph
- Finding a Minimum Circuit in a Graph (AI), pp. 1–10.