2008 |
47 | EE | Lakshmi N. Chakrapani,
Kirthi Krishna Muntimadugu,
Lingamneni Avinash,
Jason George,
Krishna V. Palem:
Highly energy and performance efficient embedded computing through approximately correct arithmetic: a mathematical foundation and preliminary experimental validation.
CASES 2008: 187-196 |
2007 |
46 | EE | Lakshmi N. Chakrapani,
Pinar Korkmaz,
Bilge E. S. Akgul,
Krishna V. Palem:
Probabilistic system-on-a-chip architectures.
ACM Trans. Design Autom. Electr. Syst. 12(3): (2007) |
2006 |
45 | EE | Jason George,
B. Marr,
Bilge E. S. Akgul,
Krishna V. Palem:
Probabilistic arithmetic and energy efficient embedded signal processing.
CASES 2006: 158-168 |
44 | EE | Charles Hardnett,
Krishna V. Palem,
Yogesh Chobe:
Compiler optimization of embedded applications for an adaptive SoC architecture.
CASES 2006: 312-322 |
43 | EE | Lakshmi N. Chakrapani,
Bilge E. S. Akgul,
Suresh Cheemalavagu,
Pinar Korkmaz,
Krishna V. Palem,
Balasubramanian Seshasayee:
Ultra-efficient (embedded) SOC architectures based on probabilistic CMOS (PCMOS) technology.
DATE 2006: 1110-1115 |
42 | EE | Pinar Korkmaz,
Bilge E. S. Akgul,
Krishna V. Palem:
Ultra-Low Energy Computing with Noise: Energy-Performance-Probability Trade-offs.
ISVLSI 2006: 349-354 |
41 | EE | Bilge E. S. Akgul,
Lakshmi N. Chakrapani,
Pinar Korkmaz,
Krishna V. Palem:
Probabilistic CMOS Technology: A Survey and Future Directions.
VLSI-SoC 2006: 1-6 |
2005 |
40 | EE | Wen-mei W. Hwu,
Krishna V. Palem:
Guest Editors' Introduction.
IEEE Trans. Computers 54(10): 1185-1187 (2005) |
39 | EE | Krishna V. Palem:
Energy Aware Computing through Probabilistic Switching: A Study of Limits.
IEEE Trans. Computers 54(9): 1123-1137 (2005) |
2004 |
38 | EE | Krishna V. Palem,
Lakshmi N. Chakrapani,
Sudhakar Yalamanchili:
A Framework for Compiler Driven Design Space Exploration for Embedded System Customization.
ASIAN 2004: 395-406 |
37 | EE | Lakshmi N. Chakrapani,
John C. Gyllenhaal,
Wen-mei W. Hwu,
Scott A. Mahlke,
Krishna V. Palem,
Rodric M. Rabbah:
Trimaran: An Infrastructure for Research in Instruction-Level Parallelism.
LCPC 2004: 32-41 |
36 | | Jinwoo Kim,
Rodric M. Rabbah,
Krishna V. Palem,
Weng-Fai Wong:
Adaptive Compiler Directed Prefetching for EPIC Processors.
PDPTA 2004: 495-501 |
2003 |
35 | EE | Krishna V. Palem:
Energy aware algorithm design via probabilistic computing: from algorithms and models to Moore's law and novel (semiconductor) devices.
CASES 2003: 113-116 |
34 | EE | Krishna V. Palem:
Energy Aware Algorithm Design via Probabilistic Computing: From Algorithms and Models to Moore?s Law and Novel (Semiconductor) Devices.
HiPC 2003: 216 |
33 | EE | Krishna V. Palem:
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective.
Verification: Theory and Practice 2003: 524-547 |
32 | EE | Rodric M. Rabbah,
Krishna V. Palem:
Data remapping for design space optimization of embedded memory systems.
ACM Trans. Embedded Comput. Syst. 2(2): 186-218 (2003) |
2002 |
31 | EE | Jinwoo Kim,
Krishna V. Palem,
Weng-Fai Wong:
A Framework for Data Prefetching Using Off-Line Training of Markovian Predictors.
ICCD 2002: 340-347 |
30 | EE | Benjamin Goldberg,
Emily Crutcher,
Chad Huneycutt,
Krishna V. Palem:
Software Bubbles: Using Predication to Compensate for Aliasing in Software Pipelines.
IEEE PACT 2002: 211-221 |
29 | EE | Krishna V. Palem,
Rodric M. Rabbah,
Vincent John Mooney,
Pinar Korkmaz,
Kiran Puttaswamy:
Design space optimization of embedded memory systems via data remapping.
LCTES-SCOPES 2002: 28-37 |
28 | | Allen Leung,
Krishna V. Palem,
Amir Pnueli:
TimeC: A Time Constraint Language for ILP Processor Compilation.
Constraints 7(2): 75-115 (2002) |
2001 |
27 | EE | Lakshmi N. Chakrapani,
Pinar Korkmaz,
Vincent John Mooney III,
Krishna V. Palem,
Kiran Puttaswamy,
Weng-Fai Wong:
The emerging power crisis in embedded processors: what can a poor compiler do?
CASES 2001: 176-180 |
26 | EE | Krishna V. Palem,
Surendranath Talla,
Weng-Fai Wong:
Compiler Optimizations for Adaptive EPIC Processors.
EMSOFT 2001: 257-273 |
25 | EE | Allen Leung,
Krishna V. Palem,
Amir Pnueli:
Scheduling time-constrained instructions on pipelined processors.
ACM Trans. Program. Lang. Syst. 23(1): 73-103 (2001) |
2000 |
24 | | Sotiris E. Nikoletseas,
Krishna V. Palem,
Paul G. Spirakis,
Moti Yung:
Connectivity Properties in Random Regular Graphs with Edge Faults.
Int. J. Found. Comput. Sci. 11(2): 247-262 (2000) |
1999 |
23 | EE | Krishna V. Palem:
Emerging Application Domains and the Computing Fabric.
ASIAN 1999: 13-14 |
1998 |
22 | EE | Allen Leung,
Krishna V. Palem,
Amir Pnueli:
A Fast Algorithm for Scheduling Time-Constrained Instructions on Processors with ILP.
IEEE PACT 1998: 158- |
1997 |
21 | EE | Krishna V. Palem:
End-to-end Solutions for Reconfigurable Systems: The Programming Gap and Challenges.
HICSS (1) 1997: 714-716 |
20 | | William H. Mangione-Smith,
Brad Hutchins,
David L. Andrews,
André DeHon,
Carl Ebeling,
Reiner W. Hartenstein,
Oskar Mencer,
John Morris,
Krishna V. Palem,
Viktor K. Prasanna,
Henk A. E. Spaanenburg:
Seeking Solutions in Configurable Computing.
IEEE Computer 30(12): 38-43 (1997) |
19 | | Allen Leung,
Krishna V. Palem,
Cristian Ungureanu:
Run-Time versus Compile-Time Instruction Scheduling in Superscalar (RISC) Processors: Performance and Trade-Off.
J. Parallel Distrib. Comput. 45(1): 13-28 (1997) |
1996 |
18 | | Pei Ouyang,
Krishna V. Palem:
Very Efficient Cyclic Shifts on Hypercubes.
J. Parallel Distrib. Comput. 39(1): 79-86 (1996) |
17 | | Zvi M. Kedem,
Gad M. Landau,
Krishna V. Palem:
Parallel Suffix-Prefix-Matching Algorithm and Applications.
SIAM J. Comput. 25(5): 998-1023 (1996) |
1995 |
16 | | Anil Kamath,
Rajeev Motwani,
Krishna V. Palem,
Paul G. Spirakis:
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture.
Random Struct. Algorithms 7(1): 59-80 (1995) |
1994 |
15 | | Anil Kamath,
Rajeev Motwani,
Krishna V. Palem,
Paul G. Spirakis:
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture
FOCS 1994: 592-603 |
14 | | Sotiris E. Nikoletseas,
Krishna V. Palem,
Paul G. Spirakis,
Moti Yung:
Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing.
ICALP 1994: 508-519 |
13 | EE | S. Muthukrishnan,
Krishna V. Palem:
Non-standard stringology: algorithms and complexity.
STOC 1994: 770-779 |
1993 |
12 | | Yonatan Aumann,
Zvi M. Kedem,
Krishna V. Palem,
Michael O. Rabin:
Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs
FOCS 1993: 271-280 |
11 | EE | S. Muthukrishnan,
Krishna V. Palem:
Highly Efficient Dictionary Matching in Parallel.
SPAA 1993: 69-78 |
10 | EE | Krishna V. Palem,
Barbara B. Simons:
Scheduling Time-Critical Instructions on RISC Machines.
ACM Trans. Program. Lang. Syst. 15(4): 632-658 (1993) |
1992 |
9 | | 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 |
8 | | Gabriel M. Kuper,
Ken McAloon,
Krishna V. Palem,
Kenneth J. Perry:
A Note on the Parallel Complexity of Anti-Unification.
J. Autom. Reasoning 9(3): 381-389 (1992) |
7 | | Zvi M. Kedem,
Krishna V. Palem:
Optimal Parallel Algorithms for Forest and Term Matching.
Theor. Comput. Sci. 93(2): 245-264 (1992) |
1991 |
6 | | 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 |
5 | | 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 |
4 | | Krishna V. Palem,
Barbara B. Simons:
Scheduling Time-Critical Instructions on RISC Machines.
POPL 1990: 270-280 |
3 | | Zvi M. Kedem,
Krishna V. Palem,
Paul G. Spirakis:
Efficient Robust Parallel Computations (Extended Abstract)
STOC 1990: 138-148 |
1989 |
2 | EE | Zvi M. Kedem,
Gad M. Landau,
Krishna V. Palem:
Optimal Parallel Suffix-Prefix Matching Algorithm and Applications.
SPAA 1989: 388-398 |
1988 |
1 | | Gabriel M. Kuper,
Ken McAloon,
Krishna V. Palem,
Kenneth J. Perry:
Efficient Parallel Algorithms for Anti-Unification and Relative Complement
LICS 1988: 112-120 |