The following pages link to I. V. Ramakrishnan (Q689095):
Displayed 43 items.
- Programming in equational logic: Beyond strong sequentiality (Q689097) (← links)
- Approximate algorithms for the Knapsack problem on parallel computers (Q757041) (← links)
- An O(log n) algorithm for parallel update of minimum spanning trees (Q1075769) (← links)
- Fault-tolerance VLSI sorters (Q1108014) (← links)
- Computing dominators in parallel (Q1108035) (← links)
- Tight complexity bounds for term matching problems (Q1201724) (← links)
- Precise specification matching for adaptive reuse in embedded systems (Q2372190) (← links)
- (Q2751378) (← links)
- (Q2754127) (← links)
- (Q2766790) (← links)
- (Q2767132) (← links)
- BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS (Q3021960) (← links)
- Modular Matrix Multiplication on a Linear Array (Q3334071) (← links)
- A Robust Matrix-Multiplication Array (Q3336684) (← links)
- A Paradigm for the Design of Parallel Algorithms with Applications (Q3659130) (← links)
- (Q3687714) (← links)
- (Q3692849) (← links)
- Mapping Homogeneous Graphs on Linear Arrays (Q3709902) (← links)
- (Q3732971) (← links)
- Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays (Q3757394) (← links)
- (Q3761692) (← links)
- (Q3793740) (← links)
- (Q3817659) (← links)
- Optimal matrix multiplication on fault-tolerant VLSI arrays (Q3823791) (← links)
- (Q4038705) (← links)
- Efficient access mechanisms for tabled logic programs (Q4223452) (← links)
- (Q4494372) (← links)
- (Q4501591) (← links)
- (Q4518873) (← links)
- (Q4518894) (← links)
- (Q4551131) (← links)
- (Q4736510) (← links)
- (Q4736511) (← links)
- (Q4809159) (← links)
- Inference in probabilistic logic programs with continuous random variables (Q4911131) (← links)
- (Q4938606) (← links)
- (Q4944884) (← links)
- Associative-commutative discrimination nets (Q5044725) (← links)
- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution (Q5055735) (← links)
- Some complexity theoretic aspects of AC rewriting (Q5096174) (← links)
- Functional and Logic Programming (Q5308010) (← links)
- Deductive Spreadsheets Using Tabled Logic Programming (Q5449616) (← links)
- Subsumption algorithms based on search trees (Q5878906) (← links)