default search action
Sibsankar Haldar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j13]Sibsankar Haldar, Krishnamurthy Vidyasankar:
On space-optimality of buffer-based conflict-free constructions of 1-writer 1-reader multivalued atomic variables from safe bits. J. Parallel Distributed Comput. 69(1): 20-27 (2009) - 2007
- [j12]Sibsankar Haldar, K. Vidyasankar:
On specification of Read/Write shared variables. J. ACM 54(6): 31 (2007) - 2005
- [j11]Sibsankar Haldar:
Constructing regular variables in message passing systems. J. Parallel Distributed Comput. 65(1): 15-28 (2005) - 2002
- [j10]Sibsankar Haldar, Paul M. B. Vitányi:
Bounded concurrent timestamp systems using vector clocks. J. ACM 49(1): 101-126 (2002) - 2001
- [i1]Sibsankar Haldar, Paul M. B. Vitányi:
Bounded Concurrent Timestamp Systems Using Vector Clocks. CoRR cs.DC/0108002 (2001)
1990 – 1999
- 1999
- [c3]Jerry Baulier, Philip Bohannon, S. Gogate, C. Gupta, Sibsankar Haldar, S. Joshi, A. Khivesera, Henry F. Korth, Peter McIlroy, J. Miller, P. P. S. Narayan, M. Nemeth, Rajeev Rastogi, S. Seshadri, Abraham Silberschatz, S. Sudarshan, M. Wilder, C. Wei:
DataBlitz Storage Manager: Main Memory Database Performance for Critical Applications. SIGMOD Conference 1999: 519-520 - 1996
- [j9]Sibsankar Haldar, K. Vidyasankar:
Simple Extensions of 1-writer Atomic Variable Constructions to Multiwriter Ones. Acta Informatica 33(2): 177-202 (1996) - [c2]Sibsankar Haldar, K. Vidyasankar:
Space-Efficient Construction of Buffer-Optimal 1-Writer 1-Reader Multivalued Atomic Variable (Abstract). PODC 1996: 178 - 1995
- [j8]Sibsankar Haldar, K. Vidyasankar:
Constructing 1-Writer Multireader Multivalued Atomic Variable from Regular Variables. J. ACM 42(1): 186-203 (1995) - [j7]Sibsankar Haldar, K. Vidyasankar:
Buffer-Optimal Constructions of 1-Writer Multireader Multivalued Atomic Shared Variables. J. Parallel Distributed Comput. 31(2): 174-180 (1995) - 1994
- [c1]Sibsankar Haldar, P. S. Subramanian:
Space-optimum Conflict-free Construction of 1-Writer 1-Reader Multivalued Atomic Variable. WDAG 1994: 116-129 - 1993
- [j6]Sibsankar Haldar, D. K. Subramanian:
An Affinity-Based Dynamic Load Balancing Protocol for Distributed Tansaction Processing Systems. Perform. Evaluation 17(1): 53-71 (1993) - 1992
- [j5]Sibsankar Haldar, D. K. Subramanian:
A Modified Round Robin Scheduler for Time-Sharing Systems. Comput. J. 35(Additional-Papers): A309-A315 (1992) - [j4]Sibsankar Haldar, K. Vidyasankar:
Counteraxamples to a One Writer Multireader Atomic Variable Construction of Burns and Peterson. ACM SIGOPS Oper. Syst. Rev. 26(1): 78-88 (1992) - 1991
- [j3]Sibsankar Haldar, D. K. Subramanian:
Fairness in Processor Scheduling in Time Sharing Systems. ACM SIGOPS Oper. Syst. Rev. 25(1): 4-18 (1991)
1980 – 1989
- 1988
- [j2]Sibsankar Haldar, D. K. Subramanian:
Ring Based Termination Detection Algorithm for Distributed Computations. Inf. Process. Lett. 29(3): 149-153 (1988) - [j1]Sibsankar Haldar, D. K. Subramanian:
An Efficient Solution to the Mutual Exclusion Problem Using Unfair and Weak Semaphore. ACM SIGOPS Oper. Syst. Rev. 22(2): 60-66 (1988)
Coauthor Index
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 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint