Proceedings of the 2017 International Conference on Foundations of Computer Science

FCS'17 Author Index

Editor(s): Hamid R. Arabnia, Fernando G. Tinetti
ISBN: 1-60132-456-1 | Copyright © 2017 CSREA Press | United States of America



Baldwin, C. Ronald
Investigating the Benefits of Parallel Processing for Binary Search

Farrell, Gennifer Elise
Investigating the Benefits of Parallel Processing for Binary Search

Goswami, Naveen Kumar
Critical Graphs for the Minimum-Vertex-Cover Problem

Han, Yijie
Algorithms for the Majority Problem

Hong, Joohwan
Analysis and Evaluation of Locks Designed for NUMA System

Jakoby, Andreas
Critical Graphs for the Minimum-Vertex-Cover Problem

Jung, Seokyong
Analysis and Evaluation of Locks Designed for NUMA System

Ko, Yoomee
User-level Deterministic Replay via Accurate Non-deterministic Event Capture

Lim, Jeongtaek
User-level Deterministic Replay via Accurate Non-deterministic Event Capture

List, Eik
Critical Graphs for the Minimum-Vertex-Cover Problem

Lucks, Stefan
Critical Graphs for the Minimum-Vertex-Cover Problem

Mullins, Paul
Investigating the Benefits of Parallel Processing for Binary Search

Ryu, Minsoo
User-level Deterministic Replay via Accurate Non-deterministic Event Capture  
Analysis and Evaluation of Locks Designed for NUMA System


Tarafdar, Rajarshi
Algorithms for the Majority Problem

Tarek, Ahmed
A New Algorithm for Tiered Binary Search

Yoon, Hosang
User-level Deterministic Replay via Accurate Non-deterministic Event Capture

Yoon, Hyunmin
User-level Deterministic Replay via Accurate Non-deterministic Event Capture

Yun, Kihyun
Analysis and Evaluation of Locks Designed for NUMA System

Zhang, Yong
Some Hardness Results for Distance Dominating Set



Administered by
Universal Conference Management Systems & Support (UCMSS)
** San Diego, California, USA **