default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZvi M. Kedem
Person information
- affiliation: New York University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j25]Davi Geiger
, Zvi M. Kedem:
Spin Entropy. Entropy 24(9): 1292 (2022)- [j24]Davi Geiger, Zvi M. Kedem:
On Quantum Entropy. Entropy 24(10): 1341 (2022) - 2020
- [i2]Rohit R. Muthyala, Davi Geiger, Zvi M. Kedem:
Quantum Interference for Counting Clusters. CoRR abs/2001.04251 (2020)
2010 – 2019
- 2017
- [c38]Davi Geiger, Zvi M. Kedem:
Quantum Interference and Shape Detection. EMMCVPR 2017: 18-33 - 2016
- [i1]Zvi M. Kedem, Kirthi Krishna Muntimadugu:
Mathematical Modeling of General Inaccurate Adders. CoRR abs/1606.01753 (2016) - 2011
- [c37]Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna Muntimadugu, Krishna V. Palem:
An approach to energy-error tradeoffs in approximate ripple carry adders. ISLPED 2011: 211-216 - 2010
- [c36]Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna Muntimadugu, Krishna V. Palem, Avani Devarasetty, Phani Deepak Parasuramuni:
Optimizing energy to minimize errors in dataflow graphs using approximate adders. CASES 2010: 177-186
2000 – 2009
- 2009
- [c35]Krishna V. Palem, Lakshmi N. Chakrapani, Zvi M. Kedem, Lingamneni Avinash, Kirthi Krishna Muntimadugu:
Sustaining moore's law in embedded computing through probabilistic and approximate design: retrospects and prospects. CASES 2009: 1-10 - 2005
- [c34]Xin Yu, Zvi M. Kedem:
A distributed adaptive cache update algorithm for the dynamic source routing protocol. INFOCOM 2005: 730-739 - [c33]Vijay Karamcheti, Davi Geiger, Zvi M. Kedem, S. Muthukrishnan:
Detecting malicious network traffic using inverse distributions of packet contents. MineNet 2005: 165-170 - 2004
- [c32]Xin Yu, Zvi M. Kedem:
Reducing the effect of mobility on TCP by making route caches quickly adapt to topology changes. ICC 2004: 4103-4110 - 2002
- [j23]Dao-I Lin, Zvi M. Kedem:
Pincer-Search: An Efficient Algorithm for Discovering the Maximum Frequent Set. IEEE Trans. Knowl. Data Eng. 14(3): 553-566 (2002) - [j22]PeiZong Lee, Zvi M. Kedem:
Automatic data and computation decomposition on distributed memory parallel computers. ACM Trans. Program. Lang. Syst. 24(1): 1-50 (2002) - 2000
- [j21]Fangzhe Chang, Vijay Karamcheti, Zvi M. Kedem:
Exploiting Application Tunability for Efficient, Predictable Resource Management in Parallel and Distributed Systems. J. Parallel Distributed Comput. 60(11): 1420-1445 (2000)
1990 – 1999
- 1999
- [j20]Arash Baratloo, Mehmet Karaul, Zvi M. Kedem, P. Wijckoff:
Charlotte: Metacomputing on the Web. Future Gener. Comput. Syst. 15(5-6): 559-570 (1999) - [c31]Arash Baratloo, Partha Dasgupta, Vijay Karamcheti, Zvi M. Kedem:
Metacomputing with MILAN. Heterogeneous Computing Workshop 1999: 169-183 - [c30]Arash Baratloo, Ayal Itzkovitz, Zvi M. Kedem, Yuanyuan Zhao:
Mechanisms for Just-in-Time Allocation of Resources to Adaptive Parallel Programs. IPPS/SPDP 1999: 506-512 - [c29]Fangzhe Chang, Vijay Karamcheti, Zvi M. Kedem:
Exploiting Application Tunability for Efficient, Predictable Parallel Resource Management. IPPS/SPDP 1999: 749-758 - [c28]Partha Dasgupta, Vijay Karamcheti, Zvi M. Kedem:
Transparent Distribution Middleware for General Purpose Computations. PDPTA 1999: 417-423 - 1998
- [j19]Arash Baratloo, Mehmet Karaul, Holger Karl, Zvi M. Kedem:
An infrastructure for network computing with Java applets. Concurr. Pract. Exp. 10(11-13): 1029-1041 (1998) - [c27]Dao-I Lin, Zvi M. Kedem:
Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set. EDBT 1998: 105-119 - 1996
- [j18]Alexander Tuzhilin, Zvi M. Kedem:
Modeling Data-Intensive Reactive Systems with Relational Transition Systems. Acta Informatica 33(3): 203-231 (1996) - [j17]Zvi M. Kedem, Gad M. Landau, Krishna V. Palem:
Parallel Suffix-Prefix-Matching Algorithm and Applications. SIAM J. Comput. 25(5): 998-1023 (1996) - [c26]Shih-Chen Huang, Zvi M. Kedem:
Supporting a Flexible Parallel Programming Model on a Network of Workstations. ICDCS 1996: 75-82 - 1995
- [c25]Arash Baratloo, Partha Dasgupta, Zvi M. Kedem:
CALYPSO: A Novel Software System for Fault-Tolerant Parallel Processing on Distributed Platforms. HPDC 1995: 122-129 - [c24]Partha Dasgupta, Zvi M. Kedem, Michael O. Rabin:
Parallel Processing on Networks of Workstations: A Fault-Tolerant, High Performance Approach. ICDCS 1995: 467-474 - 1993
- [c23]Yonatan Aumann, Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin:
Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs. FOCS 1993: 271-280 - 1992
- [j16]Zvi M. Kedem, Krishna V. Palem:
Optimal Parallel Algorithms for Forest and Term Matching. Theor. Comput. Sci. 93(2): 245-264 (1992) - [c22]Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin, A. Raghunathan:
Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version). STOC 1992: 306-317 - 1991
- [c21]Zvi M. Kedem, Krishna V. Palem, A. Raghunathan, Paul G. Spirakis:
Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract). STOC 1991: 381-390 - [c20]Zvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis:
Fast Parallel Algorithms for Coloring Random Graphs. WG 1991: 135-147 - 1990
- [j15]PeiZong Lee, Zvi M. Kedem:
On high-speed computing with a programmable linear array. J. Supercomput. 4(3): 223-249 (1990) - [j14]Partha Dasgupta, Zvi M. Kedem:
The Five Color Concurrency Control Protocol: Non-Two-Phase Locking in General Databases. ACM Trans. Database Syst. 15(2): 281-307 (1990) - [j13]PeiZong Lee, Zvi M. Kedem:
Mapping Nested Loop Algorithms into Multidimensional Systolic Arrays. IEEE Trans. Parallel Distributed Syst. 1(1): 64-76 (1990) - [c19]Zvi M. Kedem, Krishna V. Palem, Paul G. Spirakis:
Efficient Robust Parallel Computations (Extended Abstract). STOC 1990: 138-148
1980 – 1989
- 1989
- [c18]Alexander Tuzhilin, Zvi M. Kedem:
Querying and Controlling the Future Behaviour of Complex Objects. ICDE 1989: 434-442 - [c17]PeiZong Lee, Zvi M. Kedem:
Mapping Nested Loop Algorithms into Multi-Dimensional Systolic Arrays. ICPP (3) 1989: 206-210 - [c16]Zvi M. Kedem, Alexander Tuzhilin:
Relational Database Behavior: Utilizing Relational Discrete Event Systems and Models. PODS 1989: 336-346 - [c15]Zvi M. Kedem, Gad M. Landau, Krishna V. Palem:
Optimal Parallel Suffix-Prefix Matching Algorithm and Applications. SPAA 1989: 388-398 - 1988
- [j12]PeiZong Lee, Zvi M. Kedem:
Synthesizing Linear Array Algorithms from Nested For Loop Algorithms. IEEE Trans. Computers 37(12): 1578-1598 (1988) - [j11]Duncan A. Buell, David A. Carlson, Yuan-Chieh Chow, Karel Culík, Narsingh Deo, Raphael A. Finkel, Elias N. Houstis, Elaine M. Jacob Son, Zvi M. Kedem, Janusz S. Kowalik, Philip Kuekes, Joanne L. Martin, George A. Michael, Neil S. Ostlund, Jerry Potter, D. K. Pradhan, Michael J. Quinn, G. W. Stewart, Quentin F. Stout, Layne T. Watson, Jon Webb:
Parallel algorithms and architectures report of a workshop. J. Supercomput. 1(3): 301-325 (1988) - [c14]PeiZong Lee, Zvi M. Kedem:
On high-speed computing with a programmable linear array. SC 1988: 425-432 - 1985
- [j10]Zvi M. Kedem:
Optimal Allocation of Area for Single-Chip Computations. SIAM J. Comput. 14(3): 730-743 (1985) - [j9]C. Mohan, Donald S. Fussell, Zvi M. Kedem, Abraham Silberschatz:
Lock Conversion in Non-Two-Phase Locking Protocols. IEEE Trans. Software Eng. 11(1): 15-22 (1985) - 1983
- [j8]Zvi M. Kedem, Abraham Silberschatz:
Locking Protocols: From Exclusive to Shared Locks. J. ACM 30(4): 787-804 (1983) - [c13]Partha Dasgupta, Zvi M. Kedem:
A Non-Two-Phase Locking Protocol for Concurrency Control in General Databases. VLDB 1983: 92-94 - 1982
- [j7]Abraham Silberschatz, Zvi M. Kedem:
A Family of Locking Protocols for Database Systems that Are Modeled by Directed Graphs. IEEE Trans. Software Eng. 8(6): 558-562 (1982) - [c12]Zvi M. Kedem:
Optimal Allocation of Computational Resources in VLSI. FOCS 1982: 379-385 - [c11]Zvi M. Kedem, C. Mohan, Abraham Silberschatz:
An Efficient Deadlock Removal Scheme for Non-Two-Phase Locking Protocols. VLDB 1982: 91-97 - 1981
- [j6]Zvi M. Kedem, Abraham Silberschatz:
A Characterization of Database Graphs Admitting a Simple Locking Protocol. Acta Informatica 16: 1-13 (1981) - [c10]Zvi M. Kedem, Alessandro Zorat:
On Relations Between Input and Communication/Computation in VLSI (Preliminary Report). FOCS 1981: 37-44 - [c9]Donald S. Fussell, Zvi M. Kedem, Abraham Silberschatz:
Deadlock Removal Using Partial Rollback in Database Systems. SIGMOD Conference 1981: 65-73 - [c8]Donald S. Fussell, Zvi M. Kedem, Abraham Silberschatz:
A Theory of Correct Locking Protocols for Database Systems. VLDB 1981: 112-124 - 1980
- [j5]Abraham Silberschatz, Zvi M. Kedem:
Consistency in Hierarchical Database Systems. J. ACM 27(1): 72-80 (1980) - [c7]Henry Fuchs, Zvi M. Kedem, Bruce F. Naylor:
On visible surface generation by a priori tree structures. SIGGRAPH 1980: 124-133 - [c6]Zvi M. Kedem, Abraham Silberschatz:
Non-Two-Phase Locking Protocols with Shared and Exclusive Locks. VLDB 1980: 309-317
1970 – 1979
- 1979
- [j4]Alain Fournier, Zvi M. Kedem:
Comments on the All Nearest-Neighbor Problem for Convex Polygons. Inf. Process. Lett. 9(3): 105-107 (1979) - [j3]Zvi M. Kedem:
Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications and Divisions. J. ACM 26(3): 582-601 (1979) - [c5]Zvi M. Kedem, Abraham Silberschatz:
Controlling Concurrency Using Locking Protocols (Preliminary Report). FOCS 1979: 274-285 - [c4]Henry Fuchs, Zvi M. Kedem, Bruce F. Naylor:
Predetermining visibility priority in 3-D scenes (Preliminary Report). SIGGRAPH 1979: 175-181 - 1978
- [c3]Henry Fuchs, Zvi M. Kedem:
The "highly intelligent" tablet as an efficient pointing device for interactive graphics (Preliminary Report). ACM Annual Conference (2) 1978: 765-769 - 1977
- [j2]Henry Fuchs, Zvi M. Kedem, Samuel P. Uselton:
Optimal Surface Reconstruction from Planar Contours. Commun. ACM 20(10): 693-702 (1977) - [j1]David G. Kirkpatrick, Zvi M. Kedem:
Adequate Requirements for Rational Functions. SIAM J. Comput. 6(1): 188-199 (1977) - [c2]Henry Fuchs, Zvi M. Kedem, Samuel P. Uselton:
Optimal surface reconstruction from planar contours. SIGGRAPH 1977: 236 - 1974
- [c1]Zvi M. Kedem:
Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications. STOC 1974: 334-341
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
