|
Search the dblp DataBase
Benoît Hudson:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Michael T. Goodrich, Mark Handy, Benoît Hudson, Roberto Tamassia
Accessing the Internal Organization of Data Structures in the JDSL Library. [Citation Graph (0, 0)][DBLP] ALENEX, 1999, pp:124-139 [Conf]
- Benoît Hudson, Tuomas Sandholm
Effectiveness of Preference Elicitation in Combinatorial Auctions. [Citation Graph (0, 0)][DBLP] AMEC, 2002, pp:69-86 [Conf]
- Benoît Hudson, Tuomas Sandholm
Generalizing preference elicitation in combinatorial auctions. [Citation Graph (0, 0)][DBLP] AAMAS, 2003, pp:1014-1015 [Conf]
- Benoît Hudson, Tuomas Sandholm
Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions. [Citation Graph (0, 0)][DBLP] AAMAS, 2004, pp:386-393 [Conf]
- Benoît Hudson, Gary L. Miller
Using bistellar flips for rotations in point location structures. [Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:29-32 [Conf]
- Benoît Hudson, Tuomas Sandholm
Using value queries in combinatorial auctions. [Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2003, pp:226-227 [Conf]
- Benoît Hudson, Tuomas Sandholm
Effectiveness of Preference Elicitation in Combinatorial Auctions [Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal]
- Benoît Hudson, Gary L. Miller, Todd Phillips
Sparse parallel Delaunay mesh refinement. [Citation Graph (0, 0)][DBLP] SPAA, 2007, pp:339-347 [Conf]
An Efficient Query Structure for Mesh Refinement. [Citation Graph (, )][DBLP]
Dynamic well-spaced point sets. [Citation Graph (, )][DBLP]
Topological inference via meshing. [Citation Graph (, )][DBLP]
Sparse Voronoi Refinement. [Citation Graph (, )][DBLP]
SVR: Practical Engineering of a Fast 3D Meshing Algorithm*. [Citation Graph (, )][DBLP]
Size complexity of volume meshes vs. surface meshes. [Citation Graph (, )][DBLP]
Succinct Representation of Well-Spaced Point Clouds [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|