Zvi M. Kedem

According to our database1, Zvi M. Kedem
  • authored at least 61 papers between 1974 and 2016.
  • has a "Dijkstra number"2 of three.

Awards

ACM Fellow

ACM Fellow 1997, "Zvi Kedem has developed crucial enabling innovations in key areas of information technology and their foundational underpinnings: in computer graphics, database systems, and parallel computing.".

IEEE Fellow

IEEE Fellow 2007, "For contributions to concurrent and parallel computing systems".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Mathematical Modeling of General Inaccurate Adders.
CoRR, 2016

2011
An approach to energy-error tradeoffs in approximate ripple carry adders.
Proceedings of the 2011 International Symposium on Low Power Electronics and Design, 2011

2010
Optimizing energy to minimize errors in dataflow graphs using approximate adders.
Proceedings of the 2010 International Conference on Compilers, 2010

2009
Sustaining moore's law in embedded computing through probabilistic and approximate design: retrospects and prospects.
Proceedings of the 2009 International Conference on Compilers, 2009

2005
Detecting malicious network traffic using inverse distributions of packet contents.
Proceedings of the 1st Annual ACM Workshop on Mining Network Data, 2005

A distributed adaptive cache update algorithm for the dynamic source routing protocol.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

2004
Reducing the effect of mobility on TCP by making route caches quickly adapt to topology changes.
Proceedings of IEEE International Conference on Communications, 2004

2002
Automatic data and computation decomposition on distributed memory parallel computers.
ACM Trans. Program. Lang. Syst., 2002

Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set.
IEEE Trans. Knowl. Data Eng., 2002

2000
Exploiting Application Tunability for Efficient, Predictable Resource Management in Parallel and Distributed Systems.
J. Parallel Distrib. Comput., 2000

1999
Charlotte: Metacomputing on the Web.
Future Generation Comp. Syst., 1999

Transparent Distribution Middleware for General Purpose Computations.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Exploiting Application Tunability for Efficient, Predictable Parallel Resource Management.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

Mechanisms for Just-in-Time Allocation of Resources to Adaptive Parallel Programs.
Proceedings of the 13th International Parallel Processing Symposium / 10th Symposium on Parallel and Distributed Processing (IPPS / SPDP '99), 1999

Metacomputing with MILAN.
Proceedings of the 8th Heterogeneous Computing Workshop, 1999

1998
An infrastructure for network computing with Java applets.
Concurrency - Practice and Experience, 1998

Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set.
Proceedings of the Advances in Database Technology, 1998

1996
Parallel Suffix-Prefix-Matching Algorithm and Applications.
SIAM J. Comput., 1996

Modeling Data-Intensive Reactive Systems with Relational Transition Systems.
Acta Inf., 1996

Supporting a Flexible Parallel Programming Model on a Network of Workstations.
Proceedings of the 16th International Conference on Distributed Computing Systems, 1996

1995
Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach.
Proceedings of the 15th International Conference on Distributed Computing Systems, Vancouver, British Columbia, Canada, May 30, 1995

CALYPSO: A Novel Software System for Fault-Tolerant Parallel Processing on Distributed Platforms.
Proceedings of the 4th International Symposium on High Performance Distributed Computing (HPDC '95), 1995

1993
Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Optimal Parallel Algorithms for Forest and Term Matching.
Theor. Comput. Sci., 1992

Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991
Fast Parallel Algorithms for Coloring Random Graphs.
Proceedings of the 17th International Workshop, 1991

Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

1990
Mapping Nested Loop Algorithms into Multidimensional Systolic Arrays.
IEEE Trans. Parallel Distrib. Syst., 1990

The Five Color Concurrency Control Protocol: Non-Two-Phase Locking in General Databases.
ACM Trans. Database Syst., 1990

On high-speed computing with a programmable linear array.
The Journal of Supercomputing, 1990

Efficient Robust Parallel Computations (Extended Abstract)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989
Optimal Parallel Suffix-Prefix Matching Algorithm and Applications.
SPAA, 1989

Relational Database Behavior: Utilizing Relational Discrete Event Systems and Models.
Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989

Mapping Nested Loop Algorithms into Multi-Dimensional Systolic Arrays.
Proceedings of the International Conference on Parallel Processing, 1989

Querying and Controlling the Future Behaviour of Complex Objects.
Proceedings of the Fifth International Conference on Data Engineering, 1989

1988
Parallel algorithms and architectures report of a workshop.
The Journal of Supercomputing, 1988

Synthesizing Linear Array Algorithms from Nested For Loop Algorithms.
IEEE Trans. Computers, 1988

On high-speed computing with a programmable linear array.
Proceedings of the Proceedings Supercomputing '88, Orlando, FL, USA, November 12-17, 1988, 1988

1985
Lock Conversion in Non-Two-Phase Locking Protocols.
IEEE Trans. Software Eng., 1985

Optimal Allocation of Area for Single-Chip Computations.
SIAM J. Comput., 1985

1983
Locking Protocols: From Exclusive to Shared Locks
J. ACM, October, 1983

A Non-Two-Phase Locking Protocol for Concurrency Control in General Databases.
Proceedings of the 9th International Conference on Very Large Data Bases, October 31, 1983

1982
A Family of Locking Protocols for Database Systems that Are Modeled by Directed Graphs.
IEEE Trans. Software Eng., 1982

An Efficient Deadlock Removal Scheme for Non-Two-Phase Locking Protocols.
Proceedings of the Eigth International Conference on Very Large Data Bases, 1982

Optimal Allocation of Computational Resources in VLSI
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981
A Characterization of Database Graphs Admitting a Simple Locking Protocol.
Acta Inf., 1981

A Theory of Correct Locking Protocols for Database Systems
Proceedings of the Very Large Data Bases, 1981

Deadlock Removal Using Partial Rollback in Database Systems.
Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data, Ann Arbor, Michigan, April 29, 1981

On Relations Between Input and Communication/Computation in VLSI (Preliminary Report)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
Consistency in Hierarchical Database Systems.
J. ACM, 1980

Non-Two-Phase Locking Protocols with Shared and Exclusive Locks.
Proceedings of the Sixth International Conference on Very Large Data Bases, 1980

On visible surface generation by a priori tree structures.
Proceedings of the 7th Annual Conference on Computer Graphics and Interactive Techniques, 1980

1979
Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications and Divisions.
J. ACM, 1979

Comments on the All Nearest-Neighbor Problem for Convex Polygons.
Inf. Process. Lett., 1979

Predetermining visibility priority in 3-D scenes (Preliminary Report).
Proceedings of the 6th Annual Conference on Computer Graphics and Interactive Techniques, 1979

Controlling Concurrency Using Locking Protocols (Preliminary Report)
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
The "highly intelligent" tablet as an efficient pointing device for interactive graphics (Preliminary Report).
Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

1977
Adequate Requirements for Rational Functions.
SIAM J. Comput., 1977

Optimal Surface Reconstruction from Planar Contours.
Commun. ACM, 1977

Optimal surface reconstruction from planar contours.
Proceedings of the 4th Annual Conference on Computer Graphics and Interactive Techniques, 1977

1974
Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974


  Loading...