Avis David

Last Update: 2015/10/21 09:40:56

Print

Name(Kanji/Kana/Abecedarium Latinum)
Avis David/エイビス ディビッド/Avis, David
Primary Affiliation(Org1/Job title)
Graduate School of Informatics/Researcher
Faculty
Org1 Job title
工学部
Contact Address
Type Address(Japanese) Address(English)
Office 京都市左京区吉田本町 京都大学大学院情報学研究科 総合7号館404号室 Room 404, Research Building No.7 Graduate School of Informatics, Kyoto University Yoshida Honmachi, Sakyo-ku, Kyoto 606-8501 Japan
Phone
Type Number
Office 075-753-5953
Academic Degree
Field(Japanese) Field(English) University(Japanese) University(English) Method
M.S. スタンフォード大学 Stanford University
Ph.D. スタンフォード大学 Stanford University
Academic Resume (Graduate Schools)
University(Japanese) University(English) Faculty(Japanese) Faculty(English) Major(Japanese) Major(English) Completion Status
スタンフォード大学 Stanford University オペレーションズリサーチ Operations Research 修了
Work Experience
Period Organization(Japanese) Organization(English) Job title(Japanese) Job title(English)
1977/09/01-1981/05/31 マギル大学 McGill University 助教 Assistant Professor
1981/06/01-1987/05/31 マギル大学 McGill University 准教授 Associate Professor
1987/06/01- マギル大学 McGill University 教授 Professor
2010/01/01- 京都大学大学院 Graduate School of Kyoto University 特定教授(G30) Professor
Personal Profile
(English)
I am a professor in Kyoto University's G30 program, where the goal is to provide education in English for Japanese and foreign students. Hence all my courses and research supervision are conducted entirely in English.
Language of Instruction
Language(japanese) Language(english) Code
英語
フランス語
日本語
Personal Website(s) (URL(s))
URL
http://www.i.kyoto-u.ac.jp/~avis/
researchmap URL
https://researchmap.jp/7000008853
Research Topics
(English)
Geometric computation, discrete optimization, and quantum information.
Overview of the research
(English)
Geometric structures, especially high dimensional polyhedra, have become essential components of models in many areas of engineering and science. Applications arise in such diverse areas as bio-mechanics, chemistry, embedded systems, game theory, physics, robotics, scheduling and wireless networks. They are also at the heart of discrete optimization, particularly linear and integer programming. Related computational problems are computationally hard, and many important practical problems are currently out of reach with present technology. Our goal is to create new theoretical methods for geometric computation and to implement them in efficient, easily usable software for end-users.
Fields of research (key words)
Key words(Japanese) Key words(English)
Geometric Computation
Discrete Optimization
Quantum Information
Published Papers
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
D. Avis; H.R. Tiwary D. Avis; H.R. Tiwary D. Avis; H.R. Tiwary On the extension complexity of combinatorial polytopes On the extension complexity of combinatorial polytopes On the extension complexity of combinatorial polytopes Mathematical Programming, 1-21 Mathematical Programming, 1-21 Mathematical Programming, 1-21 2014 Refereed English Disclose to all
D. Avis; K. Iwama; D. Paku D. Avis; K. Iwama; D. Paku D. Avis; K. Iwama; D. Paku Reputation games for undirected graphs Reputation games for undirected graphs Reputation games for undirected graphs Discrete Applied Mathematics, 166, 1-13 Discrete Applied Mathematics, 166, 1-13 Discrete Applied Mathematics, 166, 1-13 2014 Refereed English Disclose to all
M. Cuturi; D. Avis M. Cuturi; D. Avis M. Cuturi; D. Avis Ground metric learning Ground metric learning Ground metric learning Journal of Machine Learning Research, 15, 533-564 Journal of Machine Learning Research, 15, 533-564 Journal of Machine Learning Research, 15, 533-564 2014 Refereed English Disclose to all
D. Avis; H. Miyata; S. Moriyama D. Avis; H. Miyata; S. Moriyama D. Avis; H. Miyata; S. Moriyama Families of polytopal digraphs that do not satisfy the shelling property Families of polytopal digraphs that do not satisfy the shelling property Families of polytopal digraphs that do not satisfy the shelling property Computational Geometry: Theory and Applications, 46, 3, 382-393 Computational Geometry: Theory and Applications, 46, 3, 382-393 Computational Geometry: Theory and Applications, 46, 3, 382-393 2013 Refereed English Disclose to all
D. Avis; H.R. Tiwary D. Avis; H.R. Tiwary D. Avis; H.R. Tiwary On the extension complexity of combinatorial polytopes On the extension complexity of combinatorial polytopes On the extension complexity of combinatorial polytopes Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7965 LNCS, PART 1, 57-68 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7965 LNCS, PART 1, 57-68 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7965 LNCS, PART 1, 57-68 2013 Refereed English Disclose to all
D. Avis; G. Roumanis D. Avis; G. Roumanis D. Avis; G. Roumanis A portable parallel implementation of the lrs vertex enumeration code A portable parallel implementation of the lrs vertex enumeration code A portable parallel implementation of the lrs vertex enumeration code Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8287 LNCS, 414-429 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8287 LNCS, 414-429 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8287 LNCS, 414-429 2013 Refereed English Disclose to all
Y. Aoshima; D. Avis; T. Deering; Y. Matsumoto; S. Moriyama Y. Aoshima; D. Avis; T. Deering; Y. Matsumoto; S. Moriyama Y. Aoshima; D. Avis; T. Deering; Y. Matsumoto; S. Moriyama On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes Discrete Applied Mathematics, 160, 15, 2104-2115 Discrete Applied Mathematics, 160, 15, 2104-2115 Discrete Applied Mathematics, 160, 15, 2104-2115 2012 Refereed English Disclose to all
D. Avis; K. Iwama; D. Paku D. Avis; K. Iwama; D. Paku D. Avis; K. Iwama; D. Paku Verifying Nash equilibria in PageRank games on undirected web graphs Verifying Nash equilibria in PageRank games on undirected web graphs Verifying Nash equilibria in PageRank games on undirected web graphs Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7074 LNCS, 415-424 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7074 LNCS, 415-424 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7074 LNCS, 415-424 2011 Refereed English Disclose to all
D. Avis; P. Hayden; M.M. Wilde D. Avis; P. Hayden; M.M. Wilde D. Avis; P. Hayden; M.M. Wilde Leggett-Garg inequalities and the geometry of the cut polytope Leggett-Garg inequalities and the geometry of the cut polytope Leggett-Garg inequalities and the geometry of the cut polytope Physical Review A - Atomic, Molecular, and Optical Physics, 82, 3 Physical Review A - Atomic, Molecular, and Optical Physics, 82, 3 Physical Review A - Atomic, Molecular, and Optical Physics, 82, 3 2010 Refereed English Disclose to all
D. Avis; S. Moriyama; M. Owari D. Avis; S. Moriyama; M. Owari D. Avis; S. Moriyama; M. Owari From bell inequalities to tsirelson\\'s theorem From bell inequalities to tsirelson\\'s theorem From bell inequalities to tsirelson\\'s theorem IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E92A, 5, 1254-1267 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E92A, 5, 1254-1267 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E92A, 5, 1254-1267 2009/05 Refereed English Disclose to all
M. Ohsaki; N. Katoh; T. Kinoshita; S. Tanigawa; D. Avis; I. Streinu M. Ohsaki; N. Katoh; T. Kinoshita; S. Tanigawa; D. Avis; I. Streinu M. Ohsaki; N. Katoh; T. Kinoshita; S. Tanigawa; D. Avis; I. Streinu Enumeration of optimal pin-jointed bistable compliant mechanisms with non-crossing members Enumeration of optimal pin-jointed bistable compliant mechanisms with non-crossing members Enumeration of optimal pin-jointed bistable compliant mechanisms with non-crossing members Structural and Multidisciplinary Optimization, 37, 6, 645-651 Structural and Multidisciplinary Optimization, 37, 6, 645-651 Structural and Multidisciplinary Optimization, 37, 6, 645-651 2009/02 Refereed English Disclose to all
D. Avis; G.D. Rosenberg; R. Savani; B. von Stengel D. Avis; G.D. Rosenberg; R. Savani; B. von Stengel D. Avis; G.D. Rosenberg; R. Savani; B. von Stengel Enumeration of Nash equilibria for two-player games Enumeration of Nash equilibria for two-player games Enumeration of Nash equilibria for two-player games Economic Theory, 42, 1, 9-37 Economic Theory, 42, 1, 9-37 Economic Theory, 42, 1, 9-37 2009 Refereed English Disclose to all
D. Avis; L. Devroye; K. Iwama D. Avis; L. Devroye; K. Iwama D. Avis; L. Devroye; K. Iwama The locker problem with empty lockers The locker problem with empty lockers The locker problem with empty lockers World Academy of Science, Engineering and Technology, 36, 103-106 World Academy of Science, Engineering and Technology, 36, 103-106 World Academy of Science, Engineering and Technology, 36, 103-106 2009 Refereed English Disclose to all
D. Avis; N. Katoh; M. Ohsaki; I. Streinu; S.-I. Tanigawa D. Avis; N. Katoh; M. Ohsaki; I. Streinu; S.-I. Tanigawa D. Avis; N. Katoh; M. Ohsaki; I. Streinu; S.-I. Tanigawa Enumerating constrained non-crossing minimally rigid frameworks Enumerating constrained non-crossing minimally rigid frameworks Enumerating constrained non-crossing minimally rigid frameworks Discrete and Computational Geometry, 40, 1, 31-46 Discrete and Computational Geometry, 40, 1, 31-46 Discrete and Computational Geometry, 40, 1, 31-46 2008/07 Refereed English Disclose to all
D. Avis; H. Imai; T. Ito D. Avis; H. Imai; T. Ito D. Avis; H. Imai; T. Ito Generating facets for the cut polytope of a graph by triangular elimination Generating facets for the cut polytope of a graph by triangular elimination Generating facets for the cut polytope of a graph by triangular elimination Mathematical Programming, 112, 2, 303-325 Mathematical Programming, 112, 2, 303-325 Mathematical Programming, 112, 2, 303-325 2008 Refereed English Disclose to all
D. Avis; P. Hayden; I. Savov D. Avis; P. Hayden; I. Savov D. Avis; P. Hayden; I. Savov Distributed compression and multiparty squashed entanglement Distributed compression and multiparty squashed entanglement Distributed compression and multiparty squashed entanglement Journal of Physics A: Mathematical and Theoretical, 41, 11 Journal of Physics A: Mathematical and Theoretical, 41, 11 Journal of Physics A: Mathematical and Theoretical, 41, 11 2008 Refereed English Disclose to all
D. Avis; B. Kaluzny D. Avis; B. Kaluzny D. Avis; B. Kaluzny Computing monotone disjoint paths on polytopes Computing monotone disjoint paths on polytopes Computing monotone disjoint paths on polytopes Journal of Combinatorial Optimization, 16, 4 SPEC. ISS., 328-343 Journal of Combinatorial Optimization, 16, 4 SPEC. ISS., 328-343 Journal of Combinatorial Optimization, 16, 4 SPEC. ISS., 328-343 2008 Refereed English Disclose to all
D. Avis; B. Kaluzny; D. Titley-Péloquin D. Avis; B. Kaluzny; D. Titley-Péloquin D. Avis; B. Kaluzny; D. Titley-Péloquin Visualizing and constructing cycles in the simplex method Visualizing and constructing cycles in the simplex method Visualizing and constructing cycles in the simplex method Operations Research, 56, 2, 512-518 Operations Research, 56, 2, 512-518 Operations Research, 56, 2, 512-518 2008 Refereed English Disclose to all
D. Avis; T. Imamura D. Avis; T. Imamura D. Avis; T. Imamura A list heuristic for vertex cover A list heuristic for vertex cover A list heuristic for vertex cover Operations Research Letters, 35, 2, 201-204 Operations Research Letters, 35, 2, 201-204 Operations Research Letters, 35, 2, 201-204 2007 Refereed English Disclose to all
D. Avis D. Avis D. Avis Graphs and Combinatorics: Preface Graphs and Combinatorics: Preface Graphs and Combinatorics: Preface Graphs and Combinatorics, 23, SUPPL. 1, iii-iv Graphs and Combinatorics, 23, SUPPL. 1, iii-iv Graphs and Combinatorics, 23, SUPPL. 1, iii-iv 2007 Refereed English Disclose to all
D. Avis; A. Bondy; W. Cook; B. Reed D. Avis; A. Bondy; W. Cook; B. Reed D. Avis; A. Bondy; W. Cook; B. Reed Vašek chvátal: A very short introduction Vašek chvátal: A very short introduction Vašek chvátal: A very short introduction Graphs and Combinatorics, 23, SUPPL. 1, 41-65 Graphs and Combinatorics, 23, SUPPL. 1, 41-65 Graphs and Combinatorics, 23, SUPPL. 1, 41-65 2007 Refereed English Disclose to all
D. Avis; T. Ito D. Avis; T. Ito D. Avis; T. Ito New classes of facets of the cut polytope and tightness of I<sub>mm 22</sub> Bell inequalities New classes of facets of the cut polytope and tightness of I<sub>mm 22</sub> Bell inequalities New classes of facets of the cut polytope and tightness of I<sub>mm 22</sub> Bell inequalities Discrete Applied Mathematics, 155, 13, 1689-1699 Discrete Applied Mathematics, 155, 13, 1689-1699 Discrete Applied Mathematics, 155, 13, 1689-1699 2007 Refereed English Disclose to all
D. Avis; N. Katoh; M. Ohsaki; I. Streinu; S.-I. Tanigawa D. Avis; N. Katoh; M. Ohsaki; I. Streinu; S.-I. Tanigawa D. Avis; N. Katoh; M. Ohsaki; I. Streinu; S.-I. Tanigawa Enumerating non-crossing minimally rigid frameworks Enumerating non-crossing minimally rigid frameworks Enumerating non-crossing minimally rigid frameworks Graphs and Combinatorics, 23, 117-134 Graphs and Combinatorics, 23, 117-134 Graphs and Combinatorics, 23, 117-134 2007 Refereed English Disclose to all
T. Ito; H. Imai; D. Avis T. Ito; H. Imai; D. Avis T. Ito; H. Imai; D. Avis Bell inequalities stronger than the Clauser-Horne-Shimony-Holt inequality for three-level isotropic states Bell inequalities stronger than the Clauser-Horne-Shimony-Holt inequality for three-level isotropic states Bell inequalities stronger than the Clauser-Horne-Shimony-Holt inequality for three-level isotropic states Physical Review A - Atomic, Molecular, and Optical Physics, 73, 4 Physical Review A - Atomic, Molecular, and Optical Physics, 73, 4 Physical Review A - Atomic, Molecular, and Optical Physics, 73, 4 2006 Refereed English Disclose to all
D. Avis; J. Hasegawa; Y. Kikuchi; Y. Sasaki D. Avis; J. Hasegawa; Y. Kikuchi; Y. Sasaki D. Avis; J. Hasegawa; Y. Kikuchi; Y. Sasaki A quantum protocol to win the graph colouring game on all Hadamard graphs A quantum protocol to win the graph colouring game on all Hadamard graphs A quantum protocol to win the graph colouring game on all Hadamard graphs IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A, 5, 1378-1381 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A, 5, 1378-1381 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A, 5, 1378-1381 2006 Refereed English Disclose to all
D. Avis; H. Imai; T. Ito D. Avis; H. Imai; T. Ito D. Avis; H. Imai; T. Ito On the relationship between convex bodies related to correlation experiments with dichotomic observables On the relationship between convex bodies related to correlation experiments with dichotomic observables On the relationship between convex bodies related to correlation experiments with dichotomic observables Journal of Physics A: Mathematical and General, 39, 36, 11283-11299 Journal of Physics A: Mathematical and General, 39, 36, 11283-11299 Journal of Physics A: Mathematical and General, 39, 36, 11283-11299 2006 Refereed English Disclose to all
D. Avis; A. Deza D. Avis; A. Deza D. Avis; A. Deza Un des "problèmes plaisans et délectables" de Claude Berge Un des "problèmes plaisans et délectables" de Claude Berge Un des "problèmes plaisans et délectables" de Claude Berge Discrete Mathematics, 306, 19-20, 2299-2302 Discrete Mathematics, 306, 19-20, 2299-2302 Discrete Mathematics, 306, 19-20, 2299-2302 2006 Refereed French Disclose to all
D. Avis; N. Katoh; M. Ohsaki; I. Streinu; S.-I. Tanigawa D. Avis; N. Katoh; M. Ohsaki; I. Streinu; S.-I. Tanigawa D. Avis; N. Katoh; M. Ohsaki; I. Streinu; S.-I. Tanigawa Enumerating non-crossing minimally rigid frameworks Enumerating non-crossing minimally rigid frameworks Enumerating non-crossing minimally rigid frameworks Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4112 LNCS, 205-215 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4112 LNCS, 205-215 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4112 LNCS, 205-215 2006 Refereed English Disclose to all
D. Avis; C. De Simone; B. Reed D. Avis; C. De Simone; B. Reed D. Avis; C. De Simone; B. Reed On the fractional chromatic index of a graph and its complement On the fractional chromatic index of a graph and its complement On the fractional chromatic index of a graph and its complement Operations Research Letters, 33, 4, 385-388 Operations Research Letters, 33, 4, 385-388 Operations Research Letters, 33, 4, 385-388 2005 Refereed English Disclose to all
D. Avis; H. Imai; T. Ito; Y. Sasaki D. Avis; H. Imai; T. Ito; Y. Sasaki D. Avis; H. Imai; T. Ito; Y. Sasaki Two-party Bell inequalities derived from combinatorics via triangular elimination Two-party Bell inequalities derived from combinatorics via triangular elimination Two-party Bell inequalities derived from combinatorics via triangular elimination Journal of Physics A: Mathematical and General, 38, 50, 10971-10987 Journal of Physics A: Mathematical and General, 38, 50, 10971-10987 Journal of Physics A: Mathematical and General, 38, 50, 10971-10987 2005 Refereed English Disclose to all
D. Avis; A. Hertz; O. Marcotte D. Avis; A. Hertz; O. Marcotte D. Avis; A. Hertz; O. Marcotte Preface Preface Preface Graph Theory and Combinatorial Optimization, xiii-xv Graph Theory and Combinatorial Optimization, xiii-xv Graph Theory and Combinatorial Optimization, xiii-xv 2005 Refereed English Disclose to all
D. Avis; A. Hertz; O. Marcotte D. Avis; A. Hertz; O. Marcotte D. Avis; A. Hertz; O. Marcotte Graph theory and combinatorial optimization Graph theory and combinatorial optimization Graph theory and combinatorial optimization Graph Theory and Combinatorial Optimization, 1-264 Graph Theory and Combinatorial Optimization, 1-264 Graph Theory and Combinatorial Optimization, 1-264 2005 Refereed English Disclose to all
D. Avis; B. Kaluzny D. Avis; B. Kaluzny D. Avis; B. Kaluzny Solving Inequalities and Proving Farkas\\'s Lemma Made Easy Solving Inequalities and Proving Farkas\\'s Lemma Made Easy Solving Inequalities and Proving Farkas\\'s Lemma Made Easy American Mathematical Monthly, 111, 2, 152-157 American Mathematical Monthly, 111, 2, 152-157 American Mathematical Monthly, 111, 2, 152-157 2004 Refereed English Disclose to all
D. Avis; J. Umemoto D. Avis; J. Umemoto D. Avis; J. Umemoto Stronger linear programming relaxations of max-cut Stronger linear programming relaxations of max-cut Stronger linear programming relaxations of max-cut Mathematical Programming, Series B, 97, 3, 451-469 Mathematical Programming, Series B, 97, 3, 451-469 Mathematical Programming, Series B, 97, 3, 451-469 2003 Refereed English Disclose to all
D. Avis; C. De Simone; P. Nobili D. Avis; C. De Simone; P. Nobili D. Avis; C. De Simone; P. Nobili On the chromatic polynomial of a graph On the chromatic polynomial of a graph On the chromatic polynomial of a graph Mathematical Programming, Series B, 92, 3, 439-452 Mathematical Programming, Series B, 92, 3, 439-452 Mathematical Programming, Series B, 92, 3, 439-452 2002 Refereed English Disclose to all
D. Avis; A. Deza D. Avis; A. Deza D. Avis; A. Deza On the solitaire cone and its relationship to multi-commodity flows On the solitaire cone and its relationship to multi-commodity flows On the solitaire cone and its relationship to multi-commodity flows Mathematical Programming, Series B, 90, 1, 27-57 Mathematical Programming, Series B, 90, 1, 27-57 Mathematical Programming, Series B, 90, 1, 27-57 2001 Refereed English Disclose to all
D. Avis; K. Hosono; M. Urabe D. Avis; K. Hosono; M. Urabe D. Avis; K. Hosono; M. Urabe On the existence of a point subset with a specified number of interior points On the existence of a point subset with a specified number of interior points On the existence of a point subset with a specified number of interior points Discrete Mathematics, 241, 1-3, 33-40 Discrete Mathematics, 241, 1-3, 33-40 Discrete Mathematics, 241, 1-3, 33-40 2001 Refereed English Disclose to all
D. Avis; A. Deza D. Avis; A. Deza D. Avis; A. Deza On the binary solitaire cone On the binary solitaire cone On the binary solitaire cone Discrete Applied Mathematics, 115, 1-3, 3-14 Discrete Applied Mathematics, 115, 1-3, 3-14 Discrete Applied Mathematics, 115, 1-3, 3-14 2001 Refereed English Disclose to all
D. MacDonald; N. Kabani; D. Avis; A.C. Evans D. MacDonald; N. Kabani; D. Avis; A.C. Evans D. MacDonald; N. Kabani; D. Avis; A.C. Evans Automated 3-D extraction of inner and outer surfaces of cerebral cortex from MRI Automated 3-D extraction of inner and outer surfaces of cerebral cortex from MRI Automated 3-D extraction of inner and outer surfaces of cerebral cortex from MRI NeuroImage, 12, 3, 340-356 NeuroImage, 12, 3, 340-356 NeuroImage, 12, 3, 340-356 2000 Refereed English Disclose to all
D. Avis; L. Devroye D. Avis; L. Devroye D. Avis; L. Devroye Estimating the number of vertices of a polyhedron Estimating the number of vertices of a polyhedron Estimating the number of vertices of a polyhedron Information Processing Letters, 73, 3, 137-143 Information Processing Letters, 73, 3, 137-143 Information Processing Letters, 73, 3, 137-143 2000 Refereed English Disclose to all
D. Avis; C. De Simone; P. Nobili D. Avis; C. De Simone; P. Nobili D. Avis; C. De Simone; P. Nobili Two conjectures on the chromatic polynomial Two conjectures on the chromatic polynomial Two conjectures on the chromatic polynomial Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1776 LNCS, 154-162 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1776 LNCS, 154-162 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1776 LNCS, 154-162 2000 Refereed English Disclose to all
D. Avis; A. Deza; S. Onn D. Avis; A. Deza; S. Onn D. Avis; A. Deza; S. Onn A combinatorial approach to the solitaire game A combinatorial approach to the solitaire game A combinatorial approach to the solitaire game IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E83-A, 4, 656-661 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E83-A, 4, 656-661 IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E83-A, 4, 656-661 2000 Refereed English Disclose to all
D. Avis D. Avis D. Avis Computational experience with the reverse search vertex enumeration algorithm Computational experience with the reverse search vertex enumeration algorithm Computational experience with the reverse search vertex enumeration algorithm Optimization Methods and Software, 10, 2, 107-124 Optimization Methods and Software, 10, 2, 107-124 Optimization Methods and Software, 10, 2, 107-124 1999 Refereed English Disclose to all
D. Avis; B. Beresford-Smith; L. Devroye; H. Elgindy; E. Guévremont; F. Hurtado; B. Zhuh D. Avis; B. Beresford-Smith; L. Devroye; H. Elgindy; E. Guévremont; F. Hurtado; B. Zhuh D. Avis; B. Beresford-Smith; L. Devroye; H. Elgindy; E. Guévremont; F. Hurtado; B. Zhuh Unoriented ⊖-Maxima in the Plane: Complexity and Algorithms Unoriented ⊖-Maxima in the Plane: Complexity and Algorithms Unoriented ⊖-Maxima in the Plane: Complexity and Algorithms SIAM Journal on Computing, 28, 1, 278-296 SIAM Journal on Computing, 28, 1, 278-296 SIAM Journal on Computing, 28, 1, 278-296 1998 Refereed English Disclose to all
D. MacDonald; D. Avis; A.C. Evans D. MacDonald; D. Avis; A.C. Evans D. MacDonald; D. Avis; A.C. Evans Automatic segmentation of cortical surfaces from MRI with partial-volume correction Automatic segmentation of cortical surfaces from MRI with partial-volume correction Automatic segmentation of cortical surfaces from MRI with partial-volume correction NeuroImage, 7, 4 PART II, S703 NeuroImage, 7, 4 PART II, S703 NeuroImage, 7, 4 PART II, S703 1998 Refereed English Disclose to all
D. Avis; D. Bremner; R. Seidel D. Avis; D. Bremner; R. Seidel D. Avis; D. Bremner; R. Seidel How good are convex hull algorithms? How good are convex hull algorithms? How good are convex hull algorithms? Computational Geometry: Theory and Applications, 7, 5-6, 265-301 Computational Geometry: Theory and Applications, 7, 5-6, 265-301 Computational Geometry: Theory and Applications, 7, 5-6, 265-301 1997 Refereed English Disclose to all
D. MacDonald; R. Venugopal; Z. Caramanos; M. Petrides; D. Avis; A.C. Evans D. MacDonald; R. Venugopal; Z. Caramanos; M. Petrides; D. Avis; A.C. Evans D. MacDonald; R. Venugopal; Z. Caramanos; M. Petrides; D. Avis; A.C. Evans A surface-based 2-D sulcal atlas A surface-based 2-D sulcal atlas A surface-based 2-D sulcal atlas NeuroImage, 5, 4 PART II, S414 NeuroImage, 5, 4 PART II, S414 NeuroImage, 5, 4 PART II, S414 1997 Refereed English Disclose to all
D. Avis D. Avis D. Avis Generating Rooted Triangulations Without Repetitions Generating Rooted Triangulations Without Repetitions Generating Rooted Triangulations Without Repetitions Algorithmica (New York), 16, 6, 618-632 Algorithmica (New York), 16, 6, 618-632 Algorithmica (New York), 16, 6, 618-632 1996 Refereed English Disclose to all
D. Avis; K. Fukuda D. Avis; K. Fukuda D. Avis; K. Fukuda Reverse search for enumeration Reverse search for enumeration Reverse search for enumeration Discrete Applied Mathematics, 65, 1-3, 21-46 Discrete Applied Mathematics, 65, 1-3, 21-46 Discrete Applied Mathematics, 65, 1-3, 21-46 1996 Refereed English Disclose to all
D. Avis; D. Bremner D. Avis; D. Bremner D. Avis; D. Bremner Large convex hull problems Large convex hull problems Large convex hull problems ZAMM Zeitschrift fur Angewandte Mathematik und Mechanik, 76, SUPPL. 3, 179-182 ZAMM Zeitschrift fur Angewandte Mathematik und Mechanik, 76, SUPPL. 3, 179-182 ZAMM Zeitschrift fur Angewandte Mathematik und Mechanik, 76, SUPPL. 3, 179-182 1996 Refereed English Disclose to all
G. Ceder; G.D. Garbulsky; D. Avis; K. Fukuda G. Ceder; G.D. Garbulsky; D. Avis; K. Fukuda G. Ceder; G.D. Garbulsky; D. Avis; K. Fukuda Ground states of a ternary fcc lattice model with nearest- and next-nearest-neighbor interactions Ground states of a ternary fcc lattice model with nearest- and next-nearest-neighbor interactions Ground states of a ternary fcc lattice model with nearest- and next-nearest-neighbor interactions Physical Review B, 49, 1, 1-7 Physical Review B, 49, 1, 1-7 Physical Review B, 49, 1, 1-7 1994 Refereed English Disclose to all
D. Avis; H. Maehara D. Avis; H. Maehara D. Avis; H. Maehara Metric extensions and the L<sup>1</sup> hierarchy Metric extensions and the L<sup>1</sup> hierarchy Metric extensions and the L<sup>1</sup> hierarchy Discrete Mathematics, 131, 1-3, 17-28 Discrete Mathematics, 131, 1-3, 17-28 Discrete Mathematics, 131, 1-3, 17-28 1994 Refereed English Disclose to all
D. Avis D. Avis D. Avis The m-core properly contains the m-divisible points in space The m-core properly contains the m-divisible points in space The m-core properly contains the m-divisible points in space Pattern Recognition Letters, 14, 9, 703-705 Pattern Recognition Letters, 14, 9, 703-705 Pattern Recognition Letters, 14, 9, 703-705 1993 Refereed English Disclose to all
D. Avis D. Avis D. Avis Guest editor\\'s foreword Guest editor\\'s foreword Guest editor\\'s foreword Discrete & Computational Geometry, 10, 1, 111-112 Discrete & Computational Geometry, 10, 1, 111-112 Discrete & Computational Geometry, 10, 1, 111-112 1993 Refereed English Disclose to all
D. Avis; V.P. Grishukhin D. Avis; V.P. Grishukhin D. Avis; V.P. Grishukhin A bound on the k-gonality of facets of the hypermetric cone and related complexity problems A bound on the k-gonality of facets of the hypermetric cone and related complexity problems A bound on the k-gonality of facets of the hypermetric cone and related complexity problems Computational Geometry: Theory and Applications, 2, 5, 241-254 Computational Geometry: Theory and Applications, 2, 5, 241-254 Computational Geometry: Theory and Applications, 2, 5, 241-254 1993 Refereed English Disclose to all
D. Avis; K. Fukuda D. Avis; K. Fukuda D. Avis; K. Fukuda A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra Discrete & Computational Geometry, 8, 1, 295-313 Discrete & Computational Geometry, 8, 1, 295-313 Discrete & Computational Geometry, 8, 1, 295-313 1992 Refereed English Disclose to all
D. Avis; K. Fukuda D. Avis; K. Fukuda D. Avis; K. Fukuda A basis enumeration algorithm for linear systems with geometric applications A basis enumeration algorithm for linear systems with geometric applications A basis enumeration algorithm for linear systems with geometric applications Applied Mathematics Letters, 4, 5, 39-42 Applied Mathematics Letters, 4, 5, 39-42 Applied Mathematics Letters, 4, 5, 39-42 1991 Refereed English Disclose to all
D. Avis; P. Erdo and #x030B;s; J. Pach D. Avis; P. Erdo and #x030B;s; J. Pach D. Avis; P. Erdo and #x030B;s; J. Pach Distinct distances determined by subsets of a point set in space Distinct distances determined by subsets of a point set in space Distinct distances determined by subsets of a point set in space Computational Geometry: Theory and Applications, 1, 1, 1-11 Computational Geometry: Theory and Applications, 1, 1, 1-11 Computational Geometry: Theory and Applications, 1, 1, 1-11 1991 Refereed English Disclose to all
D. Avis; M. Doskas D. Avis; M. Doskas D. Avis; M. Doskas Algorithms for high dimensional stabbing problems Algorithms for high dimensional stabbing problems Algorithms for high dimensional stabbing problems Discrete Applied Mathematics, 27, 1-2, 39-48 Discrete Applied Mathematics, 27, 1-2, 39-48 Discrete Applied Mathematics, 27, 1-2, 39-48 1990 Refereed English Disclose to all
Arun K. Somani; Vinod K. Agarwal; David Avis Arun K. Somani; Vinod K. Agarwal; David Avis Arun K. Somani; Vinod K. Agarwal; David Avis On the complexity of single fault set diagnosability and diagnosis problems On the complexity of single fault set diagnosability and diagnosis problems On the complexity of single fault set diagnosability and diagnosis problems IEEE Transactions on Computers, 38, 2, 195-201 IEEE Transactions on Computers, 38, 2, 195-201 IEEE Transactions on Computers, 38, 2, 195-201 1989 Refereed English Disclose to all
D. Avis; J.M. Robert; R. Wenger D. Avis; J.M. Robert; R. Wenger D. Avis; J.M. Robert; R. Wenger Lower bounds for line stabbing Lower bounds for line stabbing Lower bounds for line stabbing Information Processing Letters, 33, 2, 59-62 Information Processing Letters, 33, 2, 59-62 Information Processing Letters, 33, 2, 59-62 1989 Refereed English Disclose to all
David Avis; C.W. Lai David Avis; C.W. Lai David Avis; C.W. Lai Probabilistic analysis of a heuristic for the assignment problem Probabilistic analysis of a heuristic for the assignment problem Probabilistic analysis of a heuristic for the assignment problem SIAM Journal on Computing, 17, 4, 732-741 SIAM Journal on Computing, 17, 4, 732-741 SIAM Journal on Computing, 17, 4, 732-741 1988 Refereed English Disclose to all
D. Avis; R. Wenger D. Avis; R. Wenger D. Avis; R. Wenger Polyhedral line transversals in space Polyhedral line transversals in space Polyhedral line transversals in space Discrete & Computational Geometry, 3, 1, 257-265 Discrete & Computational Geometry, 3, 1, 257-265 Discrete & Computational Geometry, 3, 1, 257-265 1988 Refereed English Disclose to all
D. Avis; P. Erdös; J. Pach D. Avis; P. Erdös; J. Pach D. Avis; P. Erdös; J. Pach Repeated distances in space Repeated distances in space Repeated distances in space Graphs and Combinatorics, 4, 1, 207-217 Graphs and Combinatorics, 4, 1, 207-217 Graphs and Combinatorics, 4, 1, 207-217 1988 Refereed English Disclose to all
D. Avis; B.K. Bhattacharya; H. Imai D. Avis; B.K. Bhattacharya; H. Imai D. Avis; B.K. Bhattacharya; H. Imai Computing the volume of the union of spheres Computing the volume of the union of spheres Computing the volume of the union of spheres The Visual Computer, 3, 6, 323-328 The Visual Computer, 3, 6, 323-328 The Visual Computer, 3, 6, 323-328 1988 Refereed English Disclose to all
D. Avis; H. ElGindy D. Avis; H. ElGindy D. Avis; H. ElGindy Triangulating point sets in space Triangulating point sets in space Triangulating point sets in space Discrete & Computational Geometry, 2, 1, 99-111 Discrete & Computational Geometry, 2, 1, 99-111 Discrete & Computational Geometry, 2, 1, 99-111 1987 Refereed English Disclose to all
D. Avis; T. Gum; G. Toussaint D. Avis; T. Gum; G. Toussaint D. Avis; T. Gum; G. Toussaint Visibility between two edges of a simple polygon Visibility between two edges of a simple polygon Visibility between two edges of a simple polygon The Visual Computer, 2, 6, 342-357 The Visual Computer, 2, 6, 342-357 The Visual Computer, 2, 6, 342-357 1986 Refereed English Disclose to all
D. Avis D. Avis D. Avis Diameter partitioning Diameter partitioning Diameter partitioning Discrete & Computational Geometry, 1, 1, 265-276 Discrete & Computational Geometry, 1, 1, 265-276 Discrete & Computational Geometry, 1, 1, 265-276 1986 Refereed English Disclose to all
D. Avis; L. Devroye D. Avis; L. Devroye D. Avis; L. Devroye An analysis of a decomposition heuristic for the assignment problem An analysis of a decomposition heuristic for the assignment problem An analysis of a decomposition heuristic for the assignment problem Operations Research Letters, 3, 6, 279-283 Operations Research Letters, 3, 6, 279-283 Operations Research Letters, 3, 6, 279-283 1985 Refereed English Disclose to all
J. Akiyama; K. Ando; D. Avis J. Akiyama; K. Ando; D. Avis J. Akiyama; K. Ando; D. Avis Eccentric graphs Eccentric graphs Eccentric graphs Discrete Mathematics, 56, 1, 1-6 Discrete Mathematics, 56, 1, 1-6 Discrete Mathematics, 56, 1, 1-6 1985 Refereed English Disclose to all
David Avis David Avis David Avis SPACE PARTITIONING AND ITS APPLICATION TO GENERALIZED RETRIEVAL PROBLEMS. SPACE PARTITIONING AND ITS APPLICATION TO GENERALIZED RETRIEVAL PROBLEMS. SPACE PARTITIONING AND ITS APPLICATION TO GENERALIZED RETRIEVAL PROBLEMS. , 154-162 , 154-162 , 154-162 1985 Refereed English Disclose to all
Arun K. Somani; Vinod K. Agarwal; David Avis Arun K. Somani; Vinod K. Agarwal; David Avis Arun K. Somani; Vinod K. Agarwal; David Avis GENERALIZED THEORY FOR SYSTEM LEVEL DIAGNOSIS. GENERALIZED THEORY FOR SYSTEM LEVEL DIAGNOSIS. GENERALIZED THEORY FOR SYSTEM LEVEL DIAGNOSIS. , 707-711 , 707-711 , 707-711 1985 Refereed English Disclose to all
D. Avis D. Avis D. Avis Non-partitionable point sets Non-partitionable point sets Non-partitionable point sets Information Processing Letters, 19, 3, 125-129 Information Processing Letters, 19, 3, 125-129 Information Processing Letters, 19, 3, 125-129 1984 Refereed English Disclose to all
J. Akiyama; K. Ando; D. Avis J. Akiyama; K. Ando; D. Avis J. Akiyama; K. Ando; D. Avis Miscellaneous Properties Of Equi-Eccentric Graphs Miscellaneous Properties Of Equi-Eccentric Graphs Miscellaneous Properties Of Equi-Eccentric Graphs North-Holland Mathematics Studies, 87, C, 13-23 North-Holland Mathematics Studies, 87, C, 13-23 North-Holland Mathematics Studies, 87, C, 13-23 1984 Refereed English Disclose to all
H. ElGindy; D. Avis; G. Toussaint H. ElGindy; D. Avis; G. Toussaint H. ElGindy; D. Avis; G. Toussaint Applications of a two-dimensional hidden-line algorithm to other geometric problems Applications of a two-dimensional hidden-line algorithm to other geometric problems Applications of a two-dimensional hidden-line algorithm to other geometric problems Computing, 31, 3, 191-202 Computing, 31, 3, 191-202 Computing, 31, 3, 191-202 1983 Refereed English Disclose to all
David Avis; Hossam Elgindy David Avis; Hossam Elgindy David Avis; Hossam Elgindy COMBINATORIAL APPROACH TO POLYGON SIMILARITY. COMBINATORIAL APPROACH TO POLYGON SIMILARITY. COMBINATORIAL APPROACH TO POLYGON SIMILARITY. IEEE Transactions on Information Theory, IT-29, 1, 148-150 IEEE Transactions on Information Theory, IT-29, 1, 148-150 IEEE Transactions on Information Theory, IT-29, 1, 148-150 1983 Refereed English Disclose to all
G.T. Toussaint; D. Avis G.T. Toussaint; D. Avis G.T. Toussaint; D. Avis On a convex hull algorithm for polygons and its application to triangulation problems On a convex hull algorithm for polygons and its application to triangulation problems On a convex hull algorithm for polygons and its application to triangulation problems Pattern Recognition, 15, 1, 23-29 Pattern Recognition, 15, 1, 23-29 Pattern Recognition, 15, 1, 23-29 1982 Refereed English Disclose to all
D. Avis D. Avis D. Avis On the complexity of finding the convex hull of a set of points On the complexity of finding the convex hull of a set of points On the complexity of finding the convex hull of a set of points Discrete Applied Mathematics, 4, 2, 81-86 Discrete Applied Mathematics, 4, 2, 81-86 Discrete Applied Mathematics, 4, 2, 81-86 1982 Refereed English Disclose to all
D. Avis; G.T. Toussaint; B.K. Bhattacharya D. Avis; G.T. Toussaint; B.K. Bhattacharya D. Avis; G.T. Toussaint; B.K. Bhattacharya On the multimodality of distances in convex polygons On the multimodality of distances in convex polygons On the multimodality of distances in convex polygons Computers and Mathematics with Applications, 8, 2, 153-156 Computers and Mathematics with Applications, 8, 2, 153-156 Computers and Mathematics with Applications, 8, 2, 153-156 1982 Refereed English Disclose to all
H. El Gindy; D. Avis H. El Gindy; D. Avis H. El Gindy; D. Avis A linear algorithm for computing the visibility polygon from a point A linear algorithm for computing the visibility polygon from a point A linear algorithm for computing the visibility polygon from a point Journal of Algorithms, 2, 2, 186-197 Journal of Algorithms, 2, 2, 186-197 Journal of Algorithms, 2, 2, 186-197 1981 Refereed English Disclose to all
J. Akiyama; D. Avis; V. Chvátal; H. Era J. Akiyama; D. Avis; V. Chvátal; H. Era J. Akiyama; D. Avis; V. Chvátal; H. Era Balancing signed graphs Balancing signed graphs Balancing signed graphs Discrete Applied Mathematics, 3, 4, 227-233 Discrete Applied Mathematics, 3, 4, 227-233 Discrete Applied Mathematics, 3, 4, 227-233 1981 Refereed English Disclose to all
D. Avis; G.T. Toussaint D. Avis; G.T. Toussaint D. Avis; G.T. Toussaint An efficient algorithm for decomposing a polygon into star-shaped polygons An efficient algorithm for decomposing a polygon into star-shaped polygons An efficient algorithm for decomposing a polygon into star-shaped polygons Pattern Recognition, 13, 6, 395-398 Pattern Recognition, 13, 6, 395-398 Pattern Recognition, 13, 6, 395-398 1981 Refereed English Disclose to all
D. Avis D. Avis D. Avis Worst case bounds for the Euclidean matching problem Worst case bounds for the Euclidean matching problem Worst case bounds for the Euclidean matching problem Computers and Mathematics with Applications, 7, 3, 251-257 Computers and Mathematics with Applications, 7, 3, 251-257 Computers and Mathematics with Applications, 7, 3, 251-257 1981 Refereed English Disclose to all
David Avis David Avis David Avis SURVEY OF HEURISTICS FOR THE WEIGHTED MATCHING PROBLEM. SURVEY OF HEURISTICS FOR THE WEIGHTED MATCHING PROBLEM. SURVEY OF HEURISTICS FOR THE WEIGHTED MATCHING PROBLEM. Networks, 13, 4, 475-493 Networks, 13, 4, 475-493 Networks, 13, 4, 475-493 1981 Refereed English Disclose to all
David Avis; Godfried T. Toussaint David Avis; Godfried T. Toussaint David Avis; Godfried T. Toussaint OPTIMAL ALGORITHM FOR DETERMINING THE VISIBILITY OF A POLYGON FROM AN EDGE. OPTIMAL ALGORITHM FOR DETERMINING THE VISIBILITY OF A POLYGON FROM AN EDGE. OPTIMAL ALGORITHM FOR DETERMINING THE VISIBILITY OF A POLYGON FROM AN EDGE. IEEE Transactions on Computers, C-30, 12, 910-914 IEEE Transactions on Computers, C-30, 12, 910-914 IEEE Transactions on Computers, C-30, 12, 910-914 1981 Refereed English Disclose to all
D. Avis D. Avis D. Avis A note on some computationally difficult set covering problems A note on some computationally difficult set covering problems A note on some computationally difficult set covering problems Mathematical Programming, 18, 1, 138-145 Mathematical Programming, 18, 1, 138-145 Mathematical Programming, 18, 1, 138-145 1980 Refereed English Disclose to all
D. Avis D. Avis D. Avis Extremal Metrics Induced by Graphs Extremal Metrics Induced by Graphs Extremal Metrics Induced by Graphs Annals of Discrete Mathematics, 8, C, 217-220 Annals of Discrete Mathematics, 8, C, 217-220 Annals of Discrete Mathematics, 8, C, 217-220 1980 Refereed English Disclose to all
D. McCallum; D. Avis D. McCallum; D. Avis D. McCallum; D. Avis A linear algorithm for finding the convex hull of a simple polygon A linear algorithm for finding the convex hull of a simple polygon A linear algorithm for finding the convex hull of a simple polygon Information Processing Letters, 9, 5, 201-206 Information Processing Letters, 9, 5, 201-206 Information Processing Letters, 9, 5, 201-206 1979 Refereed English Disclose to all

  • <<
  • >>
Title language:
Misc
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Bibliography Bibliography(Japanese) Bibliography(English) Publication date Refereed paper Language Publishing type Disclose
D. Avis; C. Kollmitzer; V. Ovchinnikov; B. Parke; V. Privman; P. Dini D. Avis; C. Kollmitzer; V. Ovchinnikov; B. Parke; V. Privman; P. Dini D. Avis; C. Kollmitzer; V. Ovchinnikov; B. Parke; V. Privman; P. Dini Preface: ICQNM 2010 Preface: ICQNM 2010 Preface: ICQNM 2010 4th International Conference on Quantum, Nano and Micro Technologies, ICQNM 2010, viii 4th International Conference on Quantum, Nano and Micro Technologies, ICQNM 2010, viii 4th International Conference on Quantum, Nano and Micro Technologies, ICQNM 2010, viii 2010 Refereed English Disclose to all
D. Avis D. Avis D. Avis Those ubiquitous cut polyhedra Those ubiquitous cut polyhedra Those ubiquitous cut polyhedra Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010, 25- Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010, 25- Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, CCCG 2010, 25- 2010 Refereed English Disclose to all
D. Avis; A. Broadbent D. Avis; A. Broadbent D. Avis; A. Broadbent The quantum locker puzzle The quantum locker puzzle The quantum locker puzzle Proceedings of the 3rd International Conference on Quantum, Nano and Micro Technologies, ICQNM 2009, 63-66 Proceedings of the 3rd International Conference on Quantum, Nano and Micro Technologies, ICQNM 2009, 63-66 Proceedings of the 3rd International Conference on Quantum, Nano and Micro Technologies, ICQNM 2009, 63-66 2009 Refereed English Disclose to all
D. Avis; P. Dini; T. Tanamoto; S. Dan Cotofana; C. Kollmitzer; V. Privman D. Avis; P. Dini; T. Tanamoto; S. Dan Cotofana; C. Kollmitzer; V. Privman D. Avis; P. Dini; T. Tanamoto; S. Dan Cotofana; C. Kollmitzer; V. Privman Proceedings of the 3rd International Conference on Quantum, Nano and Micro Technologies, ICQNM 2009: Preface Proceedings of the 3rd International Conference on Quantum, Nano and Micro Technologies, ICQNM 2009: Preface Proceedings of the 3rd International Conference on Quantum, Nano and Micro Technologies, ICQNM 2009: Preface Proceedings of the 3rd International Conference on Quantum, Nano and Micro Technologies, ICQNM 2009, viii Proceedings of the 3rd International Conference on Quantum, Nano and Micro Technologies, ICQNM 2009, viii Proceedings of the 3rd International Conference on Quantum, Nano and Micro Technologies, ICQNM 2009, viii 2009 Refereed English Disclose to all
D. Avis; P. Fischer; A. Hilberf; A. Khrennikov D. Avis; P. Fischer; A. Hilberf; A. Khrennikov D. Avis; P. Fischer; A. Hilberf; A. Khrennikov Single, complete, probability spaces consistent with EPR-Bohm-Bell experimental data Single, complete, probability spaces consistent with EPR-Bohm-Bell experimental data Single, complete, probability spaces consistent with EPR-Bohm-Bell experimental data AIP Conference Proceedings, 1101, 294-301 AIP Conference Proceedings, 1101, 294-301 AIP Conference Proceedings, 1101, 294-301 2009 Refereed English Disclose to all
D. Avis; P. Hayden; I. Savov D. Avis; P. Hayden; I. Savov D. Avis; P. Hayden; I. Savov Multiparty distributed compression of quantum information Multiparty distributed compression of quantum information Multiparty distributed compression of quantum information Proceedings - The 2nd International Conference on Quantum-, Nano- and Micro-technologies, ICQNM 2008, 90-97 Proceedings - The 2nd International Conference on Quantum-, Nano- and Micro-technologies, ICQNM 2008, 90-97 Proceedings - The 2nd International Conference on Quantum-, Nano- and Micro-technologies, ICQNM 2008, 90-97 2008 Refereed English Disclose to all
D. Avis; A. Sergienko; N. Chaillet; T. Fukuda; C. Mavroidis; M. Hayashi; C. Kollmitzer; V. Ovchinnikov D. Avis; A. Sergienko; N. Chaillet; T. Fukuda; C. Mavroidis; M. Hayashi; C. Kollmitzer; V. Ovchinnikov D. Avis; A. Sergienko; N. Chaillet; T. Fukuda; C. Mavroidis; M. Hayashi; C. Kollmitzer; V. Ovchinnikov Proceedings - The 2nd International Conference on Quantum-, Nano- and Micro-Technologies ICQNM: Preface Proceedings - The 2nd International Conference on Quantum-, Nano- and Micro-Technologies ICQNM: Preface Proceedings - The 2nd International Conference on Quantum-, Nano- and Micro-Technologies ICQNM: Preface Proceedings - The 2nd International Conference on Quantum-, Nano- and Micro-technologies, ICQNM 2008, vii Proceedings - The 2nd International Conference on Quantum-, Nano- and Micro-technologies, ICQNM 2008, vii Proceedings - The 2nd International Conference on Quantum-, Nano- and Micro-technologies, ICQNM 2008, vii 2008 Refereed English Disclose to all
D. Avis; T. Ito D. Avis; T. Ito D. Avis; T. Ito Comparison of two bounds of the quantum correlation set Comparison of two bounds of the quantum correlation set Comparison of two bounds of the quantum correlation set First International Conference on Quantum, Nano, and Micro Technologies, ICQNM 2007 First International Conference on Quantum, Nano, and Micro Technologies, ICQNM 2007 First International Conference on Quantum, Nano, and Micro Technologies, ICQNM 2007 2007 Refereed English Disclose to all
David Avis; Prosenjit Bose; Thomas C. Shermer; Jack Snoeyink; Godfried Toussaint; Binhai Zhu David Avis; Prosenjit Bose; Thomas C. Shermer; Jack Snoeyink; Godfried Toussaint; Binhai Zhu David Avis; Prosenjit Bose; Thomas C. Shermer; Jack Snoeyink; Godfried Toussaint; Binhai Zhu On the sectional area of convex polytopes On the sectional area of convex polytopes On the sectional area of convex polytopes Proceedings of the Annual Symposium on Computational Geometry, C-11-C-12 Proceedings of the Annual Symposium on Computational Geometry, C-11-C-12 Proceedings of the Annual Symposium on Computational Geometry, C-11-C-12 1996 Refereed English Disclose to all
A. Somani; D. Avis; V. Agarwal A. Somani; D. Avis; V. Agarwal A. Somani; D. Avis; V. Agarwal ON COMPLEXITY OF DIAGNOSABILITY AND DIAGNOSIS PROBLEMS IN SYSTEM-LEVEL DIAGNOSIS. ON COMPLEXITY OF DIAGNOSABILITY AND DIAGNOSIS PROBLEMS IN SYSTEM-LEVEL DIAGNOSIS. ON COMPLEXITY OF DIAGNOSABILITY AND DIAGNOSIS PROBLEMS IN SYSTEM-LEVEL DIAGNOSIS. Digest of Papers - FTCS (Fault-Tolerant Computing Symposium), 232-237 Digest of Papers - FTCS (Fault-Tolerant Computing Symposium), 232-237 Digest of Papers - FTCS (Fault-Tolerant Computing Symposium), 232-237 1986 Refereed English Disclose to all
Arun K. Somani; Vinod K. Agrawal; David Avis Arun K. Somani; Vinod K. Agrawal; David Avis Arun K. Somani; Vinod K. Agrawal; David Avis SINGLE FAULT DIAGNOSABILITY CONCEPT: SYSTEM-LEVEL DIAGNOSIS AS APPLIED TO LARGE SCALE MULTIPROCESSOR SYSTEMS. SINGLE FAULT DIAGNOSABILITY CONCEPT: SYSTEM-LEVEL DIAGNOSIS AS APPLIED TO LARGE SCALE MULTIPROCESSOR SYSTEMS. SINGLE FAULT DIAGNOSABILITY CONCEPT: SYSTEM-LEVEL DIAGNOSIS AS APPLIED TO LARGE SCALE MULTIPROCESSOR SYSTEMS. Proceedings - IEEE International Symposium on Circuits and Systems, 634-638 Proceedings - IEEE International Symposium on Circuits and Systems, 634-638 Proceedings - IEEE International Symposium on Circuits and Systems, 634-638 1986 Refereed English Disclose to all
David Avis David Avis David Avis LOWER BOUNDS FOR GEOMETRIC PROBLEMS. LOWER BOUNDS FOR GEOMETRIC PROBLEMS. LOWER BOUNDS FOR GEOMETRIC PROBLEMS. Proceedings - Annual Allerton Conference on Communication, Control, and Computing, 35-40 Proceedings - Annual Allerton Conference on Communication, Control, and Computing, 35-40 Proceedings - Annual Allerton Conference on Communication, Control, and Computing, 35-40 Refereed English Disclose to all

  • <<
  • >>
Title language:
Books etc
Author Author(Japanese) Author(English) Title Title(Japanese) Title(English) Publisher Publisher(Japanese) Publisher(English) Publication date Language Type Disclose
D.Avis, D. Bremner and A.Deza(editors) D.Avis, D. Bremner and A.Deza(editors) D.Avis, D. Bremner and A.Deza(editors) Polyhedral Computation Polyhedral Computation Polyhedral Computation CRM-AMS Proceedings(2009), 150pp. CRM-AMS Proceedings(2009), 150pp. CRM-AMS Proceedings(2009), 150pp. 2009 English Disclose to all
D.Avis, A.Hertz and O.Marcotte(editors) D.Avis, A.Hertz and O.Marcotte(editors) D.Avis, A.Hertz and O.Marcotte(editors) Graph Theory and Combinatorial Optimization Graph Theory and Combinatorial Optimization Graph Theory and Combinatorial Optimization Springer (2005) 264pp Springer (2005) 264pp Springer (2005) 264pp 2005 English Disclose to all
D.Avis, H.Imai and S.Matsunaga D.Avis, H.Imai and S.Matsunaga D.Avis, H.Imai and S.Matsunaga 計算機科学・離散幾何学 Computational and Dixcrete Geometry 計算機科学・離散幾何学 Computational and Dixcrete Geometry 計算機科学・離散幾何学 Computational and Dixcrete Geometry Asukura (1994) 150pp Asukura (1994) 150pp Asukura (1994) 150pp 1994 English Disclose to all
Title language:
External funds: competitive funds and Grants-in-Aid for Scientific Research (Kakenhi)
Type Position Title(Japanese) Title(English) Period
研究活動スタート支援 Representative 幾何計算のためのソフトウェア開発:理論的基礎、実装とその応用 Polyhedral Computation, Discrete Optimization and Quantum Information 2010-2011
研究活動スタート支援 幾何計算のためのソフトウェア開発:理論的基礎、実装とその応用 2011-2011
基盤研究(B) Representative 幾何計算アプローチによる計算困難な最適化問題の求解:理論的基盤と実装       2012-2015
新学術領域研究(研究領域提案型) Representative 大規模数理計画による計算限界解析法の展開 2012-2016
新学術領域研究(研究領域提案型) Representative 大規模数理計画による計算限界解析法の展開 (平成26年度分) 2014/04/01-2015/03/31
基盤研究(B) Representative 幾何計算アプローチによる計算困難な最適化問題の求解:理論的基盤と実装 (平成26年度分) 2014/04/01-2015/03/31
Teaching subject(s)
Name(Japanese) Name(English) Term Department Period
アルゴリズムと情報学入門 Introduction to Algorithms and Infomatics 前期 情報学研究科 2011/04-2012/03
計算困難性:NP完全性、整数計画法、及びスケジューリング問題への応用 Computational Intractability:NP-completeness and Integer Programming,with Scheduling Applications 前期 情報学研究科 2011/04-2012/03
多面体計算学;理論、実際と理学工学への応用 Polyhedral Computation:Theory,Practice and Applications in Engineering and Science 後期 情報学研究科 2011/04-2012/03
アルゴリズムと情報学入門 Introduction to Algorithms and informatics 前期 全学共通科目 2011/04-2012/03
情報学展望4B Perspective in Informatics 4B 後期 情報学研究科 2011/04-2012/03
Computational Intractability Computational Intractability 前期 情報学研究科 2012/04-2013/03
Introduction to Algorithms and Informati Introduction to Algorithms and Informatics 前期 情報学研究科 2012/04-2013/03
Perspective in Informatics 4B Perspective in Informatics 4B 後期 情報学研究科 2012/04-2013/03
Polyhedral Computation Polyhedral Computation 後期 情報学研究科 2012/04-2013/03
アルゴリズムと情報学入門 Introduction to algorithms and informatics 前期 全学共通科目 2012/04-2013/03
情報学展望4 Perspective in Informatics 4 前期 情報学研究科 2012/04-2013/03
情報学展望5 Perspective in Informatics 5 後期 情報学研究科 2012/04-2013/03
通信情報システム特別研究1 Advanced Study in Communications and Computer Engineering I 通年 情報学研究科 2013/04-2014/03
Introduction to Algorithms and Informati Introduction to Algorithms and Informatics 前期 情報学研究科 2013/04-2014/03
Computational Intractability Computational Intractability 前期 情報学研究科 2013/04-2014/03
Polyhedral Computation Polyhedral Computation 後期 情報学研究科 2013/04-2014/03
情報学展望4 Perspective in Informatics 4 前期 情報学研究科 2013/04-2014/03
情報学展望5 Perspective in Informatics 5 後期 情報学研究科 2013/04-2014/03
情報基礎(英語講義) Fundamentals of Informatics (English) 前期 全学共通科目 2013/04-2014/03
通信情報システム特別研究1 Advanced Study in Communications and Computer Engineering I 通年 情報学研究科 2014/04-2015/03
通信情報システム特別研究2 Advanced Study in Communications and Computer Engineering II 通年 情報学研究科 2014/04-2015/03
Introduction to Algorithms and Informati Introduction to Algorithms and Informatics 前期 情報学研究科 2014/04-2015/03
Computational Intractability Computational Intractability 前期 情報学研究科 2014/04-2015/03
通信情報システム特別セミナー Seminar on Communications and Computer Engineering, Advanced 通年 情報学研究科 2014/04-2015/03
コンピュータ工学特別セミナー Seminar on Computer Engineering, Advanced 通年 情報学研究科 2014/04-2015/03
情報学展望4 Perspective in Informatics 4 前期 情報学研究科 2014/04-2015/03
情報学展望5 Perspective in Informatics 5 後期 情報学研究科 2014/04-2015/03
Fundamentals of Informatics Fundamentals of Informatics 前期 全学共通科目 2014/04-2015/03
Fundamentals of Informatics Fundamentals of Informatics 後期 全学共通科目 2014/04-2015/03
Fundamentals of Discrete Optimization Fundamentals of Discrete Optimization 前期 全学共通科目 2014/04-2015/03
Advanced Study in CCE I Advanced Study in Communications and Computer Engineering I 通年 情報学研究科 2014/04-2015/03
Advanced Study in CCE II Advanced Study in Communications and Computer Engineering II 通年 情報学研究科 2014/04-2015/03
Advanced Study in CCE I Advanced Study in Communications and Computer Engineering I 通年 情報学研究科 2015/04-2016/03
Advanced Study in CCE II Advanced Study in Communications and Computer Engineering II 通年 情報学研究科 2015/04-2016/03
Computational Intractability Computational Intractability 前期 情報学研究科 2015/04-2016/03
Fundamentals of Discrete Optimization Fundamentals of Discrete Optimization 前期 全学共通科目 2015/04-2016/03
Fundamentals of Informatics Fundamentals of Informatics 前期 全学共通科目 2015/04-2016/03
Fundamentals of Informatics Fundamentals of Informatics 後期 全学共通科目 2015/04-2016/03
Introduction to Algorithms and Informati Introduction to Algorithms and Informatics 前期 情報学研究科 2015/04-2016/03
コンピュータ工学特別セミナー Seminar on Computer Engineering, Advanced 通年 情報学研究科 2015/04-2016/03
情報学展望4 Perspective in Informatics 4 前期 情報学研究科 2015/04-2016/03
情報学展望5 Perspective in Informatics 5 後期 情報学研究科 2015/04-2016/03
アルゴリズム論 Introduction to Algorithms and Informatics 前期 工学研究科 2015/04-2016/03
通信情報システム特別セミナー Seminar on Communications and Computer Engineering, Advanced 通年 情報学研究科 2015/04-2016/03
通信情報システム特別研究2 Advanced Study in Communications and Computer Engineering II 通年 情報学研究科 2015/04-2016/03
通信情報システム特別研究1 Advanced Study in Communications and Computer Engineering I 通年 情報学研究科 2015/04-2016/03

  • <<
  • >>
Part-time lecturer (outside KU)
Cource name(Japanese) Cource name(English) Term University Department Period
C.O.R.E 1978-____/__/__
東京大学 1983-____/__/__
東京大学 1988-
東京大学 1995-____/__/__
京都大学 1984-
京都大学 1988-
京都大学 2000-
京都大学 2004-____/__/__
九州大学 1988-
T.I.T 1990-
E.P.F.L 1988-
IASI-CNR 1998-
慶応大学 1994-
ERATO 2000-
ERATO 2006-
東京大学 1990-
東京大学 1996-
東京大学 1997-
京都大学 2005-
京都大学 2006-
E.P.F.L 1999-

  • <<
  • >>
Faculty management (title, position)
Title Period
G30WG委員 2011/04/01-2012/03/31
G30WG委員 2012/04/01-2013/03/31
G31WG委員 2013/04/01-2014/03/31
Academic organizaions (other)
Organization name(Japanese) Organization name(English) Misc(Japanese) Misc(English) Period
Computational Geometry:Theory and Applications Associate Editor 1990/01/01-2014/12/31
Discrete Applied MAthematics(Computational Geometry) Associate Editor 1990/01/01-
Discrete and Computational Geometry( Computational Geometry) Associate Editor 1990/01/01-
Graphs and Combinatorics(Computatinal Geometry) Associate Editor 1990/01/01-
Number of times you have hosted foreign researchers (short-term)
Visitor name Organization Country Date
Komei Fukuda ETH Zurich Switzerland 2010/10/17-2010/11/13
Stefan Langerman ULB Bruxelles Belgium 2010/11/29-2010/12/14
Oliver Friedmann University of Munich Germany 2012/04/15-2012/04/29
Hans Tiwary ULB Bruxelles Belgium 2012/10/2-2012/12/1
David Rappaport Queens University Canada 2013/10/13-2013/11/17
David Bremner UNB Fredericton Canada 2014/04/18-2014/05/17
Hans Tiwary Charles University Czech Republic 2014/06/10-2014/07/12
David Bremner UNB Fredericton Canada 2015/04/02-2015/04/23
William Cook University of Waterloo Canada 2015/05/12-2015/05/27
Danny Solow Case Western Insititute USA 2015/05/31-2015/06/15
Hans Tiwary Charles University Czech Republic 2015/06/13-2015/06/26
Natasha Devroye University of Illinois Chicago 2015/10/05-2015/10/31

  • <<
  • >>