![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Pranay Chaudhuri
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [j40]Amrit Agrawal, Pranay Chaudhuri:
An Algorithm for Task Scheduling in Heterogeneous Distributed Systems Using Task Duplication. Int. J. Grid High Perform. Comput. 3(1): 89-97 (2011) - [j39]Hussein Thompson, Pranay Chaudhuri:
An alternative visual analysis of the build heap algorithm. Inroads 2(3): 31-32 (2011) - [j38]Pranay Chaudhuri, Hussein Thompson:
Improved Self-Stabilizing Algorithms for L(2, 1)-Labeling Tree Networks. Math. Comput. Sci. 5(1): 27-39 (2011) - 2010
- [j37]Pranay Chaudhuri, Jeffrey Elcock:
Process Scheduling in Heterogeneous Multiprocessor Systems Using Task Duplication. Int. J. Bus. Data Commun. Netw. 6(1): 58-69 (2010) - [j36]Pranay Chaudhuri, Jeffrey Elcock:
Scheduling DAG-based applications in multicluster environments with background workload using task duplication. Int. J. Comput. Math. 87(11): 2387-2397 (2010) - [i1]Neetu Singh, S. P. Ghrera, Pranay Chaudhuri:
Denial of Service Attack: Analysis of Network Traffic Anormaly using Queuing Theory. CoRR abs/1006.2807 (2010)
2000 – 2009
- 2008
- [j35]Sahadeb Jana, Debashis Saha
, Amitava Mukherjee
, Pranay Chaudhuri:
A novel approach for assigning wavelengths in multihop WDM optical networks. Comput. Commun. 31(9): 1751-1762 (2008) - [j34]Pranay Chaudhuri, Thomas Edward:
An algorithm for k-mutual exclusion in decentralized systems. Comput. Commun. 31(14): 3223-3235 (2008) - [j33]Pranay Chaudhuri, Jeffrey Elcock:
Task scheduling in multiprocessing systems using duplication. J. Syst. Archit. 54(5): 519-529 (2008) - [j32]Pranay Chaudhuri, Hussein Thompson:
A self-stabilizing algorithm for the st-order problem. Int. J. Parallel Emergent Distributed Syst. 23(3): 219-234 (2008) - 2007
- [j31]Pranay Chaudhuri, Hussein Thompson:
A self-stabilizing distributed algorithm for edge-coloring general graphs. Australas. J Comb. 38: 237-248 (2007) - 2006
- [j30]Pranay Chaudhuri, Thomas Edward:
An O(vn) Distributed Mutual Exclusion Algorithm Using Queue Migration. J. Univers. Comput. Sci. 12(2): 140-159 (2006) - [e1]Sio Iong Ao, Jeong-A Lee, Oscar Castillo, Pranay Chaudhuri, David Dagan Feng:
Proceedings of the International MultiConference of Engineers and Computer Scientists 2006, IMECS '06, June 20-22, 2006, Hong Kong, China. Lecture Notes in Engineering and Computer Science, Newswood Limited 2006, ISBN 988-98671-3-3 [contents] - 2005
- [j29]Pranay Chaudhuri, Hussein Thompson:
Self-stabilizing tree ranking. Int. J. Comput. Math. 82(5): 529-539 (2005) - [c5]Pranay Chaudhuri, Hussein Thompson:
A Self-Stabilizing Algorithm for L(2, 1)-Labeling Trees. Parallel and Distributed Computing and Networks 2005: 627-632 - [c4]Pranay Chaudhuri, Hussein Thompson:
A Self-Stabilizing Algorithm for Radio-Coloring Directed Trees. Parallel and Distributed Computing and Networks 2005: 633-637 - 2004
- [j28]Pranay Chaudhuri, Hussein Thompson:
A self-stabilizing graph algorithm: finding the cutting center of a tree. Int. J. Comput. Math. 81(2): 183-190 (2004) - [j27]Pranay Chaudhuri, Hussein Thompson:
A Message-Optimal Distributed Graph Algorithm: Partial Precedence Constrained Scheduling. J. Univers. Comput. Sci. 10(2): 96-109 (2004) - 2003
- [j26]Colin Depradine, Pranay Chaudhuri:
P3: a code and design conventions preprocessor for Java. Softw. Pract. Exp. 33(1): 61-76 (2003) - [c3]Pranay Chaudhuri, Thomas Edward:
A Token Based Self-Stabilizing Mutual Exclusion Algorithm. PDPTA 2003: 1454-1459 - [c2]Pranay Chaudhuri, Hussein Thompson:
A Self-Stabilizing Algorithm for Finding the Cutting Center of a Tree. PDPTA 2003: 1460-1463 - 2002
- [j25]Mehmet Hakan Karaata, Pranay Chaudhuri:
A Dynamic Self-Stabilizing Algorithm for Constructing a Transport Net. Computing 68(2): 143-161 (2002) - [j24]Pranay Chaudhuri:
An optimal distributed algorithm for finding a set of fundamental cycles in a graph. Comput. Syst. Sci. Eng. 17(1): 41-47 (2002) - [c1]Sahadeb Jana, Debashis Saha
, Amitava Mukherjee
, Pranay Chaudhuri:
A Fast Technique for Assigning Wavelengths in WDM All-Optical Networks (AONs). IWDC 2002: 290-299
1990 – 1999
- 1999
- [j23]Pranay Chaudhuri:
An $O(n^2)$ Self-Stabilizing Algorithm for Computing Bridge-Connected Components. Computing 62(1): 55-67 (1999) - [j22]Mehmet Hakan Karaata, Pranay Chaudhuri:
A Self-Stabilizing Algorithm for Bridge Finding. Distributed Comput. 12(1): 47-53 (1999) - [j21]Pranay Chaudhuri:
A Self-Stabilizing Algorithm for Minimum-Depth Search of Graphs. Inf. Sci. 118(1-4): 241-249 (1999) - [j20]Pranay Chaudhuri:
A Self-Stabilizing Algorithm for Detecting Fundamental Cycles in a Graph. J. Comput. Syst. Sci. 59(1): 84-93 (1999) - [j19]Pranay Chaudhuri:
A note on self-stabilizing articulation point detection. J. Syst. Archit. 45(14): 1249-1252 (1999) - 1998
- [j18]Pranay Chaudhuri:
An optimal distributed algorithm for finding articulation points in a network. Comput. Commun. 21(18): 1707-1715 (1998) - [j17]Mehmet Hakan Karaata, Pranay Chaudhuri:
A Self-Stabilizing Algorithm for Strong Fairness. Computing 60(3): 217-228 (1998) - [j16]Pranay Chaudhuri, Mehmet Hakan Karaata:
An O(n1/3) algorithm for distributed mutual exclusion. J. Syst. Archit. 45(5): 409-420 (1998) - [j15]Pranay Chaudhuri:
Parallel Incremental Algorithms for Analyzing Activity Networks. Parallel Algorithms Appl. 13(2): 153-165 (1998) - 1997
- [j14]Pranay Chaudhuri:
An Optimal Distributed Algorithm for Computing Bridge-Connected. Comput. J. 40(4): 200-207 (1997) - 1996
- [j13]Pranay Chaudhuri:
Parallel updating algorithms for graph searching problems. J. Syst. Archit. 42(4): 315-325 (1996) - [j12]Pranay Chaudhuri:
Finding Centers and Medians of Graphs in Parallel. Parallel Algorithms Appl. 9(1-2): 111-118 (1996) - 1995
- [j11]Pranay Chaudhuri:
An algorithm for distributed mutual exclusion. Inf. Softw. Technol. 37(7): 375-381 (1995) - [j10]Pranay Chaudhuri, Asad A. Ismaeel:
Algorithms for Finding and Updating Minimum-Depth Spanning Trees in Parallel. Inf. Sci. 87(1-3): 171-183 (1995) - 1994
- [j9]Pranay Chaudhuri:
An Efficient Distributed Bridge-Finding Algorithm. Inf. Sci. 81(1-2): 73-85 (1994) - [j8]Pranay Chaudhuri:
Finding maximum matching for bipartite graphs in parallel. Oper. Res. Lett. 16(1): 47-49 (1994) - 1992
- [b1]Pranay Chaudhuri:
Parallel algorithms - designs and analysis. Advances in computer science series, Prentice Hall 1992, ISBN 978-0-13-351982-2, pp. I-XIV, 1-314 - [j7]Pranay Chaudhuri:
Parallel Search Algorithms for Trees and Graphs. Aust. Comput. J. 24(2): 61-69 (1992) - [j6]Pranay Chaudhuri:
Distributed processing of graphs: Fundamental cycles algorithm. Inf. Sci. 60(1-2): 41-50 (1992) - 1991
- [j5]Pranay Chaudhuri:
Optimal algorithm for mutual exclusion in mesh-connected computer networks. Comput. Commun. 14(10): 627-632 (1991)
1980 – 1989
- 1988
- [j4]Pranay Chaudhuri:
Fast Parallel Graph Searching with Applications. BIT 28(1): 1-18 (1988) - 1987
- [j3]Pranay Chaudhuri:
Algorithms for some graph problems on a distributed computational model. Inf. Sci. 43(3): 205-228 (1987) - 1986
- [j2]Pranay Chaudhuri, Ratan K. Ghosh:
Parallel Algorithms for Analyzing Activity Networks. BIT 26(4): 418-429 (1986) - 1985
- [j1]Pranay Chaudhuri:
Scheduler for realtime process control. Microprocess. Microsystems 9(3): 114-117 (1985)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint