合 作 者
期刊 & 会议
年  份
Chenyu Yan 的论文(33) 排序方式:
Improving Cost, Performance, and Security of Memory Encryption and Authentication  
Protection from hardware attacks such as snoopers and mod chips has been receiving increasing attention in computer architecture. This paper presents a new combined memory encryption/authentication sc......
International Symposium on Computer Architecture  2006
30次引用 0 0
I.: Collective tree spanners of graphs  
Abstract. In this paper we introduce a new notion of collective tree spanners. We say that a graph G =(V,E) admits a system of µ collective additive tree r-spanners if there is a system T (G) of at mo......
Siam Journal on Discrete Mathematics  2006
18次引用 0 0
Improving Cost, Performance, and Security of Memory Encryption and Authentication  
Protection from hardware attacks such as snoopers and mod chips has been receiving increasing attention in computer architecture. This paper presents a new combined memory encryption/authentication sc......
ACM Sigarch Computer Architecture News  2006
13次引用 0 0
Additive Spanners for k-Chordal Graphs  
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O(n · log n) edges. Thi......
Italian Conference on Algorithms and Complexity  2003
13次引用 0 0
Collective Tree Spanners and Routing in AT-free Related Graphs  
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V,E) admits a system of µ collective ad......
Workshop on Graph-Theoretic Concepts in Computer Science  2004
7次引用 0 0
Spanners for bounded tree-length graphs  
This paper concerns construction of additive stretched spanners with few edges for n-vertex graphs having a tree-decomposition into bags of diameter at most δ, i.e., the tree-length δ graphs. For such......
Theoretical Computer Science  2007
6次引用 0 0
Collective Tree 1-Spanners for Interval Graphs  
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span ” an interval graph G. Inparticular, for any pair of vertices u, v we require a tree T ∈T su......
Workshop on Graph-Theoretic Concepts in Computer Science  2005
4次引用 0 0
Effiziente Algorithmen f眉r Baumspanner in chordalen Graphen  
 1994
4次引用 0 0
A novel frequency offset estimation method for OFDM systems with large estimation range  
In this paper, we proposed a novel frequency synchronization method which has larger estimation range than conventional method proposed by Tufvesson. A two steps frequency offset estimation method is ......
IEEE Transactions on Broadcasting  2006
4次引用 0 0
Additive sparse spanners for graphs with bounded length of largest induced cycle  
In this paper, we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n-2 edges and an additive 3-spanner with at most O(n log n) edges. This significa......
Theoretical Computer Science  2005
4次引用 0 0

1/4 第一页 上一页 1 2 3 4 下一页
Feedback
Feedback
Feedback
我想反馈:
排行榜