Talk:Package-merge algorithm - Revision history

Supyovalk: Assessment: banner shell, Mathematics (Rater)

2024-07-29T08:30:49Z

Assessment: banner shell, Mathematics (Rater)

← Previous revision		Revision as of 08:30, 29 July 2024
Line 1:		Line 1:
	{{WikiProject banner shell\|class=\|		{{WikiProject banner shell\|class=C\|1=
	{{WP Mathematics}} }}		{{WikiProject Mathematics}}
			}}

	==[Untitled]==		==[Untitled]==

Johnsoniensis: math

2024-04-29T13:04:06Z

math

← Previous revision		Revision as of 13:04, 29 April 2024
Line 1:		Line 1:
	{{WikiProject banner shell\|class=}}		{{WikiProject banner shell\|class=\|
			{{WP Mathematics}} }}

			==[Untitled]==
	I was in the process of adding several related topics. I kept this one short and then added the others. When I came back, there was this notice. I am going to add the information now. :) Sorry, [[User:Oravec\|Oravec]] 06:13, 7 November 2006 (UTC)		I was in the process of adding several related topics. I kept this one short and then added the others. When I came back, there was this notice. I am going to add the information now. :) Sorry, [[User:Oravec\|Oravec]] 06:13, 7 November 2006 (UTC)

Qwerfjkl (bot): Adding {{WikiProject banner shell}} (Task 19)

2023-08-12T19:54:30Z

Adding {{WikiProject banner shell}} (Task 19)

← Previous revision		Revision as of 19:54, 12 August 2023
Line 1:		Line 1:
			{{WikiProject banner shell\|class=}}

	I was in the process of adding several related topics. I kept this one short and then added the others. When I came back, there was this notice. I am going to add the information now. :) Sorry, [[User:Oravec\|Oravec]] 06:13, 7 November 2006 (UTC)		I was in the process of adding several related topics. I kept this one short and then added the others. When I came back, there was this notice. I am going to add the information now. :) Sorry, [[User:Oravec\|Oravec]] 06:13, 7 November 2006 (UTC)

Vegasprof at 10:09, 13 November 2006

2006-11-13T10:09:44Z

← Previous revision		Revision as of 10:09, 13 November 2006
Line 19:		Line 19:
	:: pages = "1283-1312",		:: pages = "1283-1312",
	: If anyone wants to add the refs appropriately and/or use math tags, they're welcome to do so. If not, hopefully I'll get around to it soon.... [[User:Calbaer\|Calbaer]] 03:52, 8 November 2006 (UTC)		: If anyone wants to add the refs appropriately and/or use math tags, they're welcome to do so. If not, hopefully I'll get around to it soon.... [[User:Calbaer\|Calbaer]] 03:52, 8 November 2006 (UTC)
			==Ok Now, I Think==
			Shouldn't "importance" and "verify" be removed now? They were put up there some time ago, before the page was expanded to include so much detail and so many references. [[User:Vegasprof\|Vegasprof]] 10:09, 13 November 2006 (UTC)

Calbaer: /* Improvements since 1990 */

2006-11-08T03:52:46Z

Improvements since 1990

← Previous revision		Revision as of 03:52, 8 November 2006
Line 9:		Line 9:
	==Improvements since 1990==		==Improvements since 1990==
	Someone needs to add a section on improvements and extensions to the algorithm that have been developed since 1990. For example, it is now known how to execute the package-merge algorithm using O(n) space. I would prefer that someone else, hopefully someone who is more of an expert in these latest developments, volunteer for this task. [[User:Vegasprof\|Vegasprof]] 03:11, 8 November 2006 (UTC)		Someone needs to add a section on improvements and extensions to the algorithm that have been developed since 1990. For example, it is now known how to execute the package-merge algorithm using O(n) space. I would prefer that someone else, hopefully someone who is more of an expert in these latest developments, volunteer for this task. [[User:Vegasprof\|Vegasprof]] 03:11, 8 November 2006 (UTC)
			: Done; the appropriate sources are various Moffat/Turpin sources (so hopefully ''Managing Gigabytes'' should be good enough) and:
			:: author = "L. L. Larmore and T. M. Przytycka",
			:: title = "A Fast Algorithm for Optimal Height-Limited Alphabetic Binary-Trees",
			:: journal = SICOMP,
			:: volume = "23",
			:: number = "6",
			:: month = dec,
			:: year = 1994,
			:: pages = "1283-1312",
			: If anyone wants to add the refs appropriately and/or use math tags, they're welcome to do so. If not, hopefully I'll get around to it soon.... [[User:Calbaer\|Calbaer]] 03:52, 8 November 2006 (UTC)

Vegasprof: Request for someone to add a section about recent developments

2006-11-08T03:11:41Z

Request for someone to add a section about recent developments

← Previous revision		Revision as of 03:11, 8 November 2006
Line 8:		Line 8:

	==Improvements since 1990==		==Improvements since 1990==
	Someone needs to add a section on improvements and extensions to the algorithm that have been developed since 1990. For example, it is now known how to execute the package-merge algorithm using O(n) space. I would prefer that someone else, hopefully someone who is more of an expert in these latest developments, volunteer for this task. [[User:Vegasprof\|Vegasprof]] 03:10, 8 November 2006 (UTC)		Someone needs to add a section on improvements and extensions to the algorithm that have been developed since 1990. For example, it is now known how to execute the package-merge algorithm using O(n) space. I would prefer that someone else, hopefully someone who is more of an expert in these latest developments, volunteer for this task. [[User:Vegasprof\|Vegasprof]] 03:11, 8 November 2006 (UTC)

Vegasprof: Request for someone to add a section about recent developments

2006-11-08T03:10:36Z

Request for someone to add a section about recent developments

← Previous revision		Revision as of 03:10, 8 November 2006
Line 6:		Line 6:

	This page has come a long way. I've added a link from the Huffman coding page, particularly the Length-limited Huffman coding section. Hopefully the links will draw others to help put the final touches on this page. [[User:Oravec\|Oravec]] 15:00, 7 November 2006 (UTC)		This page has come a long way. I've added a link from the Huffman coding page, particularly the Length-limited Huffman coding section. Hopefully the links will draw others to help put the final touches on this page. [[User:Oravec\|Oravec]] 15:00, 7 November 2006 (UTC)

			==Improvements since 1990==
			Someone needs to add a section on improvements and extensions to the algorithm that have been developed since 1990. For example, it is now known how to execute the package-merge algorithm using O(n) space. I would prefer that someone else, hopefully someone who is more of an expert in these latest developments, volunteer for this task. [[User:Vegasprof\|Vegasprof]] 03:10, 8 November 2006 (UTC)

Oravec: Added comment about status

2006-11-07T15:00:07Z

Added comment about status

← Previous revision		Revision as of 15:00, 7 November 2006
Line 4:		Line 4:

	Although some references need to be added, the algorithm is now described. Faster algorithms for the length-limited Huffman coding problem exist, but they are too complicated for practical applications. [[User:Vegasprof\|Vegasprof]] 12:06, 7 November 2006 (UTC)		Although some references need to be added, the algorithm is now described. Faster algorithms for the length-limited Huffman coding problem exist, but they are too complicated for practical applications. [[User:Vegasprof\|Vegasprof]] 12:06, 7 November 2006 (UTC)

			This page has come a long way. I've added a link from the Huffman coding page, particularly the Length-limited Huffman coding section. Hopefully the links will draw others to help put the final touches on this page. [[User:Oravec\|Oravec]] 15:00, 7 November 2006 (UTC)

Vegasprof at 12:06, 7 November 2006

2006-11-07T12:06:52Z

← Previous revision		Revision as of 12:06, 7 November 2006
Line 2:		Line 2:

	I will add the details within 48 hours. I wish to verify the information before adding it. [[User:Oravec\|Oravec]] 06:22, 7 November 2006 (UTC)		I will add the details within 48 hours. I wish to verify the information before adding it. [[User:Oravec\|Oravec]] 06:22, 7 November 2006 (UTC)

			Although some references need to be added, the algorithm is now described. Faster algorithms for the length-limited Huffman coding problem exist, but they are too complicated for practical applications. [[User:Vegasprof\|Vegasprof]] 12:06, 7 November 2006 (UTC)

Oravec: added will update within 48 hours

2006-11-07T06:22:12Z

added will update within 48 hours

← Previous revision		Revision as of 06:22, 7 November 2006
Line 1:		Line 1:
	I was in the process of adding several related topics. I kept this one short and then added the others. When I came back, there was this notice. I am going to add the information now. :) Sorry, [[User:Oravec\|Oravec]] 06:13, 7 November 2006 (UTC)		I was in the process of adding several related topics. I kept this one short and then added the others. When I came back, there was this notice. I am going to add the information now. :) Sorry, [[User:Oravec\|Oravec]] 06:13, 7 November 2006 (UTC)

			I will add the details within 48 hours. I wish to verify the information before adding it. [[User:Oravec\|Oravec]] 06:22, 7 November 2006 (UTC)