Author image not provided
 Mathias Bæk Tejs Knudsen

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article1.57
Citation Count11
Publication count7
Publication years2015-2018
Available for download3
Average downloads per article68.67
Downloads (cumulative)206
Downloads (12 Months)180
Downloads (6 Weeks)34
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


7 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 7 of 7
Sort by:

1
January 2018 SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 6,   Downloads (Overall): 6

Full text available: PDFPDF
Backwards analysis, first popularized by Seidel, is often the simplest most elegant way of analyzing a randomized algorithm. It applies to incremental algorithms where elements are added incrementally, following some random permutation, e.g., incremental Delauney triangulation of a pointset, where points are added one by one, and where we always ...

2 published by ACM
August 2017 Journal of the ACM (JACM): Volume 64 Issue 4, September 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 11,   Downloads (12 Months): 59,   Downloads (Overall): 59

Full text available: PDFPDF
In this article, we show that there exists a graph G with O ( n ) nodes such that any forest of n nodes is an induced subgraph of G . Furthermore, for constant arboricity k , the result implies the existence of a graph with O ( n k ...
Keywords: XML, adjacency labeling, trees, Induced universal graphs, graph theory

3 published by ACM
June 2017 STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 16,   Downloads (12 Months): 93,   Downloads (Overall): 93

Full text available: PDFPDF
Finding cycles in graphs is a fundamental problem in algorithmic graph theory. In this paper, we consider the problem of finding and reporting a cycle of length 2 k in an undirected graph G with n nodes and m edges for constant k � 2. A classic result by Bondy ...
Keywords: Graph algorithms, parameterized algorithms, capped walks, conditional lower bounds, Cycles, graph walks

4
January 2016 SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 22,   Downloads (Overall): 48

Full text available: PDFPDF
The power of two choices is a classic paradigm for load balancing when assigning m balls to n bins. When placing a ball, we pick two bins according to two hash functions h 0 and h 1 , and place the ball in the least loaded bin. Assuming fully random ...

5
October 2015 FOCS '15: Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 3

In this paper we analyze a hash function for k-partitioning a set into bins, obtaining strong concentration bounds for standard algorithms combining statistics from each bin. This generic method was originally introduced by Flajolet and Martin [FOCS'83] in order to save a factor Ω(k) of time per element over k ...

6
October 2015 FOCS '15: Proceedings of the 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

We show that there exists a graph G with O(n) nodes, where any forest of n nodes is a node-induced sub graph of G. Furthermore, for constant arboricity k, the result implies the existence of a graph with O(nk) nodes that contains all n-node graphs as node-induced sub graphs, matching ...

7
July 2015 ICALP 2015: Proceedings, Part II, of the 42nd International Colloquium on Automata, Languages, and Programming - Volume 9135
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We present a $$\lg n + 2 \lg \lg n+3$$ ancestry labeling scheme for trees. The problem was first presented by Kannan et al. [STOC 88'] along with a simple $$2 \lg n$$ solution. Motivated by applications to XML files, the label size was improved incrementally over the course of ...



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