MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "An Optimally Efficient" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1,818 documents found, showing 1 through 10. Next 10 →

ATOM

On optimal and efficient in place merging
by Pok-son Kim, Arne Kutzner — 2006 — SOFSEM 2006. Volume 3831 of Lecture Notes in Computer Science
…On Optimal and Efficient in Place Merging Pok-Son Kim 1⋆ and Arne Kutzner 2 1 Kookmin University…
Cited by 1 (1 self) – Add To MetaCart

Optimal and Efficient Merging Schedules for
by Video-On-Demand Servers Derek, Derek Eager, Mary Vernon, John Zahorjan — 2002 — in Proc. ACM Multimedia
…Optimal and Efficient Merging Schedules for Video-on-Demand Servers Derek Eager Mary Vernon John…
Add To MetaCart

Optimal Efficiency of Optimistic Contract Signing
by Birgit Pfitzmann, Matthias Schunter, Michael Waidner — 1998 — 17th Symposium on Principles of Distributed Computing (PODC), ACM
…Optimal Efficiency of Optimistic Contract Signing Birgit Pfitzmann Matthias Schunter Michael…
Cited by 22 (4 self) – Add To MetaCart

Dynamic Optimization for Efficient Strong Atomicity
by Florian T. Schneider, Vijay Menon, Tatiana Shpeisman
…Dynamic Optimization for Efficient Strong Atomicity Florian T. Schneider Department of Computer…
Cited by 1 (0 self) – Add To MetaCart

Towards optimal and efficient perfectly secure message transmission
by Matthias Fitzi, Matthew Franklin, S. Harsha Vardhan — 2007 — In Proc. 4th Theory of Cryptography Conference (TCC ’07), Lecture Notes in Computer Science
…Towards Optimal and Efficient Perfectly Secure Message Transmission Matthias Fitzi 1,⋆ , Matthew…
Cited by 3 (2 self) – Add To MetaCart

Optimal and Efficient Path Planning for Unknown and Dynamic Environments
by Anthony Stentz, Is Carnegle Mellon — 1993 — International Journal of Robotics and Automation
…Optimal and Efficient Path Planning for Unknown and Dynamic Environments Anthony Stentz CMU…
Cited by 37 (5 self) – Add To MetaCart

Optimal efficiency guarantees for network design mechanisms
by Tim Roughgarden, Mukund Sundararajan — 2007 — In Proceedings of the 12th Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 4513 of Lecture Notes in Computer Science
…Optimal Efficiency Guarantees for Network Design Mechanisms ⋆ Tim Roughgarden⋆⋆1 ⋆ ⋆ ⋆1 and Mukund…
Cited by 1 (1 self) – Add To MetaCart

Round-optimal and efficient verifiable secret sharing
by Matthias Fitzi, Juan Garay, Shyamnath Gollakota, Kannan Srinathan — 2006 — In Proc. 3rd Theory of Cryptography Conference (TCC’06), Lecture Notes in Computer Science
…Round-Optimal and Efficient Verifiable Secret Sharing Matthias Fitzi 1⋆ , Juan Garay 2…
Cited by 10 (3 self) – Add To MetaCart

Optimally Efficient Accountable Time-Stamping
by Ahto Buldas, Helger Lipmaa, Berry Schoenmakers — 2000 — Public Key Cryptography '2000
…. pp. 293-305. Optimally Efficient Accountable Time-Stamping Ahto Buldas ⋆1 , Helger Lipmaa ⋆1…
Cited by 20 (5 self) – Add To MetaCart

Optimal, efficient reconstruction of phylogenetic networks with constrained recombination
by Dan Gusfield, Satish Eddhu, Charles Langley — 2003 — J. Bioinformatics and Computational Biology
…Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination Dan Gusfield…
Cited by 56 (12 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB