| 1999 |
|---|
| 14 | EE | Kalle Lyytinen,
Varun Grover,
Jane Linder,
Haim Mendelson,
James A. Senn,
John J. Sviokla:
Making information systems research more relevant: academic and industry perspectives (panel session).
ICIS 1999: 574-577 |
| 1994 |
|---|
| 13 | | Aditya N. Saharia,
Terence M. Barron,
Thomas J. Davenport,
James K. Ho,
Haim Mendelson:
Is There a Theory of Reengineering?
ICIS 1994: 492-493 |
| 1993 |
|---|
| 12 | | Erik Brynjolfsson,
Paul Attewell,
Haim Mendelson,
Abraham Seidman:
What Can Information Systems Learn from Economics? Applications and Highlights from Current Research.
ICIS 1993: 391-392 |
| 1987 |
|---|
| 11 | | Haim Mendelson:
Economies of Scale in Computing: Grosch's Law Revisited.
Commun. ACM 30(12): 1066-1072 (1987) |
| 10 | | Vijay Gurbaxani,
Haim Mendelson:
Software and Hardware in Data Processing Budgets.
IEEE Trans. Software Eng. 13(9): 1010-1017 (1987) |
| 1986 |
|---|
| 9 | EE | Haim Mendelson,
Aditya N. Saharia:
Incomplete Information Costs and Database Design.
ACM Trans. Database Syst. 11(2): 159-185 (1986) |
| 8 | EE | Haim Mendelson,
Uri Yechiali:
Physical design for a random-access file with random insertions and deletions.
Computers & OR 13(4): 489-505 (1986) |
| 1985 |
|---|
| 7 | | Haim Mendelson:
Pricing Computer Services: Queueing Effects.
Commun. ACM 28(3): 312-321 (1985) |
| 1983 |
|---|
| 6 | | Haim Mendelson:
Analysis of linear probing with buckets.
Inf. Syst. 8(3): 207-216 (1983) |
| 1982 |
|---|
| 5 | | Haim Mendelson:
Analysis of Extendible Hashing.
IEEE Trans. Software Eng. 8(6): 611-619 (1982) |
| 1981 |
|---|
| 4 | | Haim Mendelson:
On Permutations with Limited Repetition.
J. Comb. Theory, Ser. A 30(3): 351-353 (1981) |
| 1980 |
|---|
| 3 | EE | Haim Mendelson,
Uri Yechiali:
A New Approach to the Analysis of Linear Probing Schemes.
J. ACM 27(3): 474-483 (1980) |
| 1979 |
|---|
| 2 | | Haim Mendelson,
Joseph S. Pliskin,
Uri Yechiali:
Optimal Storage Allocation for Serial Files.
Commun. ACM 22(2): 124-130 (1979) |
| 1 | EE | Haim Mendelson,
Uri Yechiali:
Performance Measures for Ordered Lists in Random-Access Files.
J. ACM 26(4): 654-667 (1979) |
