dblp.uni-trier.dewww.uni-trier.de

Falguni Sarkar

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

1997
9EEMaria Cristina Pinotti, Sajal K. Das, Falguni Sarkar: Conflict-Free Template Access in k-ary and Binomial Trees. International Conference on Supercomputing 1997: 237-244
8EEFalguni Sarkar, Sajal K. Das: Design and Implementation of Dynamic Load Balancing Algorithms for Rollback Reduction in Optimistic PDES. MASCOTS 1997: 26-31
1996
7 Sajal K. Das, Maria Cristina Pinotti, Falguni Sarkar: Distributed Priority Queues on Hypercube Architectures. ICDCS 1996: 620-628
6EESajal K. Das, Maria Cristina Pinotti, Falguni Sarkar: Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes. IEEE Trans. Parallel Distrib. Syst. 7(6): 555-564 (1996)
5EESajal K. Das, Maria Cristina Pinotti, Falguni Sarkar: Correction to "Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes". IEEE Trans. Parallel Distrib. Syst. 7(8): 896 (1996)
1995
4EESajal K. Das, Falguni Sarkar: A hypercube algorithm for GVT computation and its application in optimistic parallel simulation. Annual Simulation Symposium 1995: 51-
3EESabine R. Öhring, Falguni Sarkar, Sajal K. Das, Dirk H. Hohndel: Cayley graph connected cycles: A new class of fixed-degree interconnection networks. HICSS (2) 1995: 479-488
2 Sajal K. Das, Falguni Sarkar, Maria Cristina Pinotti: Conflict-Free Path Access of Trees in Parallel Memory Systems with Application to Distributed Heap Implementation. ICPP (3) 1995: 164-167
1 Sajal K. Das, Falguni Sarkar, Kalyan Basu, Seshu Madhavapeddy: Parallel Discrete Event Simulation in Star Networks with Application to Telecommunications. MASCOTS 1995: 66-71

Coauthor Index

1Kalyan Basu [1]
2Sajal K. Das [1] [2] [3] [4] [5] [6] [7] [8] [9]
3Dirk H. Hohndel [3]
4Seshu Madhavapeddy [1]
5Sabine R. Öhring [3]
6Maria Cristina Pinotti [2] [5] [6] [7] [9]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)