Algorithms and Data Structures: 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997. Proceedings, Band 5

Cover
Springer Science & Business Media, 23.07.1997 - 476 Seiten
The book is an introduction to the theory of cubic metaplectic forms on the 3-dimensional hyperbolic space and the author's research on cubic metaplectic forms on special linear and symplectic groups of rank 2. The topics include: Kubota and Bass-Milnor-Serre homomorphisms, cubic metaplectic Eisenstein series, cubic theta functions, Whittaker functions. A special method is developed and applied to find Fourier coefficients of the Eisenstein series and cubic theta functions. The book is intended for readers, with beginning graduate-level background, interested in further research in the theory of metaplectic forms and in possible applications.
 

Was andere dazu sagen - Rezension schreiben

Es wurden keine Rezensionen gefunden.

Ausgewählte Seiten

Inhalt

Discrepancy Theory and Computational Geometry
1
Dynamic Motion Planning in Low Obstacle Density Environments
3
VisibilityBased PursuitEvasion in a Polygonal Environment
17
Maintaining the Extent of a Moving Point Set
31
Finding Cores of Limited Length
45
On Bipartite Crossings Largest Biplanar Subgraphs and the Linear Arrangement Problem
55
Approximation Algorithms for a Genetic Diagnostics Problem
69
Cartographic Line Simplication and Polygon CSG Formulae in On log n Time
93
Online Scheduling with Hard Deadlines Extended Abstract
258
Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and ConflictFree Templates Access
272
Parallel vs Parametric Complexity
282
PositionIndependent Near Optimal Searching and Online Recognition in Star Polygons
284
Dynamic Data Structures for Fat Objects and Their Applications
297
Unit Disks in the Plane
307
On Hamiltonian Triangulations in Simple Polygons
321
Computing Orthogonal Drawings with the Minimum Number of Bends
331

Constrained TSP and LowPower Computing
104
Online Load Balancing for Related Machines
116
A LinearTime Algorithm for the 1Mismatch Problem
126
On Some Geometric Optimization Problems in Layered Manufacturing
136
New TSP Construction Heuristics and Their Relationships to the 2Opt
150
Pattern Matching in Hypertext
160
Multiple Approximate String Matching
174
Applied Computational Geometry Abstract
185
Checking the Convexity of Polytopes and the Planarity of Subdivisions
186
Voronoi Diagrams for PolygonOffset Distance Functions
200
Randomized Algorithms for that Ancient Scheduling Problem
210
Optimal Parallel Algorithms for Proximate Points with Applications
224
An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments
234
On Geometric Path Query Problems
248
On a Simple DepthFirst Search Strategy for Exploring Unknown Graphs
345
Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends
354
A Centroid Labelling Technique and Its Application to Path Selection in Trees
368
OffsetPolygon Annulus Placement Problems
378
Computing Constrained MinimumWidth Annuli of Point Sets
392
Geometric Applications of Posets
402
Constructing Pairwise Disjoint Paths with Few Links
416
Transdichotomous Algorithms Without Multiplication Some Upper and Lower Bounds
426
An Approximation Algorithm for Stacking Up Bins from a Conveyer onto Pallets
440
Relaxed Balance through Standard Rotations
450
Efficient Breakout Routing in Printed Circuit Boards
462
Planarity Revisited
472
Author Index
475
Urheberrecht

Häufige Begriffe und Wortgruppen

Bibliografische Informationen