ISBN: 9783540482338
This volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present origin… Mehr…
Springer.com new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00) Details... |
ISBN: 9783540482338
This volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present origin… Mehr…
Springer.com Nr. 978-3-540-48233-8. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00) Details... |
ISBN: 9783540482338
Computer Science; Theory of Computation; Computation by Abstract Devices; Combinatorics; Probability Theory and Stochastic Processes; Statistics, general; Information Storage and Retrieva… Mehr…
Springer.com Versandkosten:zzgl. Versandkosten Details... |
ISBN: 9783540482338
Computer Science; Theory of Computation; Computation by Abstract Devices; Combinatorics; Probability Theory and Stochastic Processes; Statistics, general; Information Storage and Retrieva… Mehr…
Springer.com Versandkosten:zzgl. Versandkosten. Details... |
ISBN: 9783540482338
This volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present origin… Mehr…
ISBN: 9783540482338
This volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present origin… Mehr…
ISBN: 9783540482338
Computer Science; Theory of Computation; Computation by Abstract Devices; Combinatorics; Probability Theory and Stochastic Processes; Statistics, general; Information Storage and Retrieva… Mehr…
ISBN: 9783540482338
Computer Science; Theory of Computation; Computation by Abstract Devices; Combinatorics; Probability Theory and Stochastic Processes; Statistics, general; Information Storage and Retrieva… Mehr…
Bibliographische Daten des bestpassenden Buches
Autor: | |
Titel: | |
ISBN-Nummer: |
Detailangaben zum Buch - Algorithms and Computation
EAN (ISBN-13): 9783540482338
Herausgeber: Springer Science+Business Media
Buch in der Datenbank seit 2017-01-29T17:51:17+01:00 (Zurich)
Detailseite zuletzt geändert am 2024-02-13T15:43:15+01:00 (Zurich)
ISBN/EAN: 9783540482338
ISBN - alternative Schreibweisen:
978-3-540-48233-8
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: chin chin
Titel des Buches: algorithms
Daten vom Verlag:
Autor/in: Kam W. Ng; Prabhakar Raghavan; N.V. Balasubramanian; Francis Y.L. Chin
Titel: Lecture Notes in Computer Science; Algorithms and Computation - 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings
Verlag: Springer; Springer Berlin
546 Seiten
Erscheinungsjahr: 2005-07-14
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XIII, 546 p.
EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; AAC; Algorithms; Automat; DOM; algorithm; automata; complexity; computability; robot; robotics; combinatorics; C; Theory of Computation; Discrete Mathematics; Probability Theory; Statistics; Information Storage and Retrieval; Computer Science; Diskrete Mathematik; Wahrscheinlichkeitsrechnung und Statistik; Stochastik; Informationsrückgewinnung, Information Retrieval; Data Warehousing; BC
Reaching a goal with directional uncertainty.- Constructing degree-3 spanners with other sparseness properties.- Remembering conflicts in history yields dynamic algorithms.- Coloring random graphs in polynomial expected time.- Graphical degree sequence problems with connectivity requirements.- How to treat delete requests in semi-online problems.- Finding the shortest watchman route in a simple polygon.- Constructing shortest watchman routes by divide-and-conquer.- A graph coloring result and its consequences for some guarding problems.- The maximum k-dependent and f-dependent set problem.- Finding shortest non-crossing rectilinear paths in plane regions.- Treewidth of circle graphs.- A framework for constructing heap-like structures in-place.- Double-ended binomial queues.- A simple balanced search tree with O(1) worst-case update time.- Mapping dynamic data and algorithm structures into product networks.- Permutation routing on reconfigurable meshes.- Adaptive and oblivious algorithms for d-cube permutation routing.- On quadratic lattice approximations.- A 2/3-approximation of the matroid matching problem.- Using fractal geometry for solving divide-and-conquer recurrences.- Simple combinatorial Gray codes constructed by reversing sublists.- Time space tradeoffs (getting closer to the barrier?).- Separating exponentially ambiguous NFA from polynomially ambiguous NFA.- Threshold computation and cryptographic security.- On the Power of reading and writing simultaneously in parallel computations.- Relativizing complexity classes with Random Oracles.- An introduction to perpetual gossiping.- A probabilistic selection network with butterfly networks.- Optimal group gossiping in hypercubes under wormhole routing model.- Optimal linear broadcast routing with capacity limitations.- Multicommodity flows: A survey of recent research.- Parallel construction of canonical ordering and convex drawing of triconnected planar graphs.- Number theory helps line detection in digital images an extended abstract.- Optimally computing the shortest weakly visible subedge of a simple polygon preliminary version.- Multicommodity flows in even, planar networks.- Linear time algorithms for disjoint Two-Face Paths Problems in planar graphs.- Robot mapping: Foot-prints vs tokens.- Recent developments on the approximability of combinatorial problems.- On the relationship among cryptographic physical assumptions.- Separating complexity classes related to bounded alternating ?-branching programs.- The complexity of the optimal variable ordering problems of shared binary decision diagrams.- On Horn envelopes and hypergraph transversals.- Page migration algorithms using work functions.- Memory paging for connectivity and path problems in graphs.- Randomized competitive algorithms for successful and unsuccessful search on self-adjusting linear lists.- Randomized on-line algorithms for the page replication problem.- New algorithms for minimizing the longest wire length during circuit compaction.- Parallel algorithms for single-layer channel routing.- Consecutive interval query and dynamic programming on intervals.- An improved algorithm for the traveler's problem.- Vehicle scheduling on a tree with release and handling times.- Scheduling algorithms for a chain-like task system.- Weighted independent perfect domination on cocomparability graphs.- Plane sweep algorithms for the polygonal approximation problems with applications.- Optimal rectilinear steiner tree for extremal point sets.- Faster approximation algorithms for the rectilinear steiner tree problem.Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783319046563 Algorithms and Computation (Sudebkumar Prasant Pal)
< zum Archiv...