Algorithms and Computation

4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings

AvKam W. Ng,Prabhakar Raghavan

Häftad, Engelska, 1993

Del i serien Lecture Notes in Computer Science

1 137 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This volume presents the proceedings of the fourth annualInternational Symposium on Algorithms and Computation, heldin Hong Kong in December 1993.Numerous selected paperspresent original research in such areas as design andanalysis of algorithms, computational complexity, and theoryof computation. Topics covered include:- automata, languages, and computability,- combinatorial, graph, geometric, and randomizedalgorithms,- networks and distributed algorithms,- VLSIand parallel algorithms,- theory of learning and robotics,- number theory and robotics.Three invited papers are also included.

Produktinformation

Utgivningsdatum:1993-11-26
Mått:155 x 233 x 31 mm
Vikt:844 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:546
Upplaga:1993
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540575689

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

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.

Du kanske också är intresserad av

Randomized Algorithms

Rajeev Motwani, Prabhakar Raghavan

Inbunden, 1995

1 096 kr

Introduction to Information Retrieval

Hinrich Schutze, Prabhakar Raghavan, Christopher D. Manning

E-bok

2008

986 kr

Introduction to Information Retrieval

Christopher D. Manning, Prabhakar Raghavan, Hinrich Schütze

Inbunden, 2008

1 000 kr

Introduction to Information Retrieval

Hinrich Schutze, Prabhakar Raghavan, Christopher D. Manning

E-bok

2008

986 kr

Nyhet

L’amour toujours : Berättelsen om Tidö

Maggie Strömberg, Torbjörn Nilsson

Inbunden, 2026

275 kr

-19%

Nattsäsong

Karolina Ramqvist

Inbunden, 2026

215 kr265 kr

Ruth Kvarnström-Jones - SIGNERAD - Systrarna på Sophiahemmet, Inbunden

Signerad!

Del 3

SIGNERAD - Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

249 kr

IJustWantToBeCool, Joel Adolphson, Emil Ejdemo Beer, Victor Beer - SIGNERAD - Kopians hämnd, Inbunden

Signerad!

Del 2

SIGNERAD - Kopians hämnd

IJustWantToBeCool, Joel Adolphson, Emil Ejdemo Beer, Victor Beer

Inbunden, 2026

189 kr

-21%

Ha en nice dag

Mikael Yvesand

Inbunden, 2026

189 kr239 kr

Nyhet

Domino : Dåren, domaren och den välkammade mannen från pirayaministeriet

Håkan Nesser

Inbunden, 2026

259 kr

Algorithms and Computation

4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993. Proceedings

AvKam W. Ng,Prabhakar Raghavan

Häftad, Engelska, 1993

Del i serien Lecture Notes in Computer Science

1 137 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

Produktinformation

Utgivningsdatum:1993-11-26
Mått:155 x 233 x 31 mm
Vikt:844 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:546
Upplaga:1993
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540575689

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

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.