![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Esther Jennings
Person information
Refine list
![note](https://dblp1.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
- [c13]John Segui, Esther Jennings, Scott C. Burleigh:
Enhancing Contact Graph Routing for Delay Tolerant Space Networking. GLOBECOM 2011: 1-6
2000 – 2009
- 2007
- [c12]Kul B. Bhasin, Chuck Putt, Jeffrey L. Hayden, Shirley Tseng, Abi Biswas, Brian Kennedy, Esther Jennings, Ron Miller, John J. Hudiburg, Dave Miller, Alan Jeffries, Tom Sartwell:
Architecting the Communication and Navigation Networks for NASA's Space Exploration Systems. SoSE 2007: 1-6 - 2001
- [c11]Esther Jennings, Lenka Motyckova, David A. Carr:
Evaluating graph theoretic clustering algorithms for reliable multicasting. GLOBECOM 2001: 1688-1692 - 2000
- [c10]Lenka Motyckova, David A. Carr, Esther Jennings:
A Cluster-Ring Topology for Reliable Multicasting. PDPTA 2000
1990 – 1999
- 1999
- [j2]Esther Jennings:
Distributed Algorithms for Finding Central Paths in Tree Networks. Comput. J. 42(7): 609-612 (1999) - [c9]Lenka Motyckova, Esther Jennings:
A clustering structure for reliable multicasting. ICCCN 1999: 378-383 - 1998
- [c8]Esther Jennings, Svante Carlsson:
An optimal distributed 3-edge-connected component algorithm. SIROCCO 1998: 129-144 - 1996
- [j1]Glenn Jennings, Esther Jennings:
A discrete syntax for level-sensitive latched circuits having n clocks and m phases. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(1): 111-126 (1996) - [c7]Esther Jennings, Lenka Motyckova:
Distributed Algorithms for Sparse k-Connectivity Certificates (Abstract). PODC 1996: 180 - [c6]Esther Jennings, Lenka Motyckova:
Distributed Computation and Incremental Maintainance of 3-Edge-Connected Components. SIROCCO 1996: 224-240 - 1995
- [c5]Esther Jennings:
Distributed Algorithm for Finding a Core of a Tree Network. SOFSEM 1995: 385-390 - 1994
- [c4]Esther Jennings, Lenka Motyckova:
Distributed Algorithms for Finding Small Cycle Covers in Arbitrary Networks. ISAAC 1994: 110-118 - 1992
- [c3]Esther Jennings, Andrzej Lingas:
On the Relationship among Constrained Geometric Structures. ISAAC 1992: 289-298 - [c2]Esther Jennings, Lenka Motyckova:
A Distributed Algorithm for finding All Maximal Cliques in a Network Graph. LATIN 1992: 281-293 - 1991
- [c1]Esther Jennings, Andrzej Lingas, Lenka Motyckova:
Dynamic Detection of Forest of Tree-Connected Meshes. ICPP (3) 1991: 300-301
Coauthor Index
![](https://dblp1.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