Borrow it
Coverart for item
The Resource Computing and combinatorics : 7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001 : proceedings, Jie Wang (ed.)

Computing and combinatorics : 7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001 : proceedings, Jie Wang (ed.)

Work
Publication
Extent
xiii, 602 pages
Contents
  • Complete Problems for Valiant's Class of qp-Computable Families of Polynomials / Markus Blaser
  • Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n[superscript 4.03]) / Michal Koucky
  • On Universally Polynomial Context-Free Languages / Nicholas Tran
  • Separating Oblivious and Non-oblivious BPs / Kazuo Iwama, Yasuo Okabe and Toshiro Takase
  • Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws / Iain A. Stewart
  • Algebraic Properties for P-Selectivity / Lane A. Hemaspaandra, Harald Hempel and Arfst Nickelsen
  • Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM / Carla Denise Castanho, Wei Chen and Koichi Wada / [et al.]
  • Enhanced Sequence Reconstruction with DNA Microarray Application / Samuel A. Heath and Franco P. Preparata
  • Non-approximability of Weighted Multiple Sequence Alignment / Bodo Siebert
  • A Greedy Algorithm for Optimal Recombination / Shiquan Wu and Xun Gu
  • Generating Well-Shaped d-dimensional Delaunay Meshes / Xiang-Yang Li
  • Towards Compatible Triangulations / Oswin Aichholzer, Franz Aurenhammer and Hannes Krasser / [et al.]
  • An Improved Upper Bound on the Size of Planar Convex-Hulls / Abudllah N. Arslan and Omer Egecioglu
  • On the Planar Two-Watchtower Problem / Sergei Bespamyatnikh, Zhixiang Chen and Kanliang Wang / [et al.]
  • Efficient Generation of Triconnected Plane Triangulations / Shin-ichi Nakano
  • Packing Two Disks into a Polygonal Environment / Prosenjit Bose, Pat Morin and Antoine Vigneron
  • Maximum Red/Blue Interval Matching with Applications / Danny Z. Chen / Xiaobo (Sharon) Hu / Xiaodong Wu
  • Computing Farthest Neighbors on a Convex Polytope / Otfried Cheong, Chan-Su Shin and Antoine Vigneron
  • Finding an Optimal Bridge between Two Polygons / Xuehou Tan
  • How Good Is Sink Insertion? / Xiang-Yang Li and Yu Wang
  • Polynomial Time Algorithms for Three-Label Point Labeling / Rob Duncan, Jianbo Qian and Binhai Zhu
  • Approximation Algorithms for the Watchman Route and Zookeeper's Problems / Xuehou Tan
  • PC-Trees vs. PQ-Trees / Wen-Lian Hsu
  • Stacks versus Deques / Holger Petersen
  • Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences / H. K. Dai
  • Competitive Facility Location along a Highway / Hee-Kap Ahn, Siu-Wing Cheng and Otfried Cheong / [et al.]
  • Membership for Core of LP Games and Other Games / Qizhi Fang, Shanfeng Zhu and Maocheng Cai / [et al.]
  • Strong Solutions to the Identification Problem / Pino Caballero-Gil and Candelaria Hernandez-Goya
  • Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2[superscript m]) / Hyun-Sung Kim and Kee-Young Yoo
  • A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms / Valerie King and Mikkel Thorup
  • Finding the Most Vital Node of a Shortest Path / Enrico Nardelli, Guido Proietti and Peter Widmayer
  • Algorithm for the Cost Edge-Coloring of Trees / Xiao Zhou and Takao Nishizeki
  • Counting H-Colorings of Partial [kappa]-Trees / Josep Diaz, Maria Serna and Dimitrios M. Thilikos
  • A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph / L. Sunil Chandran
  • Graph Separators: A Parameterized View / Jochen Alber, Henning Fernau and Rolf Niedermeier
  • On Assigning Prefix Free Codes to the Vertices of a Graph / N. S. Narayanaswamy and C. E. Veni Madhavan
  • A New Measure of Edit Distance Between Labeled Trees / Chin Lung Lu, Zheng-Yao Su and Chuan Yi Tang
  • A Highly Efficient Algorithm to Determine Bicritical Graphs / Dingjun Lou and Ning Zhong
  • Layered Drawings of Graphs with Crossing Constraints / Irene Finocchi
  • On the Validity of Hierarchical Decompositions / Irene Finocchi and Rossella Petreschi
  • Lower Bounds on the Minus Domination and [kappa]-Subdomination Numbers / Liying Kang, Hong Qiao and Erfang Shan / [et al.]
  • Edge Connectivity vs Vertex Connectivity in Chordal Graphs / L. Sunil Chandran
  • Changing the Diameter of Graph Products / Ting-Yi Sung and Jeng-Jung Wang
  • Plane Graphs with Acyclic Complex / Baogang Xu
  • On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs / Yosuke Kikuchi and Yukio Shibata
  • A Notion of Cross-Perfect Bipartite Graphs / Milind Dawande
  • Some Results on Orthogonal Factorizations / Haodi Feng
  • Cluttered Orderings for the Complete Graph / Myra B. Cohen, Charles J. Colbourn and Dalibor Froncek
  • Improved On-Line Stream Merging: From a Restricted to a General Setting / Wun-Tat Chan, Tak-Wah Lam and Hing-Fung Ting / [et al.]
  • On-Line Deadline Scheduling on Multiple Resources / Jae-Hoon Kim and Kyung-Yong Chwa
  • Competitive Online Scheduling with Level of Service / Ee-Chien Chang and Chee Yap
  • On-Line Variable Sized Covering / Leah Epstein
  • On Testing for Zero Polynomials by a Set of Points with Bounded Precision / Jin-Yi Cai and Eric Bach
  • A Randomized Algorithm for Gossiping in Radio Networks / Marek Chrobak, Leszek Gasieniec and Wojciech Rytter
  • Deterministic Application of Grover's Quantum Search Algorithm / Kyoichi Okamoto and Osamu Watanabe
  • Random Instance Generation for MAX 3SAT / Mitsuo Motoki
  • The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points / Dingzhu Du, Lusheng Wang and Baogang Xu
  • An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs / Guangting Chen and Guoliang Xue
  • Decidable Approximations on Generalized and Parameterized Discrete Timed Automata / Zhe Dang, Oscar H. Ibarra and Richard A. Kemmerer
  • Multiplicative Adaptive Algorithms for User Preference Retrieval / Zhixiang Chen
  • Parametric Scheduling for Network Constraints / K. Subramani
  • A Logical Framework for Knowledge Sharing in Multi-agent Systems / Kaile Su, Xudong Luo and Huaiaing Wang / [et al.]
  • A Lockout Avoidance Algorithm without Using Time-Stamps for the [kappa]-Exclusion Problem / Kumiko Obokata, Michiko Omori and Kazuhiro Motegi / [et al.]
  • Prefix-Free Languages and Initial Segments of Computably Enumerable Degrees / Guohua Wu
  • Weakly Computable Real Numbers and Total Computable Real Functions / Robert Rettinger, Xizhong Zheng and Romain Gengler / [et al.]
  • Turing Computability of a Nonlinear Schrodinger Propagator / Klaus Weihrauch and Ning Zhong
Isbn
9783540424949
Instance
Label
Computing and combinatorics : 7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001 : proceedings
Title
Computing and combinatorics
Title remainder
7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001 : proceedings
Statement of responsibility
Jie Wang (ed.)
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
DLC
Illustrations
illustrations
Index
index present
LC call number
QA75.5
LC item number
.C549 2001
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2001
http://bibfra.me/vocab/lite/meetingName
COCOON 2001
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorName
Wang, Jie
http://library.link/vocab/subjectName
  • Computer science
  • Combinatorial analysis
  • calculabilité
  • algorithme graphe
  • théorie jeu
  • structure donnée
  • combinatoire
  • géométrie algorithmique
  • biologie
  • théorie complexité
  • Informatique
  • Analyse combinatoire
  • Combinatorial analysis
  • Computer science
  • Combinatieleer
  • Computermethoden
  • Informatique
  • Analyse combinatoire
  • Theoretische Informatik
  • Kombinatorik
  • Berechenbarkeit
  • Kueilin <2001>
Label
Computing and combinatorics : 7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001 : proceedings, Jie Wang (ed.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Complete Problems for Valiant's Class of qp-Computable Families of Polynomials / Markus Blaser -- Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n[superscript 4.03]) / Michal Koucky -- On Universally Polynomial Context-Free Languages / Nicholas Tran -- Separating Oblivious and Non-oblivious BPs / Kazuo Iwama, Yasuo Okabe and Toshiro Takase -- Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws / Iain A. Stewart -- Algebraic Properties for P-Selectivity / Lane A. Hemaspaandra, Harald Hempel and Arfst Nickelsen -- Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM / Carla Denise Castanho, Wei Chen and Koichi Wada / [et al.] -- Enhanced Sequence Reconstruction with DNA Microarray Application / Samuel A. Heath and Franco P. Preparata -- Non-approximability of Weighted Multiple Sequence Alignment / Bodo Siebert -- A Greedy Algorithm for Optimal Recombination / Shiquan Wu and Xun Gu -- Generating Well-Shaped d-dimensional Delaunay Meshes / Xiang-Yang Li -- Towards Compatible Triangulations / Oswin Aichholzer, Franz Aurenhammer and Hannes Krasser / [et al.] -- An Improved Upper Bound on the Size of Planar Convex-Hulls / Abudllah N. Arslan and Omer Egecioglu -- On the Planar Two-Watchtower Problem / Sergei Bespamyatnikh, Zhixiang Chen and Kanliang Wang / [et al.] -- Efficient Generation of Triconnected Plane Triangulations / Shin-ichi Nakano -- Packing Two Disks into a Polygonal Environment / Prosenjit Bose, Pat Morin and Antoine Vigneron -- Maximum Red/Blue Interval Matching with Applications / Danny Z. Chen / Xiaobo (Sharon) Hu / Xiaodong Wu -- Computing Farthest Neighbors on a Convex Polytope / Otfried Cheong, Chan-Su Shin and Antoine Vigneron -- Finding an Optimal Bridge between Two Polygons / Xuehou Tan -- How Good Is Sink Insertion? / Xiang-Yang Li and Yu Wang -- Polynomial Time Algorithms for Three-Label Point Labeling / Rob Duncan, Jianbo Qian and Binhai Zhu -- Approximation Algorithms for the Watchman Route and Zookeeper's Problems / Xuehou Tan -- PC-Trees vs. PQ-Trees / Wen-Lian Hsu -- Stacks versus Deques / Holger Petersen -- Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences / H. K. Dai -- Competitive Facility Location along a Highway / Hee-Kap Ahn, Siu-Wing Cheng and Otfried Cheong / [et al.] -- Membership for Core of LP Games and Other Games / Qizhi Fang, Shanfeng Zhu and Maocheng Cai / [et al.] -- Strong Solutions to the Identification Problem / Pino Caballero-Gil and Candelaria Hernandez-Goya -- Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2[superscript m]) / Hyun-Sung Kim and Kee-Young Yoo -- A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms / Valerie King and Mikkel Thorup -- Finding the Most Vital Node of a Shortest Path / Enrico Nardelli, Guido Proietti and Peter Widmayer -- Algorithm for the Cost Edge-Coloring of Trees / Xiao Zhou and Takao Nishizeki -- Counting H-Colorings of Partial [kappa]-Trees / Josep Diaz, Maria Serna and Dimitrios M. Thilikos -- A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph / L. Sunil Chandran -- Graph Separators: A Parameterized View / Jochen Alber, Henning Fernau and Rolf Niedermeier -- On Assigning Prefix Free Codes to the Vertices of a Graph / N. S. Narayanaswamy and C. E. Veni Madhavan -- A New Measure of Edit Distance Between Labeled Trees / Chin Lung Lu, Zheng-Yao Su and Chuan Yi Tang -- A Highly Efficient Algorithm to Determine Bicritical Graphs / Dingjun Lou and Ning Zhong -- Layered Drawings of Graphs with Crossing Constraints / Irene Finocchi -- On the Validity of Hierarchical Decompositions / Irene Finocchi and Rossella Petreschi -- Lower Bounds on the Minus Domination and [kappa]-Subdomination Numbers / Liying Kang, Hong Qiao and Erfang Shan / [et al.] -- Edge Connectivity vs Vertex Connectivity in Chordal Graphs / L. Sunil Chandran -- Changing the Diameter of Graph Products / Ting-Yi Sung and Jeng-Jung Wang -- Plane Graphs with Acyclic Complex / Baogang Xu -- On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs / Yosuke Kikuchi and Yukio Shibata -- A Notion of Cross-Perfect Bipartite Graphs / Milind Dawande -- Some Results on Orthogonal Factorizations / Haodi Feng -- Cluttered Orderings for the Complete Graph / Myra B. Cohen, Charles J. Colbourn and Dalibor Froncek -- Improved On-Line Stream Merging: From a Restricted to a General Setting / Wun-Tat Chan, Tak-Wah Lam and Hing-Fung Ting / [et al.] -- On-Line Deadline Scheduling on Multiple Resources / Jae-Hoon Kim and Kyung-Yong Chwa -- Competitive Online Scheduling with Level of Service / Ee-Chien Chang and Chee Yap -- On-Line Variable Sized Covering / Leah Epstein -- On Testing for Zero Polynomials by a Set of Points with Bounded Precision / Jin-Yi Cai and Eric Bach -- A Randomized Algorithm for Gossiping in Radio Networks / Marek Chrobak, Leszek Gasieniec and Wojciech Rytter -- Deterministic Application of Grover's Quantum Search Algorithm / Kyoichi Okamoto and Osamu Watanabe -- Random Instance Generation for MAX 3SAT / Mitsuo Motoki -- The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points / Dingzhu Du, Lusheng Wang and Baogang Xu -- An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs / Guangting Chen and Guoliang Xue -- Decidable Approximations on Generalized and Parameterized Discrete Timed Automata / Zhe Dang, Oscar H. Ibarra and Richard A. Kemmerer -- Multiplicative Adaptive Algorithms for User Preference Retrieval / Zhixiang Chen -- Parametric Scheduling for Network Constraints / K. Subramani -- A Logical Framework for Knowledge Sharing in Multi-agent Systems / Kaile Su, Xudong Luo and Huaiaing Wang / [et al.] -- A Lockout Avoidance Algorithm without Using Time-Stamps for the [kappa]-Exclusion Problem / Kumiko Obokata, Michiko Omori and Kazuhiro Motegi / [et al.] -- Prefix-Free Languages and Initial Segments of Computably Enumerable Degrees / Guohua Wu -- Weakly Computable Real Numbers and Total Computable Real Functions / Robert Rettinger, Xizhong Zheng and Romain Gengler / [et al.] -- Turing Computability of a Nonlinear Schrodinger Propagator / Klaus Weihrauch and Ning Zhong
Dimensions
23 cm.
Dimensions
unknown
Extent
xiii, 602 pages
Isbn
9783540424949
Lccn
2001049309
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
Specific material designation
remote
System control number
  • (OCoLC)47705644
  • (OCoLC)ocm47705644
Label
Computing and combinatorics : 7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001 : proceedings, Jie Wang (ed.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Complete Problems for Valiant's Class of qp-Computable Families of Polynomials / Markus Blaser -- Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n[superscript 4.03]) / Michal Koucky -- On Universally Polynomial Context-Free Languages / Nicholas Tran -- Separating Oblivious and Non-oblivious BPs / Kazuo Iwama, Yasuo Okabe and Toshiro Takase -- Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws / Iain A. Stewart -- Algebraic Properties for P-Selectivity / Lane A. Hemaspaandra, Harald Hempel and Arfst Nickelsen -- Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM / Carla Denise Castanho, Wei Chen and Koichi Wada / [et al.] -- Enhanced Sequence Reconstruction with DNA Microarray Application / Samuel A. Heath and Franco P. Preparata -- Non-approximability of Weighted Multiple Sequence Alignment / Bodo Siebert -- A Greedy Algorithm for Optimal Recombination / Shiquan Wu and Xun Gu -- Generating Well-Shaped d-dimensional Delaunay Meshes / Xiang-Yang Li -- Towards Compatible Triangulations / Oswin Aichholzer, Franz Aurenhammer and Hannes Krasser / [et al.] -- An Improved Upper Bound on the Size of Planar Convex-Hulls / Abudllah N. Arslan and Omer Egecioglu -- On the Planar Two-Watchtower Problem / Sergei Bespamyatnikh, Zhixiang Chen and Kanliang Wang / [et al.] -- Efficient Generation of Triconnected Plane Triangulations / Shin-ichi Nakano -- Packing Two Disks into a Polygonal Environment / Prosenjit Bose, Pat Morin and Antoine Vigneron -- Maximum Red/Blue Interval Matching with Applications / Danny Z. Chen / Xiaobo (Sharon) Hu / Xiaodong Wu -- Computing Farthest Neighbors on a Convex Polytope / Otfried Cheong, Chan-Su Shin and Antoine Vigneron -- Finding an Optimal Bridge between Two Polygons / Xuehou Tan -- How Good Is Sink Insertion? / Xiang-Yang Li and Yu Wang -- Polynomial Time Algorithms for Three-Label Point Labeling / Rob Duncan, Jianbo Qian and Binhai Zhu -- Approximation Algorithms for the Watchman Route and Zookeeper's Problems / Xuehou Tan -- PC-Trees vs. PQ-Trees / Wen-Lian Hsu -- Stacks versus Deques / Holger Petersen -- Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences / H. K. Dai -- Competitive Facility Location along a Highway / Hee-Kap Ahn, Siu-Wing Cheng and Otfried Cheong / [et al.] -- Membership for Core of LP Games and Other Games / Qizhi Fang, Shanfeng Zhu and Maocheng Cai / [et al.] -- Strong Solutions to the Identification Problem / Pino Caballero-Gil and Candelaria Hernandez-Goya -- Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2[superscript m]) / Hyun-Sung Kim and Kee-Young Yoo -- A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms / Valerie King and Mikkel Thorup -- Finding the Most Vital Node of a Shortest Path / Enrico Nardelli, Guido Proietti and Peter Widmayer -- Algorithm for the Cost Edge-Coloring of Trees / Xiao Zhou and Takao Nishizeki -- Counting H-Colorings of Partial [kappa]-Trees / Josep Diaz, Maria Serna and Dimitrios M. Thilikos -- A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph / L. Sunil Chandran -- Graph Separators: A Parameterized View / Jochen Alber, Henning Fernau and Rolf Niedermeier -- On Assigning Prefix Free Codes to the Vertices of a Graph / N. S. Narayanaswamy and C. E. Veni Madhavan -- A New Measure of Edit Distance Between Labeled Trees / Chin Lung Lu, Zheng-Yao Su and Chuan Yi Tang -- A Highly Efficient Algorithm to Determine Bicritical Graphs / Dingjun Lou and Ning Zhong -- Layered Drawings of Graphs with Crossing Constraints / Irene Finocchi -- On the Validity of Hierarchical Decompositions / Irene Finocchi and Rossella Petreschi -- Lower Bounds on the Minus Domination and [kappa]-Subdomination Numbers / Liying Kang, Hong Qiao and Erfang Shan / [et al.] -- Edge Connectivity vs Vertex Connectivity in Chordal Graphs / L. Sunil Chandran -- Changing the Diameter of Graph Products / Ting-Yi Sung and Jeng-Jung Wang -- Plane Graphs with Acyclic Complex / Baogang Xu -- On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs / Yosuke Kikuchi and Yukio Shibata -- A Notion of Cross-Perfect Bipartite Graphs / Milind Dawande -- Some Results on Orthogonal Factorizations / Haodi Feng -- Cluttered Orderings for the Complete Graph / Myra B. Cohen, Charles J. Colbourn and Dalibor Froncek -- Improved On-Line Stream Merging: From a Restricted to a General Setting / Wun-Tat Chan, Tak-Wah Lam and Hing-Fung Ting / [et al.] -- On-Line Deadline Scheduling on Multiple Resources / Jae-Hoon Kim and Kyung-Yong Chwa -- Competitive Online Scheduling with Level of Service / Ee-Chien Chang and Chee Yap -- On-Line Variable Sized Covering / Leah Epstein -- On Testing for Zero Polynomials by a Set of Points with Bounded Precision / Jin-Yi Cai and Eric Bach -- A Randomized Algorithm for Gossiping in Radio Networks / Marek Chrobak, Leszek Gasieniec and Wojciech Rytter -- Deterministic Application of Grover's Quantum Search Algorithm / Kyoichi Okamoto and Osamu Watanabe -- Random Instance Generation for MAX 3SAT / Mitsuo Motoki -- The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points / Dingzhu Du, Lusheng Wang and Baogang Xu -- An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs / Guangting Chen and Guoliang Xue -- Decidable Approximations on Generalized and Parameterized Discrete Timed Automata / Zhe Dang, Oscar H. Ibarra and Richard A. Kemmerer -- Multiplicative Adaptive Algorithms for User Preference Retrieval / Zhixiang Chen -- Parametric Scheduling for Network Constraints / K. Subramani -- A Logical Framework for Knowledge Sharing in Multi-agent Systems / Kaile Su, Xudong Luo and Huaiaing Wang / [et al.] -- A Lockout Avoidance Algorithm without Using Time-Stamps for the [kappa]-Exclusion Problem / Kumiko Obokata, Michiko Omori and Kazuhiro Motegi / [et al.] -- Prefix-Free Languages and Initial Segments of Computably Enumerable Degrees / Guohua Wu -- Weakly Computable Real Numbers and Total Computable Real Functions / Robert Rettinger, Xizhong Zheng and Romain Gengler / [et al.] -- Turing Computability of a Nonlinear Schrodinger Propagator / Klaus Weihrauch and Ning Zhong
Dimensions
23 cm.
Dimensions
unknown
Extent
xiii, 602 pages
Isbn
9783540424949
Lccn
2001049309
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
Specific material designation
remote
System control number
  • (OCoLC)47705644
  • (OCoLC)ocm47705644

Subject

Genre

Member of

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784

Library Links

Zepheira Logo
Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by Boston University Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...