History


Please fill in your query. A complete syntax description you will find on the General Help page.

Result 41 to 60 of 141 total

Selecting sums in arrays (English)
ISAAC, 100-111 (2008).
WorldCat.org
41
Proceedings of the ninth workshop on algorithm engineering and experiments (ALENEX 07)and the fourth workshop on analytic algorithmics and combinatorics (ANALCO 07), New Orleans, LA, USA, January 6, 2007. (English)
Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-28-3). x, 287~p. (2007).
WorldCat.org
42
The ComBack method ‒ extending hash compaction with backtracking. (English)
Kleijn, Jetty (ed.) et al., Petri nets and other models of concurrency ‒ ICATPN 2007. 28th international conference on applications and theory of Petri nets and other models of concurrency, ICATPN 2007, Siedlce, Poland, June 25‒29, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73093-4/pbk). Lecture Notes in Computer Science 4546, 445-464 (2007).
WorldCat.org
43
Optimal resilient dynamic dictionaries. (English)
Arge, Lars (ed.) et al., Algorithms ‒ ESA 2007. 15th annual European symposium, Eilat, Israel, October 8‒10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 347-358 (2007).
WorldCat.org
44
A linear time algorithm for the $k$ maximal sums problem. (English)
Kučera, Luděk (ed.) et al., Mathematical foundations of computer science 2007. 32nd international symposium, MFCS 2007, Český Krumlov, Czech Republic, August 26‒31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74455-9/pbk). Lecture Notes in Computer Science 4708, 442-453 (2007).
WorldCat.org
45
Dynamic matchings in convex bipartite graphs. (English)
Kučera, Luděk (ed.) et al., Mathematical foundations of computer science 2007. 32nd international symposium, MFCS 2007, Český Krumlov, Czech Republic, August 26‒31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74455-9/pbk). Lecture Notes in Computer Science 4708, 406-417 (2007).
WorldCat.org
46
Engineering a cache-oblivious sorting algorithm. (English)
ACM J. Exp. Algorithm. 12, Spec. Iss., Article 2.2, 23 p., electronic only (2008).
WorldCat.org
47
Engineering a cache-oblivious sorting algorithm (English)
ACM Journal of Experimental Algorithmics 12 (2007).
WorldCat.org
48
The comback method - extending hash compaction with backtracking (English)
ICATPN, 445-464 (2007).
WorldCat.org
50
Dynamic matchings in convex bipartite graphs (English)
MFCS, 406-417 (2007).
WorldCat.org
51
A linear time algorithm for the $k$ maximal sums problem (English)
MFCS, 442-453 (2007).
WorldCat.org
52
Computing the all-pairs quartet distance on a set of evolutionary trees (English)
APBC, 91-100 (2007).
WorldCat.org
53
Computing the quartet distance between evolutionary trees of bounded degree (English)
APBC, 101-110 (2007).
WorldCat.org
54
Optimal sparse matrix dense vector multiplication in the I/O-model (English)
SPAA, 61-70 (2007).
WorldCat.org
55
Cache-oblivious string dictionaries. (English)
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22‒24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 581-590 (2006).
WorldCat.org
56
Skewed binary search trees. (English)
Azar, Yossi (ed.) et al., Algorithms ‒ ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11‒13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). Lecture Notes in Computer Science 4168, 708-719 (2006).
WorldCat.org
57
Purely functional worst case constant time catenable sorted lists. (English)
Azar, Yossi (ed.) et al., Algorithms ‒ ESA 2006. 14th annual European symposium, Zurich, Switzerland, September 11‒13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-38875-3/pbk). Lecture Notes in Computer Science 4168, 172-183 (2006).
WorldCat.org
58
Faster algorithms for computing longest common increasing subsequences. (English)
Lewenstein, Moshe (ed.) et al., Combinatorial pattern matching. 17th annual symposium, CPM 2006, Barcelona, Spain, July 5‒7, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-35455-0/pbk). Lecture Notes in Computer Science 4009, 330-341 (2006).
WorldCat.org
59
Purely functional worst case constant time catenable sorted lists (English)
ESA, 172-183 (2006).
WorldCat.org
60

Result 41 to 60 of 141 total

Valid XHTML 1.0 Transitional Valid CSS!