-
Notifications
You must be signed in to change notification settings - Fork 7
/
blog.html
512 lines (508 loc) · 32.5 KB
/
blog.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
<!DOCTYPE html>
<html lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1">
<meta name="description" content="The Art Gallery Guardian">
<meta name="author" content="Chao Xu">
<meta name="google-site-verification" content="YE2oeW4OwVOPdVVfdpYIakOuD0A2Qo80W_sUbMJDGok" />
<meta property="og:title" content="Posts" />
<meta property="og:type" content="article" />
<meta property="og:site_name" content="The Art Gallery Guardian" />
<meta property="article:tag" content="" />
<title>Posts</title>
<link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/[email protected]/dist/katex.min.css" integrity="sha384-Xi8rHCmBmhbuyyhbI88391ZKP2dmfnOl4rT9ZfRI7mLTdk1wblIUnrIq35nqwEvC" crossorigin="anonymous">
<link rel="shortcut icon" type="image/x-icon" href="/favicon.ico"/>
<link rel="stylesheet" href="/css/default.css" crossorigin="anonymous">
<link rel="stylesheet" href="/css/blog.css" crossorigin="anonymous">
<link rel="alternate" type="application/rss+xml" title="RSS"
href="https://chaoxu.prof/rss.xml">
</head>
<body>
<header class="hide-on-print">
<div id="site-title">
<a href="/blog.html">The Art Gallery Guardian</a>
</div>
<div style="display: none;">
<img src="/files/chao/chao_thumb.jpg" >
</div>
</header>
<nav class="hide-on-print">
<ul>
<li><a href="/">About</a></li>
<li><a href="/blog.html">Blog</a></li>
<li><a href="/cnblog.html">中文博客</a></li>
<li><a href="/files/cv.pdf">CV</a></li>
<li><a href="/pages/tools.html">Tools</a></li>
</ul>
</nav>
<main>
<article>
<h1 id="article-title">Posts</h1>
<table class="postindex">
<tr>
<td><a href="/posts/2022-02-06-related-companies-and-controlled-groups.html"><cite>The related employer controlled group</cite></a></td>
<td class="right"><time>2022-02-06</time></td>
</tr>
<tr>
<td><a href="/posts/2022-01-30-test-conjectures-on-k-partitions.html"><cite>Test conjectures on <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em;"></span><span class="mord mathnormal" style="margin-right:0.03148em;">k</span></span></span></span>-partitions
over submodular functions</cite></a></td>
<td class="right"><time>2022-01-30</time></td>
</tr>
<tr>
<td><a href="/posts/2020-07-11-yotta-savings-and-covering-designs.html"><cite>Yotta Savings and covering designs</cite></a></td>
<td class="right"><time>2020-07-11</time></td>
</tr>
<tr>
<td><a href="/posts/2020-06-05-the-value-of-a-gift-card.html"><cite>The value of a gift card in beancount</cite></a></td>
<td class="right"><time>2020-06-05</time></td>
</tr>
<tr>
<td><a href="/posts/2020-04-10-maximize-cash-back.html"><cite>Maximize Cash Back</cite></a></td>
<td class="right"><time>2020-04-10</time></td>
</tr>
<tr>
<td><a href="/posts/2019-11-27-bounds-on-cuts.html"><cite>Bounds on number of cuts</cite></a></td>
<td class="right"><time>2019-11-27</time></td>
</tr>
<tr>
<td><a href="/posts/2019-09-19-word-break-with-cost.html"><cite>Word break with cost</cite></a></td>
<td class="right"><time>2019-09-19</time></td>
</tr>
<tr>
<td><a href="/posts/2019-09-06-traditional-ira-vs-roth-ira.html"><cite>Traditional vs Roth IRA under fixed amount of investment</cite></a></td>
<td class="right"><time>2019-09-06</time></td>
</tr>
<tr>
<td><a href="/posts/2019-08-28-impossibility-theorm-marriage-tax.html"><cite>Impossibility theorem of marriage tax</cite></a></td>
<td class="right"><time>2019-08-28</time></td>
</tr>
<tr>
<td><a href="/posts/2019-06-18-long-distance-couple-back-to-back-ticketing.html"><cite>Long distance couple back-to-back ticketing</cite></a></td>
<td class="right"><time>2019-06-18</time></td>
</tr>
<tr>
<td><a href="/posts/2019-06-15-covert-back-to-back-ticketing.html"><cite>An algorithm for covert back-to-back ticketing</cite></a></td>
<td class="right"><time>2019-06-15</time></td>
</tr>
<tr>
<td><a href="/posts/2019-06-15-array-and-permutation.html"><cite>Arrays and permutation</cite></a></td>
<td class="right"><time>2019-06-15</time></td>
</tr>
<tr>
<td><a href="/posts/2019-04-27-union-of-intervals-in-sql.html"><cite>Union of intervals in SQL</cite></a></td>
<td class="right"><time>2019-04-27</time></td>
</tr>
<tr>
<td><a href="/posts/2019-04-27-maximum-weight-hierarchical-b-matching.html"><cite>Maximum weight hierarchical <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em;"></span><span class="mord mathnormal">b</span></span></span></span>-matching</cite></a></td>
<td class="right"><time>2019-04-27</time></td>
</tr>
<tr>
<td><a href="/posts/2019-04-06-misleading-while-being-honest.html"><cite>Misleading while being honest</cite></a></td>
<td class="right"><time>2019-04-06</time></td>
</tr>
<tr>
<td><a href="/posts/2019-03-28-l1-linear-regression.html"><cite><span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em;"></span><span class="mord"><span class="mord mathnormal">L</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em;"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s"></span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span></span></span></span> linear regression</cite></a></td>
<td class="right"><time>2019-03-28</time></td>
</tr>
<tr>
<td><a href="/posts/2019-03-24-densest-subgraph-variation.html"><cite>Densest subgraph variation</cite></a></td>
<td class="right"><time>2019-03-24</time></td>
</tr>
<tr>
<td><a href="/posts/2019-03-10-finger-tree-apply-function-to-each-element.html"><cite>Finger tree allowing apply functions to each element</cite></a></td>
<td class="right"><time>2019-03-10</time></td>
</tr>
<tr>
<td><a href="/posts/2019-02-05-eventually-periodic.html"><cite>Find the period of a nice eventually periodic sequence</cite></a></td>
<td class="right"><time>2019-02-05</time></td>
</tr>
<tr>
<td><a href="/posts/2019-01-31-bottleneck-k-link-path.html"><cite>Bottleneck <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em;"></span><span class="mord mathnormal" style="margin-right:0.03148em;">k</span></span></span></span>-link path</cite></a></td>
<td class="right"><time>2019-01-31</time></td>
</tr>
<tr>
<td><a href="/posts/2019-01-30-search-sorted-matrix.html"><cite>Search in a sorted matrix with an oracle</cite></a></td>
<td class="right"><time>2019-01-30</time></td>
</tr>
<tr>
<td><a href="/posts/2019-01-29-reviewer-assignment.html"><cite>A Reviewer Assignment Problem</cite></a></td>
<td class="right"><time>2019-01-29</time></td>
</tr>
<tr>
<td><a href="/posts/2019-01-22-soft-heap-and-selection.html"><cite>Soft heap and selection</cite></a></td>
<td class="right"><time>2019-01-22</time></td>
</tr>
<tr>
<td><a href="/posts/2019-01-21-high-degree-low-degree-technique.html"><cite>The high-degree low-degree technique and arboricity</cite></a></td>
<td class="right"><time>2019-01-21</time></td>
</tr>
<tr>
<td><a href="/posts/2019-01-12-lights-out-game.html"><cite>Lights out game on a grid</cite></a></td>
<td class="right"><time>2019-01-12</time></td>
</tr>
<tr>
<td><a href="/posts/2018-12-23-strings-with-hamming-distance-exactly-1.html"><cite>Strings with hamming distance exactly <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6444em;"></span><span class="mord">1</span></span></span></span></cite></a></td>
<td class="right"><time>2018-12-23</time></td>
</tr>
<tr>
<td><a href="/posts/2018-12-18-subset-sum-through-balancing.html"><cite>Subset sum through balancing</cite></a></td>
<td class="right"><time>2018-12-18</time></td>
</tr>
<tr>
<td><a href="/posts/2018-11-06-global-min-cut-with-parity-constraint-on-the-edges.html"><cite>Global min-cut with parity constraint on the edges</cite></a></td>
<td class="right"><time>2018-11-06</time></td>
</tr>
<tr>
<td><a href="/posts/2018-02-23-weighted-h-index.html"><cite>Computing the weighted h-index</cite></a></td>
<td class="right"><time>2018-02-23</time></td>
</tr>
<tr>
<td><a href="/posts/2017-08-26-solution-to-linear-diophantine.html"><cite>Small <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em;"></span><span class="mord"><span class="mord mathnormal">L</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em;"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s"></span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span></span></span></span> norm solution to a linear
Diophantine equation</cite></a></td>
<td class="right"><time>2017-08-26</time></td>
</tr>
<tr>
<td><a href="/posts/2017-04-20-list-the-smallest-k-subset-sums.html"><cite>List the smallest <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em;"></span><span class="mord mathnormal" style="margin-right:0.03148em;">k</span></span></span></span> subset sums</cite></a></td>
<td class="right"><time>2017-04-20</time></td>
</tr>
<tr>
<td><a href="/posts/2017-03-09-filling-up-a-bin-using-balls-with-divisible-weight.html"><cite>Filling up a bin using balls with divisible weights</cite></a></td>
<td class="right"><time>2017-03-09</time></td>
</tr>
<tr>
<td><a href="/posts/2016-08-02-proportional-apportionment.html"><cite>Processor distribution and proportional apportionment</cite></a></td>
<td class="right"><time>2016-08-02</time></td>
</tr>
<tr>
<td><a href="/posts/2016-07-02-max-flow-longest-path.html"><cite>Maximum flow running time depend on longest path</cite></a></td>
<td class="right"><time>2016-07-02</time></td>
</tr>
<tr>
<td><a href="/posts/2016-04-24-restricted-min-cut.html"><cite>Minimum cuts with restrictions</cite></a></td>
<td class="right"><time>2016-04-24</time></td>
</tr>
<tr>
<td><a href="/posts/2016-04-21-tree-balanced-partition.html"><cite>Balanced partition for trees</cite></a></td>
<td class="right"><time>2016-04-21</time></td>
</tr>
<tr>
<td><a href="/posts/2016-03-10-shortest-string-distinguishs-two-regular-languages.html"><cite>Shortest string distinguishing two regular languages</cite></a></td>
<td class="right"><time>2016-03-10</time></td>
</tr>
<tr>
<td><a href="/posts/2016-02-01-gomory-hu-bad-news.html"><cite>No nice generalization of Gomory-Hu tree</cite></a></td>
<td class="right"><time>2016-02-01</time></td>
</tr>
<tr>
<td><a href="/posts/2015-11-20-divide-and-conquer-over-cyclic-groups.html"><cite>Divide and conquer over cyclic groups</cite></a></td>
<td class="right"><time>2015-11-20</time></td>
</tr>
<tr>
<td><a href="/posts/2015-07-20-subset-sum-parametrized-by-sum.html"><cite>Subset sum of elements sum to <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.4306em;"></span><span class="mord mathnormal" style="margin-right:0.03588em;">σ</span></span></span></span></cite></a></td>
<td class="right"><time>2015-07-20</time></td>
</tr>
<tr>
<td><a href="/posts/2015-04-22-sum-of-sparse-array-in-linear-time.html"><cite>Sum of sparse array in linear time</cite></a></td>
<td class="right"><time>2015-04-22</time></td>
</tr>
<tr>
<td><a href="/posts/2015-04-10-treewidth-2.html"><cite>A characterization of treewidth 2 graphs</cite></a></td>
<td class="right"><time>2015-04-10</time></td>
</tr>
<tr>
<td><a href="/posts/2015-03-15-minimum-cost-zero-skew-tree.html"><cite>Minimum cost zero skew tree</cite></a></td>
<td class="right"><time>2015-03-15</time></td>
</tr>
<tr>
<td><a href="/posts/2015-02-13-network-transformations.html"><cite>Network Transformations and Applications</cite></a></td>
<td class="right"><time>2015-02-13</time></td>
</tr>
<tr>
<td><a href="/posts/2015-02-08-two-problem-related-to-sequence-of-sets.html"><cite>Two problem related to sequence of sets</cite></a></td>
<td class="right"><time>2015-02-08</time></td>
</tr>
<tr>
<td><a href="/posts/2015-02-02-rectangle-in-point-set.html"><cite>Rectangles in point set</cite></a></td>
<td class="right"><time>2015-02-02</time></td>
</tr>
<tr>
<td><a href="/posts/2015-01-27-bounded-regression-on-data-streams.html"><cite>Bounded regression on data streams</cite></a></td>
<td class="right"><time>2015-01-27</time></td>
</tr>
<tr>
<td><a href="/posts/2014-12-13-tsp-supnick-matrix.html"><cite>TSP, Max TSP and Supnick</cite></a></td>
<td class="right"><time>2014-12-13</time></td>
</tr>
<tr>
<td><a href="/posts/2014-11-22-applications-of-finger-tree.html"><cite>Applications of finger trees</cite></a></td>
<td class="right"><time>2014-11-22</time></td>
</tr>
<tr>
<td><a href="/posts/2014-11-15-speedup-incremental-computation-with-two-stacks.html"><cite>Speed up incremental computation with two stacks</cite></a></td>
<td class="right"><time>2014-11-15</time></td>
</tr>
<tr>
<td><a href="/posts/2014-11-11-number-of-edges-in-acyclic-flow.html"><cite>Number of edges in acyclic flow</cite></a></td>
<td class="right"><time>2014-11-11</time></td>
</tr>
<tr>
<td><a href="/posts/2014-11-04-isotonic-function-preserving-grid-in-1d.html"><cite>Isotonic function preserving grid in <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mopen">[</span><span class="mord">0</span><span class="mpunct">,</span><span class="mspace" style="margin-right:0.1667em;"></span><span class="mord">1</span><span class="mclose">]</span></span></span></span></cite></a></td>
<td class="right"><time>2014-11-04</time></td>
</tr>
<tr>
<td><a href="/posts/2014-11-02-reconstructing-edge-disjoint-paths.html"><cite>Reconstructing edge-disjoint paths, a tighter analysis</cite></a></td>
<td class="right"><time>2014-11-02</time></td>
</tr>
<tr>
<td><a href="/posts/2014-10-30-reducing-edge-connectivity-to-vertex-connectivity-with-small-increas-in-edges.html"><cite>Reducing edge connectivity to vertex connectivity with small increase
in edges</cite></a></td>
<td class="right"><time>2014-10-30</time></td>
</tr>
<tr>
<td><a href="/posts/2014-10-13-maximum-sum-k-disjoint-subarrays.html"><cite>Maximum sum <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em;"></span><span class="mord mathnormal" style="margin-right:0.03148em;">k</span></span></span></span>-disjoint subarrays</cite></a></td>
<td class="right"><time>2014-10-13</time></td>
</tr>
<tr>
<td><a href="/posts/2014-10-12-pack-a-histogram.html"><cite>Pack a histogram</cite></a></td>
<td class="right"><time>2014-10-12</time></td>
</tr>
<tr>
<td><a href="/posts/2014-09-21-augment-induced-subtree-constant-diameter.html"><cite>Induced subgraph with constant diameter</cite></a></td>
<td class="right"><time>2014-09-21</time></td>
</tr>
<tr>
<td><a href="/posts/2014-09-14-2014-apl-programming-contest-3rd-place-entry.html"><cite>2014 APL Programming Contest 3rd place entry</cite></a></td>
<td class="right"><time>2014-09-14</time></td>
</tr>
<tr>
<td><a href="/posts/2014-09-03-reduce-vertex-disjoint-paths-to-maximum-matching.html"><cite>Reduction between vertex disjoint paths and maximum matching</cite></a></td>
<td class="right"><time>2014-09-03</time></td>
</tr>
<tr>
<td><a href="/posts/2014-08-20-shooting-balloons-and-circular-arcs.html"><cite>Shooting balloons and problems on circular arcs</cite></a></td>
<td class="right"><time>2014-08-20</time></td>
</tr>
<tr>
<td><a href="/posts/2014-08-13-minimum-of-submodular-function-over-subsets.html"><cite>Minimum of submodular function over family of subsets</cite></a></td>
<td class="right"><time>2014-08-13</time></td>
</tr>
<tr>
<td><a href="/posts/2014-08-11-sum-over-products-of-weighted-subset-of-certain-size.html"><cite>Sum over products of weighted subset of certain size</cite></a></td>
<td class="right"><time>2014-08-11</time></td>
</tr>
<tr>
<td><a href="/posts/2014-06-05-pattern-in-labeled-ordered-rooted-trees.html"><cite>Pattern in Labeled Ordered Rooted Trees</cite></a></td>
<td class="right"><time>2014-06-05</time></td>
</tr>
<tr>
<td><a href="/posts/2014-05-10-lexicographical-bottleneck-path.html"><cite>Lexicographic Bottleneck Shortest Path in Undirected Graphs</cite></a></td>
<td class="right"><time>2014-05-10</time></td>
</tr>
<tr>
<td><a href="/posts/2014-04-27-recognize-uniquely-decodable-codes.html"><cite>Recognize Uniquely Decodable Codes</cite></a></td>
<td class="right"><time>2014-04-27</time></td>
</tr>
<tr>
<td><a href="/posts/2014-04-25-aho-corasick-in-haskell.html"><cite>The Aho–Corasick Automaton in Haskell</cite></a></td>
<td class="right"><time>2014-04-25</time></td>
</tr>
<tr>
<td><a href="/posts/2014-04-11-the-kmp-algorithm-in-haskell.html"><cite>The KMP algorithm in Haskell</cite></a></td>
<td class="right"><time>2014-04-11</time></td>
</tr>
<tr>
<td><a href="/posts/2014-04-05-a-common-3sum-hard-reduction.html"><cite>A common <strong>3SUM-hard</strong> reduction</cite></a></td>
<td class="right"><time>2014-04-05</time></td>
</tr>
<tr>
<td><a href="/posts/2014-04-02-selection-in-a-sorted-matrix.html"><cite>Selection in a sorted matrix</cite></a></td>
<td class="right"><time>2014-04-02</time></td>
</tr>
<tr>
<td><a href="/posts/2014-03-27-bisect-circle-even-point-set.html"><cite>Bisect circle for a balanced set of points</cite></a></td>
<td class="right"><time>2014-03-27</time></td>
</tr>
<tr>
<td><a href="/posts/2014-03-26-sharing-sushi.html"><cite>Sushi sharing problem</cite></a></td>
<td class="right"><time>2014-03-26</time></td>
</tr>
<tr>
<td><a href="/posts/2014-03-08-even-cycle-in-a-simple-graph.html"><cite>Even cycle in a simple graph</cite></a></td>
<td class="right"><time>2014-03-08</time></td>
</tr>
<tr>
<td><a href="/posts/2014-02-26-subset-target-sum.html"><cite>Faster Pseudo-polynomial Time Algorithm for Subset Sums</cite></a></td>
<td class="right"><time>2014-02-26</time></td>
</tr>
<tr>
<td><a href="/posts/2014-02-25-is-the-gas-enough.html"><cite>Is the gas enough?</cite></a></td>
<td class="right"><time>2014-02-25</time></td>
</tr>
<tr>
<td><a href="/posts/2014-02-15-partial-order-under-contraction.html"><cite>Partial order under contraction</cite></a></td>
<td class="right"><time>2014-02-15</time></td>
</tr>
<tr>
<td><a href="/posts/2013-09-19-generate-polyominoes-in-apl.html"><cite>Generate Polyominoes in APL</cite></a></td>
<td class="right"><time>2013-09-19</time></td>
</tr>
<tr>
<td><a href="/posts/2013-08-18-find-the-minimum-of-a-bitonic-sequence.html"><cite>Find the minimum of a bitonic sequence</cite></a></td>
<td class="right"><time>2013-08-18</time></td>
</tr>
<tr>
<td><a href="/posts/2013-08-16-more-algorithms-on-perfectly-balanced-photo-gallery.html"><cite>More algorithms on perfectly balanced photo gallery</cite></a></td>
<td class="right"><time>2013-08-16</time></td>
</tr>
<tr>
<td><a href="/posts/2013-08-02-why-i-left-google.html"><cite>Why I left Google</cite></a></td>
<td class="right"><time>2013-08-02</time></td>
</tr>
<tr>
<td><a href="/posts/2013-07-27-find-the-minimum-of-an-array.html"><cite>Find the minimum of an array with a non-increasing and a
non-decreasing part</cite></a></td>
<td class="right"><time>2013-07-27</time></td>
</tr>
<tr>
<td><a href="/posts/2013-07-10-formal-definition-of-sequence-alignment.html"><cite>Formal Definition of Sequence Alignment</cite></a></td>
<td class="right"><time>2013-07-10</time></td>
</tr>
<tr>
<td><a href="/posts/2013-06-08-algebraic-framework-for-algorithms.html"><cite>Algebraic framework for algorithms</cite></a></td>
<td class="right"><time>2013-06-08</time></td>
</tr>
<tr>
<td><a href="/posts/2013-05-29-totally-unimodular-matrices.html"><cite>Totally Unimodular Matrices</cite></a></td>
<td class="right"><time>2013-05-29</time></td>
</tr>
<tr>
<td><a href="/posts/2013-03-26-represent-an-element-in-a-free-monoid-with-minimum-weight.html"><cite>Represent an element in a free monoid with minimum weight</cite></a></td>
<td class="right"><time>2013-03-26</time></td>
</tr>
<tr>
<td><a href="/posts/2013-03-21-regular-expression-for-a-interval-of-non-negative-integers.html"><cite>Regular expression for a interval of non-negative integers</cite></a></td>
<td class="right"><time>2013-03-21</time></td>
</tr>
<tr>
<td><a href="/posts/2013-01-30-there-exist-a-path-of-length-d-g-for-every-graph-g.html"><cite>There exist a path of length <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:1em;vertical-align:-0.25em;"></span><span class="mopen">⌈</span><span class="mord mathnormal">d</span><span class="mopen">(</span><span class="mord mathnormal">G</span><span class="mclose">)⌉</span></span></span></span> for every graph <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6833em;"></span><span class="mord mathnormal">G</span></span></span></span></cite></a></td>
<td class="right"><time>2013-01-30</time></td>
</tr>
<tr>
<td><a href="/posts/2012-08-31-number-of-ways-to-make-change.html"><cite>Number of ways to make change</cite></a></td>
<td class="right"><time>2012-08-31</time></td>
</tr>
<tr>
<td><a href="/posts/2012-08-30-basis-of-the-module-z-n.html"><cite>Basis of the module <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6889em;"></span><span class="mord"><span class="mord mathbb">Z</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.6644em;"><span style="top:-3.063em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mathnormal mtight">n</span></span></span></span></span></span></span></span></span></span></span></cite></a></td>
<td class="right"><time>2012-08-30</time></td>
</tr>
<tr>
<td><a href="/posts/2012-08-23-a-relation-between-l-infty-metric-and-l-1-metric-in-r-2.html"><cite>A relation between <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em;"></span><span class="mord"><span class="mord mathnormal">L</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.1514em;"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">∞</span></span></span></span><span class="vlist-s"></span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span></span></span></span> metric
and <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em;"></span><span class="mord"><span class="mord mathnormal">L</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em;"><span style="top:-2.55em;margin-left:0em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">1</span></span></span></span><span class="vlist-s"></span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span></span></span></span> metric in <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8141em;"></span><span class="mord"><span class="mord mathbb">R</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height:0.8141em;"><span style="top:-3.063em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">2</span></span></span></span></span></span></span></span></span></span></span></cite></a></td>
<td class="right"><time>2012-08-23</time></td>
</tr>
<tr>
<td><a href="/posts/2012-08-08-maximize-the-area-of-a-radar-chart.html"><cite>Maximize the area of a radar chart</cite></a></td>
<td class="right"><time>2012-08-08</time></td>
</tr>
<tr>
<td><a href="/posts/2012-06-19-a-cute-theorem-involving-xor.html"><cite>A cute theorem involving xor</cite></a></td>
<td class="right"><time>2012-06-19</time></td>
</tr>
<tr>
<td><a href="/posts/2012-04-23-proof-that-binomial-coefficient-are-integers.html"><cite>Proof that binomial coefficients are integers</cite></a></td>
<td class="right"><time>2012-04-23</time></td>
</tr>
<tr>
<td><a href="/posts/2012-04-13-minimum-area-rectangle-that-enclose-a-set-of-rectangles.html"><cite>Minimum area rectangle that enclose a set of rectangles</cite></a></td>
<td class="right"><time>2012-04-13</time></td>
</tr>
<tr>
<td><a href="/posts/2012-03-06-lcm-of-more-than-two-numbers-as-a-formula-of-gcds.html"><cite><span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.6944em;"></span><span class="mop"><span class="mop"><span class="mord mathrm">lcm</span></span></span></span></span></span> of more than two numbers as a
formula of <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8889em;vertical-align:-0.1944em;"></span><span class="mop"><span style="margin-right:0.01389em;">g</span>cd</span></span></span></span>s</cite></a></td>
<td class="right"><time>2012-03-06</time></td>
</tr>
<tr>
<td><a href="/posts/2011-12-27-continued-fraction-arithmetic-in-haskell.html"><cite>Continued Fraction Arithmetic in Haskell</cite></a></td>
<td class="right"><time>2011-12-27</time></td>
</tr>
<tr>
<td><a href="/posts/2011-12-23-given-sequence-of-angles-find-a-polygon.html"><cite>Given sequence of angles, find a polygon</cite></a></td>
<td class="right"><time>2011-12-23</time></td>
</tr>
<tr>
<td><a href="/posts/2011-12-21-fill-a-checkerboard.html"><cite>Fill a checkerboard</cite></a></td>
<td class="right"><time>2011-12-21</time></td>
</tr>
<tr>
<td><a href="/posts/2011-12-06-implement-a-special-kind-of-recurrence-relation-as-a-infinite-list.html"><cite>Implement a special kind of recurrence relation as a infinite
list</cite></a></td>
<td class="right"><time>2011-12-06</time></td>
</tr>
<tr>
<td><a href="/posts/2011-11-13-a-solution-to-Instagram-engineering-challenge-the-unshredder-in-haskell.html"><cite>A solution to Instagram Engineering Challenge, The Unshredder in
Haskell</cite></a></td>
<td class="right"><time>2011-11-13</time></td>
</tr>
<tr>
<td><a href="/posts/2011-10-12-accepted-to-budapest-semesters-in-mathematics.html"><cite>Accepted to Budapest Semesters in Mathematics</cite></a></td>
<td class="right"><time>2011-10-12</time></td>
</tr>
<tr>
<td><a href="/posts/2011-07-22-what-did-the-set-of-points-get-for-its-birthday.html"><cite>What did the set of points get for its birthday?</cite></a></td>
<td class="right"><time>2011-07-22</time></td>
</tr>
<tr>
<td><a href="/posts/2011-07-11-b-3-is-automatic-a-simple-proof.html"><cite><span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em;"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.05017em;">B</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em;"><span style="top:-2.55em;margin-left:-0.0502em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">3</span></span></span></span><span class="vlist-s"></span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span></span></span></span> is automatic, a simple proof</cite></a></td>
<td class="right"><time>2011-07-11</time></td>
</tr>
<tr>
<td><a href="/posts/2011-07-05-linear-time-algorithm-for-the-word-problem-on-b-3.html"><cite>Linear time algorithm for the word problem on <span class="katex"><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height:0.8333em;vertical-align:-0.15em;"></span><span class="mord"><span class="mord mathnormal" style="margin-right:0.05017em;">B</span><span class="msupsub"><span class="vlist-t vlist-t2"><span class="vlist-r"><span class="vlist" style="height:0.3011em;"><span style="top:-2.55em;margin-left:-0.0502em;margin-right:0.05em;"><span class="pstrut" style="height:2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight">3</span></span></span></span><span class="vlist-s"></span></span><span class="vlist-r"><span class="vlist" style="height:0.15em;"><span></span></span></span></span></span></span></span></span></span></cite></a></td>
<td class="right"><time>2011-07-05</time></td>
</tr>
<tr>
<td><a href="/posts/2011-07-05-garside-normal-form-and-summit-sets.html"><cite>Garside Normal Form and Summit Sets</cite></a></td>
<td class="right"><time>2011-07-05</time></td>
</tr>
<tr>
<td><a href="/posts/2011-06-23-word-problem-for-braid-group-using-a-representation.html"><cite>Word problem for braid group using a representation</cite></a></td>
<td class="right"><time>2011-06-23</time></td>
</tr>
<tr>
<td><a href="/posts/2011-06-21-word-problem-for-symmetric-group-is-linear-on-ram.html"><cite>Word problem for symmetric group is linear on RAM</cite></a></td>
<td class="right"><time>2011-06-21</time></td>
</tr>
<tr>
<td><a href="/posts/2011-06-15-how-long-do-you-expect-to-live.html"><cite>How long do you expect to live?</cite></a></td>
<td class="right"><time>2011-06-15</time></td>
</tr>
<tr>
<td><a href="/posts/2011-06-11-countably-infinite-group-such-that-every-element-has-order-2-are-isomorphic.html"><cite>Countably infinite groups such that every element has order 2 are
isomorphic</cite></a></td>
<td class="right"><time>2011-06-11</time></td>
</tr>
<tr>
<td><a href="/posts/2011-06-06-a-generalization-of-the-art-gallery-theorem-with-reflection-and-a-cool-problem.html"><cite>A generalization of the art gallery theorem with reflection and a
cool problem</cite></a></td>
<td class="right"><time>2011-06-06</time></td>
</tr>
<tr>
<td><a href="/posts/2011-06-01-a-riddle-guess-the-word-from-the-sum.html"><cite>A riddle, guess the word from the sum</cite></a></td>
<td class="right"><time>2011-06-01</time></td>
</tr>
<tr>
<td><a href="/posts/2011-03-05-simple-keystroke-counter.html"><cite>Simple keystroke counter</cite></a></td>
<td class="right"><time>2011-03-05</time></td>
</tr>
<tr>
<td><a href="/posts/2010-11-07-find-the-square-root-of-an-integer-with-trigonometry-and-lagrange-s-four-square-theorem.html"><cite>Find the square root of an integer with trigonometry and Lagrange’s
four-square theorem</cite></a></td>
<td class="right"><time>2010-11-07</time></td>
</tr>
</table>
</article>
</main>
<footer class="hide-on-print">© 2010 - <time><script>document.write(new Date().getFullYear())</script></time> <a href="https://chaoxu.prof" rel="author">Chao Xu</a>. Licensed under a <a rel="license" href="http://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</a>.
<a href="/README.html">Blog README</a>.</footer>
</body>
</html>