Skip to search formSkip to main contentSkip to account menu

Baruch Awerbuch

Baruch Awerbuch (born 1958) is an Israeli-American computer scientist, a professor of computer science at Johns Hopkins University. He is known for… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Asynchronous systemBroadcasting (networking)Byzantine fault toleranceComputer scientist

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Guest Editorial: Technology Supported Assessment in Formal and Informal Learning
Assessment can be considered as a systematic process of making judgments, and consequently reporting results, either about the… 
2011
2011
The struggle for legitimacy : a study of military lawyers in Israel
This thesis examines the involvement of lawyers in Israel Defence Forces operational decisionmaking. By linking the legal… 
2009
2009
Stabilisation instantanée dans les systèmes à passage de messages
Nous abordons le probleme de la \emph{stabilisation instantanee} dans les systemes repartis a passage de messages. Notre… 
2008
2008
A first look at the redesigned site
The invention is directed to 3-oxo-D-homosteroids and derivatives thereof which are useful as antiantigens. 
2001
2001
US postdocs in line for benefits
In response to two reports by the United States National Academy of Sciences (NAS) last year, the National Institutes of Health… 
2001
2001
Judge and jury disagree in Harvard case
A biomathematician who was awarded a jury verdict of gender discrimination against Harvard University has had her case overturned… 
1995
1995
A framework for integrating mobile hosts within the internet
  • 1995
  • Corpus ID: 109803223
Title of Dissertation: A framework for integrating Mobile Hosts within the Internet Pravin Bhagwat, Doctor of Philosophy, 1995… 
Highly Cited
1993
Highly Cited
1993
Competitive distributed file allocation
This paper deals with the file allocation problem [6] concerning the dynamic optimization of communication costs to access data… 
1993
1993
Routing with Polynomial Communication-space Tradeoo Baruch Awerbuch
This paper presents a family of memory-balanced routing schemes that use relatively short paths while storing relatively little… 
1991
1991
Efficient deadlock-free routing
Efficient Deadlock-Free Routing Baruch Awerbuch * Shay Kutten ~ David Peleg $ This paper deals with store-and-forward deadlocks… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)