default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEugene Perevalov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i6]Eugene Perevalov, Rick S. Blum, Xun Chen, Anthony R. Nigara:
Route Discovery and Capacity of Ad hoc Networks. CoRR abs/2202.09423 (2022)
2010 – 2019
- 2013
- [i5]Eugene Perevalov, David Grace:
Towards the full information chain theory: expected loss and information relevance. CoRR abs/1301.2020 (2013) - [i4]Eugene Perevalov, David Grace:
Information-related complexity: a problem-oriented approach. CoRR abs/1301.4211 (2013) - [i3]Eugene Perevalov, David Grace:
Towards the full information chain theory: solution methods for optimal information acquisition problem. CoRR abs/1302.0070 (2013) - 2012
- [i2]Eugene Perevalov, David Grace:
Towards the full information chain theory: question difficulty. CoRR abs/1212.2693 (2012) - [i1]Eugene Perevalov, David Grace:
Towards the full information chain theory: answer depth and source models. CoRR abs/1212.2696 (2012)
2000 – 2009
- 2008
- [j6]Qunhong Tang, George R. Wilson, Eugene Perevalov:
An approximation manpower planning model for after-sales field service support. Comput. Oper. Res. 35(11): 3479-3488 (2008) - 2007
- [j5]Eugene Perevalov, Rick S. Blum, Xun Chen, Anthony R. Nigara:
Throughput Capacity of Ad Hoc Networks with Route Discovery. EURASIP J. Wirel. Commun. Netw. 2007 (2007) - [j4]Eugene Perevalov, Rick S. Blum, Danny Safi:
On the Throughput Capacity of Large Wireless Ad Hoc Networks Confined to a Region of Fixed Area. EURASIP J. Wirel. Commun. Netw. 2007 (2007) - [j3]Eugene Perevalov, Danny Safi, Lang Lin, Rick S. Blum:
Spatial Multiplexing Gains for Realistic Sized Ad Hoc Networks with Directional Antenna Arrays. EURASIP J. Wirel. Commun. Netw. 2007 (2007) - 2006
- [j2]Eugene Perevalov, Rick S. Blum, Danny Safi:
Capacity of Clustered Ad Hoc Networks: How Large Is "Large"? IEEE Trans. Commun. 54(9): 1672-1681 (2006) - [c6]Eugene Perevalov, Rick S. Blum, Xun Chen, Anthony R. Nigara:
On Route Discovery Success in Ad hoc Networks. CISS 2006: 717-722 - 2005
- [c5]Eugene Perevalov, Rick S. Blum, Anthony R. Nigara, Xun Chen:
Route discovery and capacity of ad hoc networks. GLOBECOM 2005: 6 - [c4]Eugene Perevalov, Rick S. Blum, Danny Safi:
Threshold effect in the throughput of large clustered ad hoc networks. GLOBECOM 2005: 6 - [c3]Eugene Perevalov, Rick S. Blum, Danny Safi:
On the capacity of ad hoc networks with clustering. WCNC 2005: 632-637 - 2004
- [j1]Eugene Perevalov, Rick S. Blum
:
Delay-limited throughput of ad hoc networks. IEEE Trans. Commun. 52(11): 1957-1968 (2004) - 2003
- [c2]Eugene Perevalov, Rick S. Blum:
Delay Limited Capacity of Ad hoc Networks: Asymptotically Optimal Transmission and Relaying Strategy. INFOCOM 2003: 1575-1582 - 2002
- [c1]Eugene Perevalov, Rick S. Blum:
On the delay limited capacity of ad hoc networks. GLOBECOM 2002: 32-36
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:48 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:
