スポンサーリンク
Department of Information Science Tokyo Institute of Technology | 論文
- There Exists No Minimal n-chart of Type (2,2,2)
- WEAK AND STRONG CONVERGENCE THEOREMS FOR NONEXPANSIVE MAPPINGS
- McMullen's conditions and some lower bounds for general convex polytopes
- On the skeleton of the dual cut polytope
- Wagner's theorem and combinatorial enumeration of 3-polytopes(Computational Geometry and Discrete Geometry)
- Wagner's theorem and combinatorial enumeration of 3-polytopes
- The ridge graph of the metric polytope and some relatives
- On Teaching the Art of Compromising in the Development of External Specifications
- AGGREGATE APPROXIMATION FOR TANDEM QUEUEING SYSTEMS WITH PRODUCTION BLOCKING
- TOWARDS OBJECT ORIENTED CONCURRENT PROGRAMMING(Software Science and Engineering)
- A Complete Type Inference System for Subtyped Recursive Types
- Comments on Monitors and Path-Expressions
- Concurrent Programming in Linear Logic
- Verification of Concurrent Programs Using the Coq Proof Assistant : A Case Study
- The Classical Incompressible Navier-Stokes Limit of the Boltzmann Equation(Mathematical Analysis of Phenomena in Fluid and Plasma Dynamics)
- GENERAL CONSTRUCTION OF LAMBDA CALCULUS MODELS(Lambda Calculus and Computer Science Theory)
- The existence of nonexpansive retractions in Banach spaces
- ON COMPARISON OF ACCURACY OF APPROXIMATIONS IN THE CROSS AGGREGATION METHOD
- On Rgeular Homotopies of a Closed Orientable Surface into a 3-manifold
- On Extensions of a Map of the Boundary of the 3-ball into a Homotopy 3-ball