Yazar

i v ranakrishnan

18 cilt bulundu.

Cilt sonuçları

An International Textbook on Fundamental of Molecular Biology and Bioinstrumentation

Seema Narkhede, 1st, N. Rama krishna, 2nd, Pranjali B. Chole, 3rd, Virendra K. Sangode, IV, Ms. Khushboo Bafna, V, Renu Bist, 6th, Mohammed Tarique, VII, Jayashri Yuvaraj Jadhav, VIII, Jyoti Arya, 9th, Durgesh Nemichand Phulwade, 10th · Yayınevi bilinmiyor

Sayfa sayısı yok · 2025-12-27

Education

ComputersPractical Aspects of Declarative LanguagesI.V. Ramakrishnan

Practical Aspects of Declarative Languages

I.V. Ramakrishnan · Springer

352 sayfa · 2001-02-28

Computers

CiltApproximation Schemes for a Class of Combinatorial Optimization Problems on a Parallel MachineUniversity of Maryland at College Park. Department of Computer Science, P. S. Gopalakrishnan, I. V. Ramakrishnan, L. N. Kanal

Approximation Schemes for a Class of Combinatorial Optimization Problems on a Parallel Machine

University of Maryland at College Park. Department of Computer Science, P. S. Gopalakrishnan, I. V. Ramakrishnan, L. N. Kanal · Yayınevi bilinmiyor

Sayfa sayısı yok · 1986

Kategori yok

CiltFault-tolerant Multipipeline Computers: a Reconfiguration Algorithm and Probabilistic Bounds on Delay and YieldState University of New York at Stony Brook. Department of Computer Science, R. Gupta, A. Zorat, I. V. Ramakrishnan

Fault-tolerant Multipipeline Computers: a Reconfiguration Algorithm and Probabilistic Bounds on Delay and Yield

State University of New York at Stony Brook. Department of Computer Science, R. Gupta, A. Zorat, I. V. Ramakrishnan · Yayınevi bilinmiyor

Sayfa sayısı yok · 1986

Kategori yok

CiltComputing Dominators in ParallelState University of New York at Stony Brook. Department of Computer Science, S. Pawagi, P. S. Gopalakrishnan, I. V. Ramakrishnan

Computing Dominators in Parallel

State University of New York at Stony Brook. Department of Computer Science, S. Pawagi, P. S. Gopalakrishnan, I. V. Ramakrishnan · Yayınevi bilinmiyor

Sayfa sayısı yok · 1986

Kategori yok

Combinatorial optimizationParallel Approximate Algorithms for the 0-1 Knapsack ProblemP. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal

Parallel Approximate Algorithms for the 0-1 Knapsack Problem

P. S. Gopalakrishnan, I. V. Ramakrishnan, Laveen N. Kanal · Yayınevi bilinmiyor

21 sayfa · 1986

Combinatorial optimization

Parallel processing (Electronic computers)On Using Multiple Inverted Trees for Parallel Updating of Graph PropertiesUniversity of Maryland at College Park. Dept. of Computer Science, S. Pawagi, I. V. Ramakrishnan

On Using Multiple Inverted Trees for Parallel Updating of Graph Properties

University of Maryland at College Park. Dept. of Computer Science, S. Pawagi, I. V. Ramakrishnan · Yayınevi bilinmiyor

26 sayfa · 1985

Parallel processing (Electronic computers)

AlgorithmsGraph Algorithms on Fixed-interconnection SIMD ComputersUniversity of Maryland at College Park. Dept. of Computer Science, P. S. Gopalakrishnan, I. V. Ramakrishnan, L. N. Kanal

Graph Algorithms on Fixed-interconnection SIMD Computers

University of Maryland at College Park. Dept. of Computer Science, P. S. Gopalakrishnan, I. V. Ramakrishnan, L. N. Kanal · Yayınevi bilinmiyor

36 sayfa · 1985

Algorithms

CiltTerm Matching on Parallel ComputersState University of New York at Stony Brook. Department of Computer Science, R. Ramesh, R. M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan

Term Matching on Parallel Computers

State University of New York at Stony Brook. Department of Computer Science, R. Ramesh, R. M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan · Yayınevi bilinmiyor

Sayfa sayısı yok · 1986

Kategori yok

Graph theoryAn Efficient Connected Components Algorithm on a Mesh-connected ComputerUniversity of Maryland at College Park. Computer Science Center, P. S. Gopalakrishnan, I. V. Ramakrishnan, L. N. Kanal

An Efficient Connected Components Algorithm on a Mesh-connected Computer

University of Maryland at College Park. Computer Science Center, P. S. Gopalakrishnan, I. V. Ramakrishnan, L. N. Kanal · Yayınevi bilinmiyor

22 sayfa · 1985

Graph theory

Directed graphsComputing Tree Functions on SIMD ComputersUniversity of Maryland at College Park. Computer Science Center, P. S. Gopalakrishnan, I. V. Ramakrishnan, L. N. Kanal

Computing Tree Functions on SIMD Computers

University of Maryland at College Park. Computer Science Center, P. S. Gopalakrishnan, I. V. Ramakrishnan, L. N. Kanal · Yayınevi bilinmiyor

21 sayfa · 1985

Directed graphs

AlgorithmsRobust matrix multiplication algorithms for VLSI.P. J. Varman, I. V. Ramakrishnan, University of Texas at Austin. Department of Computer Sciences, D. Fussell

Robust matrix multiplication algorithms for VLSI.

P. J. Varman, I. V. Ramakrishnan, University of Texas at Austin. Department of Computer Sciences, D. Fussell · Yayınevi bilinmiyor

Sayfa sayısı yok · 1983

Algorithms

CiltParallel Update of Minimal Spanning Trees in Logarithmic TimeUniversity of Maryland at College Park. Computer Science Center, I. V. Ramakrishnan, S. Pawagi

Parallel Update of Minimal Spanning Trees in Logarithmic Time

University of Maryland at College Park. Computer Science Center, I. V. Ramakrishnan, S. Pawagi · Yayınevi bilinmiyor

Sayfa sayısı yok · 1984

Kategori yok

CiltOptimal Time Parallel Algorithms for Term MatchingState University of New York at Stony Brook. Department of Computer Science, R. M. Verma, I. V. Ramakrishnan

Optimal Time Parallel Algorithms for Term Matching

State University of New York at Stony Brook. Department of Computer Science, R. M. Verma, I. V. Ramakrishnan · Yayınevi bilinmiyor

Sayfa sayısı yok · 1987

Kategori yok

Computational complexityFast Incremental Parallel Algorithms for Graph Problems on PRAMsUniversity of Maryland at College Park. Dept. of Computer Science, D. D. Sherlekar, S. Pawagi, I. V. Ramakrishnan

Fast Incremental Parallel Algorithms for Graph Problems on PRAMs

University of Maryland at College Park. Dept. of Computer Science, D. D. Sherlekar, S. Pawagi, I. V. Ramakrishnan · Yayınevi bilinmiyor

24 sayfa · 1985

Computational complexity

CiltAn Efficient Parallel Algorithm for Term MatchingState University of New York at Stony Brook. Department of Computer Science, R. M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan

An Efficient Parallel Algorithm for Term Matching

State University of New York at Stony Brook. Department of Computer Science, R. M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan · Yayınevi bilinmiyor

Sayfa sayısı yok · 1986

Kategori yok

CiltOn Mapping Cube Graphs Onto Linear Systolic ArraysUniversity of Texas at Austin. Department of Computer Sciences, I. V. Ramakrishnan

On Mapping Cube Graphs Onto Linear Systolic Arrays

University of Texas at Austin. Department of Computer Sciences, I. V. Ramakrishnan · Yayınevi bilinmiyor

Sayfa sayısı yok · 1983

Kategori yok

AlgorithmsRobust systolic algorithms for relational database operationsP. J. Varman, University of Texas at Austin. Department of Computer Sciences, I. V. Ramakrishnan

Robust systolic algorithms for relational database operations

P. J. Varman, University of Texas at Austin. Department of Computer Sciences, I. V. Ramakrishnan · Yayınevi bilinmiyor

Sayfa sayısı yok · 1983

Algorithms