Please note that eDoc will be permanently shut down in the first quarter of 2021!      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:


          Display Documents


Institute:
Collection:
Print in Citation style Print version     Display:
Sort by: Display records with Fulltext only
Entries: 1-10  
 Basket 
Finding Simplices containing the Origin in Two and Three Dimensions
Authors: Elbassioni, Khaled; Elmasry, Amr; Makino, Kazuhisa
Date of Publication (YYYY-MM-DD): 2011
Title of Journal: International Journal of Computational Geometry & Applications
Volume: 21
Issue / Number: 5
Start Page: 495
End Page: 506
Document Type: Article
ID: 618725.0
An O(n+ m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
Authors: Elmasry, Amr; Mehlhorn, Kurt; Schmidt, Jens M.
Date of Publication (YYYY-MM-DD): 2010
Title of Journal: Algorithmica
Volume: Online First
Start Page: 1
End Page: 13
Document Type: Article
ID: 536712.0
On the Approximability of the Maximum Interval Constrained Coloring Problem
Authors: Canzar, Stefan; Elbassioni, Khaled; Elmasry, Amr; Raman, Rajiv
Place of Publication: Berlin
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2010
Title of Proceedings: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II
Start Page: 168
End Page: 179
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 536788.0
Pairing heaps, scrambled pairing and square-root trees
Authors: Elmasry, Amr
Date of Publication (YYYY-MM-DD): 2010
Title of Journal: International Journal of Computer Mathematics
Volume: 87
Issue / Number: 14
Start Page: 3096
End Page: 3110
Document Type: Article
ID: 536812.0
Strictly-regular number system and data structures
Authors: Elmasry, Amr; Jensen, Claus; Katajainen, Jyrki
Place of Publication: Berlin
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2010
Title of Proceedings: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory
Start Page: 26
End Page: 37
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 536814.0
The longest almost-increasing subsequence
Authors: Elmasry, Amr
Date of Publication (YYYY-MM-DD): 2010
Title of Journal: Information Processing Letters
Volume: 110
Issue / Number: 16
Start Page: 655
End Page: 658
Document Type: Article
ID: 536813.0
The Magic of a Number System
Authors: Elmasry, Amr; Jensen, Claus; Katajainen, Jyrki
Place of Publication: Berlin
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2010
Title of Proceedings: Fun with Algorithms : 5th International Conference, FUN 2010
Start Page: 156
End Page: 165
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 536815.0
Enumerating Trichromatic Triangles Containing the Origin in Linear Time
Authors: Elmasry, Amr; Manjunath, Madhusudan
Place of Publication: http://www.jaist.ac.jp/~uehara/JCCGG09/
Date of Publication (YYYY-MM-DD): 2009
Title of Proceedings: Japanese Conference in Computational Geometry and Graphs 2009
Start Page: 101
End Page: 103
Title of Series: Japanese Conference in Computational Geometry and Graphs 2009
Document Type: Conference-Paper
ID: 518270.0
Pairing Heaps with O(log log n) decrease Cost
Authors: Elmasry, Amr
Place of Publication: Philadelphia (PA), USA
Publisher: Society for Industrial and Applied Mathematics (SIAM)
Date of Publication (YYYY-MM-DD): 2009
Title of Proceedings: 20th ACM-SIAM Symposium on Discrete Algorithms
Start Page: 471
End Page: 476
Document Type: Conference-Paper
ID: 518315.0
Indexing Schemes for Multi-dimensional Moving Objects
Authors: Elbassioni, Khaled; Elmasry, Amr; Kamel, Ibrahim
Title of Book: Encyclopedia of GIS
Start Page: 523
End Page: 529
Place of Publication: Berlin
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2008
Document Type: InBook
ID: 428054.0
Entries: 1-10  
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.