Krishna V. Palem - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

An approach to energy-error tradeoffs in approximate ripple carry addersZvi M. Kedem, Vincent John Mooney, Kirthi Krishna Muntimadugu, Krishna V. Palem. islped 2010: 211-216 [doi]

2010

2009

Sustaining moore s law in embedded computing through probabilistic and approximate design: retrospects and prospectsKrishna V. Palem, Lakshmi N. Chakrapani, Zvi M. Kedem, Lingamneni Avinash, Kirthi Krishna Muntimadugu. cases 2009: 1-10 [doi]

2008

Highly energy and performance efficient embedded computing through approximately correct arithmetic: a mathematical foundation and preliminary experimental validationLakshmi N. Chakrapani, Kirthi Krishna Muntimadugu, Lingamneni Avinash, Jason George, Krishna V. Palem. cases 2008: 187-196 [doi]

2007

Probabilistic system-on-a-chip architecturesLakshmi N. Chakrapani, Pinar Korkmaz, Bilge E. S. Akgul, Krishna V. Palem. todaes, 12(3), 2007. [doi]

2006

Probabilistic CMOS Technology: A Survey and Future DirectionsBilge E. S. Akgul, Lakshmi N. Chakrapani, Pinar Korkmaz, Krishna V. Palem. vlsi 2006: 1-6 [doi]

Ultra-efficient (embedded) SOC architectures based on probabilistic CMOS (PCMOS) technologyLakshmi N. Chakrapani, Bilge E. S. Akgul, Suresh Cheemalavagu, Pinar Korkmaz, Krishna V. Palem, Balasubramanian Seshasayee. date 2006: 1110-1115 [doi]

Probabilistic arithmetic and energy efficient embedded signal processingJason George, B. Marr, Bilge E. S. Akgul, Krishna V. Palem. cases 2006: 158-168 [doi]

Compiler optimization of embedded applications for an adaptive SoC architectureCharles Hardnett, Krishna V. Palem, Yogesh Chobe. cases 2006: 312-322 [doi]

Ultra-Low Energy Computing with Noise: Energy-Performance-Probability Trade-offsPinar Korkmaz, Bilge E. S. Akgul, Krishna V. Palem. isvlsi 2006: 349-354 [doi]

Data trace cache: an application specific cache architectureSubramanian Ramaswamy, Jaswanth Sreeram, Sudhakar Yalamanchili, Krishna V. Palem. sigarch, 34(1):11-18, 2006. [doi]

2005

Guest Editors IntroductionWen-mei W. Hwu, Krishna V. Palem. TC, 54(10):1185-1187, 2005. [doi]

Energy Aware Computing through Probabilistic Switching: A Study of LimitsKrishna V. Palem. TC, 54(9):1123-1137, 2005. [doi]

2004

2003

Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic PerspectiveKrishna V. Palem. BIRTHDAY 2003: 524-547 [doi]

Energy aware algorithm design via probabilistic computing: from algorithms and models to Moore s law and novel (semiconductor) devicesKrishna V. Palem. cases 2003: 113-116 [doi]

Energy Aware Algorithm Design via Probabilistic Computing: From Algorithms and Models to Moore?s Law and Novel (Semiconductor) DevicesKrishna V. Palem. hipc 2003: 216 [doi]

Data remapping for design space optimization of embedded memory systemsRodric M. Rabbah, Krishna V. Palem. tecs, 2(2):186-218, 2003. [doi]

2002

2001

2000

Connectivity Properties in Random Regular Graphs with Edge FaultsSotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung. ijfcs, 11(2):247-262, 2000.

1999

Emerging Application Domains and the Computing FabricKrishna V. Palem. asian 1999: 13-14 [doi]

1998

A Fast Algorithm for Scheduling Time-Constrained Instructions on Processors with ILPAllen Leung, Krishna V. Palem, Amir Pnueli. IEEEpact 1998: 158 [doi]

1997

1996

Parallel Suffix-Prefix-Matching Algorithm and ApplicationsZvi M. Kedem, Gad M. Landau, Krishna V. Palem. siamcomp, 25(5):998-1023, 1996.

Very Efficient Cyclic Shifts on HypercubesPei Ouyang, Krishna V. Palem. jpdc, 39(1):79-86, 1996.

1995

Tail Bounds for Occupancy and the Satisfiability Threshold ConjectureAnil Kamath, Rajeev Motwani, Krishna V. Palem, Paul G. Spirakis. rsa, 7(1):59-80, 1995.

1994

Tail Bounds for Occupancy and the Satisfiability Threshold ConjectureAnil Kamath, Rajeev Motwani, Krishna V. Palem, Paul G. Spirakis. focs 1994: 592-603

Non-standard stringology: algorithms and complexityS. Muthukrishnan, Krishna V. Palem. stoc 1994: 770-779 [doi]

Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network ComputingSotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung. icalp 1994: 508-519

1993

Highly Efficient Asynchronous Execution of Large-Grained Parallel ProgramsYonatan Aumann, Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin. focs 1993: 271-280

Highly Efficient Dictionary Matching in ParallelS. Muthukrishnan, Krishna V. Palem. spaa 1993: 69-78 [doi]

Scheduling Time-Critical Instructions on RISC MachinesKrishna V. Palem, Barbara B. Simons. TOPLAS, 15(4):632-658, 1993. [doi]

1992

Optimal Parallel Algorithms for Forest and Term MatchingZvi M. Kedem, Krishna V. Palem. TCS, 93(2):245-264, 1992.

Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version)Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin, A. Raghunathan. stoc 1992: 306-317

A Note on the Parallel Complexity of Anti-UnificationGabriel M. Kuper, Ken McAloon, Krishna V. Palem, Kenneth J. Perry. JAR, 9(3):381-389, 1992.

1991

Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract)Zvi M. Kedem, Krishna V. Palem, A. Raghunathan, Paul G. Spirakis. stoc 1991: 381-390

Fast Parallel Algorithms for Coloring Random GraphsZvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. criwg 1992: 135-147

Very efficient cyclic shifts on hypercubesPei Ouyang, Krishna V. Palem. spdp 1991: 556-563 [doi]

1990

Efficient Robust Parallel Computations (Extended Abstract)Zvi M. Kedem, Krishna V. Palem, Paul G. Spirakis. stoc 1990: 138-148

Scheduling Time-Critical Instructions on RISC MachinesKrishna V. Palem, Barbara B. Simons. POPL 1990: 270-280

1989

Optimal Parallel Suffix-Prefix Matching Algorithm and ApplicationsZvi M. Kedem, Gad M. Landau, Krishna V. Palem. spaa 1989: 388-398 [doi]

1988

Efficient Parallel Algorithms for Anti-Unification and Relative ComplementGabriel M. Kuper, Ken McAloon, Krishna V. Palem, Kenneth J. Perry. lics 1988: 112-120