Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



  history
ID: 517736.0, MPI für Informatik / Algorithms and Complexity Group
Approximation algorithms for maximum two-dimensional pattern matching
Authors:Arikati, Srinivasa Rao; Dessmark, Anders; Lingas, Andrzej; Marathe, Madhav V.
Language:English
Publisher:Springer
Place of Publication:Berlin
Date of Publication (YYYY-MM-DD):1996
Title of Proceedings:Combinatorial Pattern Matching: 7th Annual Symposium, CPM96
Start Page:348
End Page:360
Title of Series:Lecture Notes in Computer Science
Place of Conference/Meeting:Laguna Beach, California, USA
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
1996-06-10
End Date of Conference/Meeting 
 (YYYY-MM-DD):
1996-06-12
Review Status:not specified
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2010-03-02
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-40488A66FB99C851C12564840053FE43-...
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.