000			04062nas a22004095i 4500
001			1432-0541
003			DE-He213
005			20260610082532.0
007			cr nn 008mamaa
008			150723s||||||||xxuuu poo|||||| b|EN |d
022			_a1432-0541
024	7		_a10.1007/453.1432-0541 _2doi
210	1	0	_aAlgorithmica
245	1	0	_aAlgorithmica _h[electronic resource] / _cedited by Mohammad T. Hajiaghayi.
264		1	_aNew York : _bSpringer US : _bImprint: Springer.
300			_bonline resource.
520			_aThe development of algorithms is an integral part of computer science. The increasing complexity and scope of computer applications makes the design of efficient algorithms essential. Algorithmica is an international journal which publishes original papers on algorithms that are either (i) theoretical papers addressing problems arising in practical areas or (ii) experimental papers that have general appeal because of their practical importance or techniques. Papers are expected to make significant contributions, judged in terms of theoretical analysis, simulations, or algorithm behavior on data from applications. The areas listed below are representative areas; papers in other areas are certainly welcome. The fields of interest include algorithms in applied areas such as: VLSI, distributed computing, parallel processing, automated design, robotics, graphics, data base design, software tools, as well as algorithms in fundamental areas such as sorting, searching, data structures, computational geometry, and linear programming. It is expected that the areas covered by this journal will change as new technologies, methodologies and applications develop. In addition to these regular papers, the journal features two special sections: Application Experience and Problems. The objective of the Application Experience section is to publish findings obtained from applications of theoretical results to practical situations. Findings include, but are not limited to, difficulties encountered in the course of the implementation or testing of algorithms (e.g., handling of degenerate cases which are often not addressed in detail but which actually occur in practice), nontrivial deviations of actual running times of the implemented algorithms from the asymptotic analytical studies, comparisons of actual performance of various algorithms proposed, and discussions of applicability of theoretical studies in practice. All submissions wil l be subject to the reviewing process and copies of source codes should be made available upon request by the Editor for reviewing purposes. The Problems section publishes short papers presenting problems on selected topics of computer science. Special emphasis will be given to papers surveying open problems in a specific area of interest. Contributions will begin with a title and an introductory statement identifying a theme of research, followed by a list of related problems which to the author's knowledge are as yet unsolved. Authors are encouraged to annotate the text with comments, background material and appropriate references. All submissions will be subject to the reviewing process. Special issues devoted to a single topic are also planned.
650		0	_aAlgorithms.
650		0	_aComputer science.
650		0	_aComputer science—Mathematics.
650		0	_aAlgorithms.
650		0	_aComputer engineering.
650		0	_aComputer networks .
650		0	_aData structures (Computer science).
650		0	_aInformation theory.
650	1	4	_aDesign and Analysis of Algorithms.
650	2	4	_aTheory of Computation.
650	2	4	_aMathematics of Computing.
650	2	4	_aAlgorithms.
650	2	4	_aComputer Engineering and Networks.
650	2	4	_aData Structures and Information Theory.
700	1		_aHajiaghayi, Mohammad T. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
776	0	8	_iPrinted version: _x0178-4617
856	4	0	_uhttps://doi.org/10.1007/453.1432-0541 _zHybrid
999			_c4371 _d4371