User contributions for Patmorin
A user with 126 edits. Account created on 1 September 2009.
9 November 2022
- 19:5219:52, 9 November 2022 diff hist +542 N Talk:Map graph →The drawing versus the graph: new section Tag: New topic
20 May 2021
- 08:3908:39, 20 May 2021 diff hist +1,494 Planar graph Added a paragraph about the planar product structure theorem.
- 08:0408:04, 20 May 2021 diff hist +337 Talk:Thue number →Thue number versus Thue index: new section
8 May 2021
- 21:0921:09, 8 May 2021 diff hist +129 Talk:Universal graph →Request to expand greatly upon this article
- 20:3720:37, 8 May 2021 diff hist +123 Universal graph small universal graphs for planar graphs
4 May 2021
- 09:2009:20, 4 May 2021 diff hist +1 m Random binary tree →References: corrected doi
- 09:1809:18, 4 May 2021 diff hist +492 Random binary tree More detailed discussion of Strahler numbers
21 January 2021
- 14:3314:33, 21 January 2021 diff hist +1,296 Implicit graph Added up-to-date results on planar graphs
23 December 2020
- 05:0505:05, 23 December 2020 diff hist +426 Queue number Updated with new separation result
10 December 2019
- 19:2019:20, 10 December 2019 diff hist +453 Ramer–Douglas–Peucker algorithm Added a reference to the Hershberger-Snoeyink O(nlog n) time implementation
- 19:0719:07, 10 December 2019 diff hist +423 Talk:Ramer–Douglas–Peucker algorithm Added a note about my changes to the analysis of running-time.
- 19:0019:00, 10 December 2019 diff hist +307 Ramer–Douglas–Peucker algorithm Removed the incorrect average-case analysis.
18 November 2019
- 11:3411:34, 18 November 2019 diff hist −115 Queue number Removed no-longer-relevant link to open problem on queue-number of planar graphs
- 11:3111:31, 18 November 2019 diff hist +1 m Queue number No edit summary
- 11:1911:19, 18 November 2019 diff hist −1,059 Queue number Updated to reflect recent result on queue-number of planar graphs
11 April 2019
- 13:3413:34, 11 April 2019 diff hist −109 Queue number Updated the upper bound on queue number of the d-cube
- 13:2813:28, 11 April 2019 diff hist +308 Queue number Added reference to d - log(d) hypercube result
7 September 2018
- 14:5514:55, 7 September 2018 diff hist +247 Journal of Computational Geometry →Abstracting and indexing
7 February 2018
- 14:5914:59, 7 February 2018 diff hist +33 Hash function Little touch-ups and link to word size.
- 14:5114:51, 7 February 2018 diff hist +1,347 Hash function Added formula, discussed efficiency and universality
14 April 2016
- 16:5216:52, 14 April 2016 diff hist −4 V. Kumar Murty No edit summary
25 February 2016
- 13:4513:45, 25 February 2016 diff hist +17 Square-free word non-repeating path -> simple path and linked to definition
8 September 2015
- 15:2515:25, 8 September 2015 diff hist −17 Journal of Computational Geometry No edit summary
21 February 2014
- 13:3913:39, 21 February 2014 diff hist +2 m Scapegoat tree updated link
- 13:3813:38, 21 February 2014 diff hist +2 m B-tree updated link
- 13:3613:36, 21 February 2014 diff hist +2 Linked list →External links
23 December 2013
- 14:4414:44, 23 December 2013 diff hist +179 Breadth-first search Added link to book section
- 14:4314:43, 23 December 2013 diff hist +179 Depth-first search Added link to book chapter
- 14:3914:39, 23 December 2013 diff hist 0 m Treap →External links
- 14:3914:39, 23 December 2013 diff hist +174 Treap added link to book section
5 June 2013
- 12:3312:33, 5 June 2013 diff hist +158 Unrolled linked list Added link to textbook chapter
22 February 2013
- 18:1218:12, 22 February 2013 diff hist +3 m Kraft–McMillan inequality →Proof for binary trees
- 15:5615:56, 22 February 2013 diff hist +59 m Kraft–McMillan inequality →Proof for binary trees
- 15:5215:52, 22 February 2013 diff hist +28 m Kraft–McMillan inequality →Proof for binary trees
- 15:4715:47, 22 February 2013 diff hist +1,049 Kraft–McMillan inequality Added a proof for binary trees.
10 September 2012
- 01:3601:36, 10 September 2012 diff hist +165 Radix sort Added external link to Open Data Structures.
16 August 2012
- 20:3320:33, 16 August 2012 diff hist +13 m Dynamic array →External links
- 20:3320:33, 16 August 2012 diff hist +6 m Skip list →External links
- 20:3120:31, 16 August 2012 diff hist +11 m Scapegoat tree →External links
- 20:3120:31, 16 August 2012 diff hist +7 m 2–3–4 tree →External links
- 20:3020:30, 16 August 2012 diff hist +21 m Heapsort →External links
- 20:2920:29, 16 August 2012 diff hist +21 m Merge sort →External links
- 20:2920:29, 16 August 2012 diff hist +21 m Quicksort →External links
- 20:2820:28, 16 August 2012 diff hist +21 m Linear probing →External links
- 20:2720:27, 16 August 2012 diff hist +21 m Adjacency list →External links
- 20:2420:24, 16 August 2012 diff hist +18 m Left-leaning red–black tree →Other
- 20:2220:22, 16 August 2012 diff hist +21 m Random binary tree →External links
- 20:2220:22, 16 August 2012 diff hist +21 m Universal hashing →External links
- 20:2020:20, 16 August 2012 diff hist +11 m Red–black tree →External links
- 20:1920:19, 16 August 2012 diff hist +21 m Binary heap →External links
