FOREWORD
スポンサーリンク
概要
著者
関連論文
- A (2-c(logN)/N)-Approximation Algorithm for the Stable Marriage Problem(Invited Papers from New Horizons in Computing)
- A Tight Upper Bound on Online Buffer Management for Multi-Queue Switches with Bicodal Buffers
- A Tight Bound on Online Buffer Management for Two-Port Shared-Memory Switches
- The Online Graph Exploration Problem on Restricted Graphs
- FOREWORD