The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Benoît Hudson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Benoît Hudson, Tuomas Sandholm
    Effectiveness of Preference Elicitation in Combinatorial Auctions. [Citation Graph (0, 0)][DBLP]
    AMEC, 2002, pp:69-86 [Conf]
  3. Benoît Hudson, Tuomas Sandholm
    Generalizing preference elicitation in combinatorial auctions. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2003, pp:1014-1015 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. Benoît Hudson, Tuomas Sandholm
    Effectiveness of Preference Elicitation in Combinatorial Auctions [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  8. Benoît Hudson, Gary L. Miller, Todd Phillips
    Sparse parallel Delaunay mesh refinement. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:339-347 [Conf]

  9. An Efficient Query Structure for Mesh Refinement. [Citation Graph (, )][DBLP]


  10. Dynamic well-spaced point sets. [Citation Graph (, )][DBLP]


  11. Topological inference via meshing. [Citation Graph (, )][DBLP]


  12. Sparse Voronoi Refinement. [Citation Graph (, )][DBLP]


  13. SVR: Practical Engineering of a Fast 3D Meshing Algorithm*. [Citation Graph (, )][DBLP]


  14. Size complexity of volume meshes vs. surface meshes. [Citation Graph (, )][DBLP]


  15. Succinct Representation of Well-Spaced Point Clouds [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002