维普期刊资源整合服务平台（V6.5）

25篇 您的检索式：作者名="B Awerbuch"

选中清除导出查看参考文献查看引证文献引用追踪共2页首页上一页第1页下一页末页 /2 跳转

	题名	作者	年代	出处	被引量
1	Tradeoffs in worst-case equilibria 显示文摘	Awerbuch B Azar Y Richter Y	2006	Theoretical Computer Science(TCS)2006，361，23：	1
2	Approximate distributed bellman-ford algorithms显示文摘	AWERBUCH B BAR-NOY A GOPAL M	1994	IEEE Transactions on Communications1994，42，8：	1
3	An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster显示文摘	AMIR Y AWERBUCH B BORGSTROM R	2000	IEEE Transactions on Parallel and Distributed Systems2000，11，7：	1
4	Distributed BFS algorithms显示文摘	AWERBUCH B G	1985	Foundations of Computer Science1985，，10：	1
5	A new distributed algorithm to find Breadth - First Search tree 显示文摘	Awerbuch B Gallagher R	1987	IEEE Trans Info Theory1987，33，：	1
6	Approximate distributed Bellman-Ford algorithms 显示文摘	AWERBUCH B	1994	IEEE Transactions on Communieations Au1994，42，：	1
7	ODSBR: an on-demand secure byzantine resilient routing protocol for wireless Ad Hoc networks 显示文摘	Awerbuch B Curtmola R Holmer D	2008	ACM Transactions on Information and System Security2008，10，4：	1
8	Topology aggregation for directed graphs显示文摘	Awerbuch B Shavitt Y	2001	IEEE/ACM Transaction on Networking2001，9，1：	1
9	An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster显示文摘	Y Amir B Awerbuch A Barak	2000	IEEE Trans on Parallel and Distributed Systems2000，11，7：	1
10	The medium time met- ric: high throughput route selection in multi-rate ad hoe wireless networks显示文摘	Awerbuch B Holmer D Rubens H	2006	MONET2006，11，2：	1
11	High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks显示文摘	Awerbuch B Holmer D Rubens H	2004	Wireless On-Demand Network Systems2004，3，：	1
12	A new distributed algorithm to find breadth first search trees显示文摘	Awerbuch B Gallager R	1987	IEEE Trans Info Theor1987，33，3：	1
13	Topology aggregation for directed graphs 显示文摘	AWERBUCH B SHAVITT Y	2001	IEEE/ACM Trans on Networking2001，9，1：	1
14	Tradeoffs in worst-case equilibria显示文摘	Awerbuch B Azar Y Richter Y	2006	Theor Comput Sci2006，361，2：	1
15	Distributed paging for general networks显示文摘	Awerbuch B Bartal Y Fiat A	1998	Journal of Algorithms1998，28，：	1
16	Provably competitive adaptive routing显示文摘	Awerbuch B Holmer D Rubens H	2005	IEEE INFOCOM2005，1，1317：	1
17	Near-linear time construction of sparse neighborhood covers显示文摘	Awerbuch B Berger B Cowen L	1999	SIAM Journal on Computing 281999，，1：	1
18	Piecemeal graph exploration by mobile robot显示文摘	Awerbuch B Betke M Rivest R L	1999	Information and Computation1999，152，2：	1
19	The Medium Time Metric:High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks显示文摘	Awerbuch B Holmer D Rubens H	2006	Mobile Networks and Applications2006，11，2：	1
20	The medium time metric:High throughput route selection in multi-rate ad hoc wireless networks显示文摘	Awerbuch B Holmer D Rubens H		0，，02：	1

返回顶部每页显示：

共2页首页上一页第1页下一页末页 /2 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示