Stack Exchange

Jeremy

Santiago, Chile

http://barbay.cl

Research Interests: Adaptive Analysis of Algorithms and Compressed Data Structures. I love to work on the intersection of distinct fields.

top accounts reputation activity bookmarks subscriptions
Top Questions
85 votes

Add page and line numbers to a pdf

pdf page-numbering line-numbering asked May 21, 2011 at 16:58
tex.stackexchange.com

41 votes

Is a research thesis (report) with zero contribution to human knowledge acceptable?

phd thesis negative-results asked Sep 6, 2013 at 17:46
academia.stackexchange.com

19 votes

Does LaTeX allow for namespaces to eliminate the risk of package clashes?

errors packages best-practices asked Feb 13, 2012 at 9:49
tex.stackexchange.com

14 votes

What is the complexity of computing optimal prefix free codes, when the frequencies are similar?

cc.complexity-theory asked Feb 26, 2011 at 4:52
cstheory.stackexchange.com

12 votes

Select in union of sorted arrays: Already known?

reference-request asked Feb 8, 2014 at 15:06
cstheory.stackexchange.com

8 votes

Number of ordinal trees with n nodes, of depth d, with l leaves

tree rmq ordinal compressed index asked May 24, 2016 at 12:21
cstheory.stackexchange.com

8 votes

Original reference for Huffman shaped Merge Sort?

reference-request sorting huffman asked Aug 8, 2016 at 11:46
cstheory.stackexchange.com

8 votes

Analysis of the synergy of two algorithms in comparison to their simulation in parallel

ds.algorithms time-complexity asked Oct 15, 2010 at 2:50
cstheory.stackexchange.com

8 votes

Duplicate tree-structure in org-mode archive

emacs archive org-mode asked Jul 28, 2015 at 1:46
stackoverflow.com

7 votes

Partitioning DAG into Paths

directed-acyclic-graph partition-problem shannon-entropy asked Jul 31, 2013 at 18:11
cstheory.stackexchange.com

1 2

Top Answers
24
finding smallest k elements in array in O(k)
cstheory.stackexchange.com

22
Empirical results in CS papers
cstheory.stackexchange.com

13
Theoretical CS research having a math undergrad
academia.stackexchange.com

11
Small steps for better TCS conferences?
cstheory.stackexchange.com

11
Which is the limit of lossless compression data? (if there exists such a limit)
cstheory.stackexchange.com

10
Using Emacs to start as org-mode
stackoverflow.com

10
What's better for an algorithm complexity, O(log n) or amortized O(log n)?
cs.stackexchange.com

9
What persistent data structure for a set of partially ordered elements?
cstheory.stackexchange.com

9
Flood fill vs depth first search
cstheory.stackexchange.com

9
Original reference for Huffman shaped Merge Sort?
cstheory.stackexchange.com

8
org-mode schedule weekly event for a period
stackoverflow.com

8
Explain P = NP problem to 10 year old
cstheory.stackexchange.com

8
Element distinctness in O(n) time?
cstheory.stackexchange.com

7
Is it more difficult for teetotalers to develop academic contacts?
academia.stackexchange.com

6
Best Sorting for unlimited integer range
cstheory.stackexchange.com

6
Witnesses for mathematical software
cstheory.stackexchange.com

6
How can you prove that a problem is not solvable in a certain time complexity?
cstheory.stackexchange.com

5
Provable statements about genetic algorithms
cstheory.stackexchange.com

5
Is it plagiarism to copy formulations from others?
academia.stackexchange.com

5
Information complexity of query algorithms?
cstheory.stackexchange.com