Author image not provided
 Kookjin Ahn

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article20.75
Citation Count166
Publication count8
Publication years2009-2015
Available for download4
Average downloads per article414.75
Downloads (cumulative)1,659
Downloads (12 Months)188
Downloads (6 Weeks)18
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


9 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 9 of 9
Sort by:

1 published by ACM
January 2018 ACM Transactions on Parallel Computing (TOPC) - Special Issue on SPAA 2015: Volume 4 Issue 4, September 2018
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 34,   Downloads (Overall): 58

Full text available: PDFPDF
In this article, we consider graph algorithms in models of computation where the space usage (random accessible storage, in addition to the read-only input) is sublinear in the number of edges m and the access to input is constrained. These questions arise in many natural settings, and in particular in ...
Keywords: Maximum matching, primal dual algorithms

2
July 2015 ICML'15: Proceedings of the 32nd International Conference on International Conference on Machine Learning - Volume 37
Publisher: JMLR.org
Bibliometrics:
Citation Count: 1

In this paper, we address the problem of correlation clustering in the dynamic data stream model. The stream consists of updates to the edge weights of a graph on n nodes and the goal is to find a node-partition such that the end-points of negative-weight edges are typically in different ...

3 published by ACM
June 2015 SPAA '15: Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 0,   Downloads (12 Months): 41,   Downloads (Overall): 158

Full text available: PDFPDF
In this paper we consider graph algorithms in models of computation where the space usage (random accessible storage, in addition to the read only input) is sublinear in the number of edges m and the access to input data is constrained. These questions arises in many natural settings, and in ...
Keywords: graph sketching, maximum matching, primal dual algorithms

4
January 2014 SODA '14: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 45

Full text available: PDFPDF
We present the first fully polynomial approximation schemes for the maximum weighted (uncapacitated or capacitated) b -Matching problem for nonbipartite graphs that run in time (near) linear in the number of edges, that is, given any δ > 0 the algorithm produces a (1 -- δ) approximation in O ( ...

5
January 2013 Information and Computation: Volume 222, January, 2013
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 8

In this paper we study linear-programming based approaches to the maximum matching problem in the semi-streaming model. In this model edges are presented sequentially, possibly in an adversarial order, and we are only allowed to use a small space. The allowed space is near linear in the number of vertices ...
Keywords: Maximum matching, Semi-streaming model

6 published by ACM
May 2012 PODS '12: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems
Publisher: ACM
Bibliometrics:
Citation Count: 57
Downloads (6 Weeks): 9,   Downloads (12 Months): 86,   Downloads (Overall): 853

Full text available: PDFPDF
When processing massive data sets, a core task is to construct synopses of the data. To be useful, a synopsis data structure should be easy to construct while also yielding good approximations of the relevant properties of the data set. A particularly useful class of synopses are sketches , i.e., ...
Keywords: data streams, graph sketching, spanners, sparsification, subgraphs

7
January 2012 SODA '12: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 49
Downloads (6 Weeks): 3,   Downloads (12 Months): 24,   Downloads (Overall): 545

Full text available: PDFPDF
We initiate the study of graph sketching , i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n nodes is essentially O ( n 2 )-dimensional, we show the existence of a distribution over random ...

8
July 2011 ICALP'11: Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 13

In this paper, we study linear programming based approaches to the maximum matching problem in the semi-streaming model. The semi-streaming model has gained attention as a model for processing massive graphs as the importance of such graphs has increased. This is a model where edges are streamed-in in an adversarial ...

9
July 2009 ICALP '09: Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 22

Analyzing massive data sets has been one of the key motivations for studying streaming algorithms. In recent years, there has been significant progress in analysing distributions in a streaming setting, but the progress on graph problems has been limited. A main reason for this has been the existence of linear ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us