default search action
Eshrat Arjomandi
Person information
- affiliation: York University, Toronto, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
- [j6]Tim Brecht, Eshrat Arjomandi, Chang Li, Hang Pham:
Controlling garbage collection and heap growth to reduce the execution time of Java applications. ACM Trans. Program. Lang. Syst. 28(5): 908-941 (2006) - 2001
- [c8]Shuxia Tan, Eshrat Arjomandi, Richard F. Paige, Evan Mamas, Simon Moser, Bill O'Farrell:
Extending the message flow debugger for MQSI. CASCON 2001: 15 - [c7]Tim Brecht, Eshrat Arjomandi, Chang Li, Hang Pham:
Controlling Garbage Collection and Heap Growth to Reduce the Execution Time of Java Applications. OOPSLA 2001: 353-366
1990 – 1999
- 1996
- [j5]Eshrat Arjomandi, William G. O'Farrell, Gregory V. Wilson:
Smart Messages: An Object-Oriented Communication Mechanism for Parallel Systems. Comput. Syst. 9(4): 313-329 (1996) - [c6]Eshrat Arjomandi, William G. O'Farrell, Gregory V. Wilson:
Smart Messages: An Object-Oriented Communication Mechanism. COOTS 1996 - 1995
- [j4]Eshrat Arjomandi, William G. O'Farrell, Ivan Kalas, Gita Koblents, Frank Ch. Eigler, Guang R. Gao:
ABC++: Concurrency by Inheritance in C++. IBM Syst. J. 34(1): 120-137 (1995) - 1994
- [c5]Ivan Kalas, Eshrat Arjomandi, Guang R. Gao, William G. O'Farrell:
FTL: a multithreaded environment for parallel computation. CASCON 1994: 33 - 1993
- [c4]Eshrat Arjomandi, Ivan Kalas, William G. O'Farrell:
Concurrency abstractions in a C++ class library. CASCON 1993: 919-932 - 1992
- [c3]Eshrat Arjomandi, William G. O'Farrell:
Concurrency issues in C++. CASCON 1992: 347-358
1980 – 1989
- 1985
- [j3]Andranik Mirzaian, Eshrat Arjomandi:
Selection in X+Y and Matrices With Sorted Rows and Columns. Inf. Process. Lett. 20(1): 13-17 (1985) - 1983
- [j2]Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch:
Efficiency of Synchronous Versus Asynchronous Distributed Systems. J. ACM 30(3): 449-456 (1983) - 1981
- [c2]Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch:
A Difference in Efficiency between Synchronous and Asynchronous Systems. STOC 1981: 128-132
1970 – 1979
- 1976
- [j1]Eshrat Arjomandi:
On Finding All Unilaterally Connected Components of a Digraph. Inf. Process. Lett. 5(1): 8-10 (1976) - 1975
- [c1]Eshrat Arjomandi, Derek G. Corneil:
Parallel Computations in Graph Theory. FOCS 1975: 13-18
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 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: