设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
SpringerLink电子期刊(29)
Elsevier电子期刊(17)
在“
Elsevier电子期刊
”中,
命中:
17
条,耗时:0.0339833 秒
在所有数据库中总计命中:
46
条
1.
Self-stabilizing labeling and ranking in ordered trees
作者:
Ajoy K. Datta
;
St茅phane Devismes
;
Lawrence
L.
Larmore
;
Yvan Rivierre
关键词:
Self-stabilization
;
Tree networks
;
Tree labeling
;
Guide pair
;
Ranking
刊名:Theoretical Computer Science
出版年:11 November, 2013
2.
A self-stabilizing
k
-clustering algorithm for weighted graphs
作者:
Eddy Caron
;
Ajoy K. Datta
;
Benjamin Depardon
;
Lawrence
L.
Larmore
关键词:
;
none
;
color
;
black"" href=""/science?_ob=MathURL&_method=retrieve&_udi=B6WKJ-50GWN6D-1&_mathId=mml46&_user=10&_cdi=6908&_pii=S0743731510001206&_rdoc=8&_issn=07437315&_acct=C000050221&_version=1&_userid=10&md5=f5c
刊名:Journal of Parallel and Distributed Computing
出版年:2010
3.
A quadratic time 2-approximation algorithm for block sorting
作者:
Wolfgang W. Bein
;
Lawrence
L.
Larmore
;
Linda Morales
;
I. Hal Sudborough
关键词:
Design and analysis of algorithms
;
Approximation algorithms
;
Block sorting
;
Transposition sorting
;
Optical character recognition
刊名:Theoretical Computer Science
出版年:2009
4.
Optimally competitive list batching
作者:
Wolfgang Bein
;
Leah Epstein
;
Lawrence
L.
Larmore
;
John Noga
关键词:
Design of algorithms
;
Online algorithms
;
Batching
;
TCP acknowledgment
刊名:Theoretical Computer Science
出版年:2009
5.
Space efficient and time optimal distributed BFS tree construction
作者:
Christian Boulinier
;
Ajoy K. Datta
;
Lawrence
L.
Larmore
;
Franck Petit
关键词:
BFS tree
;
Distributed computing
刊名:Information Processing Letters
出版年:2008
6.
Uniform metrical task systems with a limited number of states
作者:
Wolfgang Bein
;
Lawrence
L.
Larmore
;
John Noga
关键词:
Design of algorithms
;
Online algorithms
;
Randomized algorithms
刊名:Information Processing Letters
出版年:2007
7.
The algebraic Monge property and path problems
作者:
Bein
;
Wolfgang
;
Brucker
;
Peter
;
L.
Larmore
;
Lawrence
;
K. Park
;
James
关键词:
Monge property
;
Algebraic Monge matrices
;
Bottleneck shortest path problems
;
Combinatorial optimization
刊名:Discrete Applied Mathematics
出版年:2005
8.
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
作者:
Bradford
;
Phil
;
Golin
;
Mordecai J.
;
Larmore
;
Lawrence
L.
;
Rytter
;
Wojciech
刊名:Journal of Algorithms
出版年:2002
9.
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
作者:
Berman
;
Piotr
;
Karpinski
;
Marek
;
Larmore
;
Lawrence
L.
;
Plandowski
;
Wojciech
;
Rytter
;
Wojciech
刊名:Journal of Computer and System Sciences
出版年:2002
10.
Trackless online algorithms for the server problem
作者:
Bein
;
Wolfgang W.
;
Larmore
;
Lawrence
L.
关键词:
Design of algorithms
;
Online algorithms
;
Randomized algorithms
;
Competitive analysis
;
k
-server problem
;
Paging
刊名:Information Processing Letters
出版年:2000
1
2
按检索点细分(17)
作者(17)
按出版年细分(17)
2010年(1)
2009年(2)
2008年(1)
2007年(1)
2005年(1)
2002年(2)
2000年(2)
2000年及以前(7)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.