Result 1 to 20 of 428 total
Drawing graphs in the plane with a prescribed outer face and polynomial area. (English)
J. Graph Algorithms Appl. 16, No. 2, 243-259 (2012).
1
Anonymous card shuffling and its applications to parallel mixnets. (English)
Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9‒13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 549-560 (2012).
2
Extended dynamic subgraph statistics using $h$-index parameterized data structures. (English)
Theor. Comput. Sci. 447, 44-52 (2012).
3
Force-directed Lombardi-style graph drawing. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 320-331 (2012).
4
Planar and poly-arc lombardi drawings. (English)
van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21‒23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 308-319 (2012).
5
Lombardi drawings of graphs. (English)
J. Graph Algorithms Appl. 16, No. 1, 85-108 (2012).
6
Learning to compete, coordinate, and cooperate in repeated games using reinforcement learning. (English)
Mach. Learn. 82, No. 3, 281-314 (2011).
7
Round-trip Voronoi diagrams and doubling density in geographic networks. (English)
Gavrilova, Marina L. (ed.) et al., Transactions on Computational Science XIV. Special issue on Voronoi diagrams and Delaunay triangulation. Berlin: Springer (ISBN 978-3-642-25248-8/pbk). Lecture Notes in Computer Science 6970. Journal Subline, 211-238 (2011).
8
External-memory multimaps. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 384-394 (2011).
9
Sorting, searching, and simulation in the mapreduce framework. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 374-383 (2011).
10
Fully retroactive approximate range and nearest neighbor searching. (English)
Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 292-301 (2011).
11
External-memory network analysis algorithms for naturally sparse graphs. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 664-676 (2011).
12
Tracking moving objects with few handovers. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 362-373 (2011).
13
External-memory network analysis algorithms for naturally sparse graphs. (English)
Comput. Res. Repos. 2011, Article No. 1106.6336 (2011).
14
Privacy-preserving group data access via stateless oblivious RAM simulation. (English)
Comput. Res. Repos. 2011, Article No. 1105.4125 (2011).
15
Tracking moving objects with few handovers. (English)
Comput. Res. Repos. 2011, Article No. 1105.0392 (2011).
16
External-memory multimaps. (English)
Comput. Res. Repos. 2011, Article No. 1104.5533 (2011).
17
Privacy-preserving access of outsourced data via oblivious RAM simulation. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 576-587 (2011).
18
Efficient authenticated data structures for graph connectivity and geometric search problems. (English)
Algorithmica 60, No. 3, 505-552 (2011).
19
Data-oblivious external-memory algorithms for the compaction, selection, and sorting of outsourced data. (English)
Comput. Res. Repos. 2011, Article No. 1103.5102 (2011).
20
Result 1 to 20 of 428 total
Start
Contact
Print
General Help
