725 search results - page 94 / 145 » Bounding Degrees on RPL |
SIAMDM
2008
13 years 9 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
TIT
2008
13 years 9 months ago
2008
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
DM
2002
13 years 9 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
MST
1998
13 years 9 months ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherā...
PAIRING
2010
Springer
13 years 8 months ago
2010
Springer
This paper presents a novel method for designing compact yet eļ¬cient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...