GHU Logo
The Great Heights University Library
Academic discovery, digital access, and research support

Algorithmica (Record no. 4371)

MARC details
000 -LEADER
fixed length control field 04062nas a22004095i 4500
001 - CONTROL NUMBER
control field 1432-0541
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260610082532.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 150723s||||||||xxuuu poo|||||| b|EN |d
022 ## - INTERNATIONAL STANDARD SERIAL NUMBER
International Standard Serial Number 1432-0541
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/453.1432-0541
Source of number or code doi
210 10 - ABBREVIATED TITLE
Abbreviated title Algorithmica
245 10 - TITLE STATEMENT
Title Algorithmica
Medium [electronic resource] /
Statement of responsibility, etc. edited by Mohammad T. Hajiaghayi.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture New York :
Name of producer, publisher, distributor, manufacturer Springer US :
-- Imprint: Springer.
300 ## - online resource
Other physical details online resource.
520 ## - SUMMARY, ETC.
Summary, etc. The 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 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science—Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer engineering.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer networks .
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Data structures (Computer science).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Information theory.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Design and Analysis of Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Theory of Computation.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Mathematics of Computing.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Engineering and Networks.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Data Structures and Information Theory.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Hajiaghayi, Mohammad T.
Relator term editor.
Relationship edt
-- http://id.loc.gov/vocabulary/relators/edt
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Printed version:
International Standard Serial Number 0178-4617
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/453.1432-0541">https://doi.org/10.1007/453.1432-0541</a>
Public note Hybrid

No items available.