default search action
Mathematics in Computer Science, Volume 6
Volume 6, Number 1, March 2012
- Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler:
A Survey on Hypergraph Products. 1-32 - Akul Rana, Anita Pal, Madhumangal Pal:
The Conditional Covering Problem on Unweighted Interval Graphs with Nonuniform Coverage Radius. 33-41 - Samuel Lundqvist:
Multiplication Matrices and Ideals of Projective Dimension Zero. 43-59 - Peter Horn, Wolfram Koepf, Torsten Sprenger:
m-Fold Hypergeometric Solutions of Linear Recurrence Equations Revisited. 61-77 - John Michael Nahay:
The nth Order Implicit Differentiation Formula for Two Variables with an Application to Computing All Roots of a Transcendental Function. 79-105
Volume 6, Number 2, June 2012
- Ilias S. Kotsireas, Irene Marquez Corbella, Edgar Martínez-Moro:
Foreword. 107-108 - Relinde P. M. J. Jurrius:
Relations Between Möbius and Coboundary Polynomials. 109-120 - Relinde P. M. J. Jurrius, Ruud Pellikaan:
Truncation Formulas for Invariant Polynomials of Matroids and Geometric Lattices. 121-133 - Gary Gordon:
On Brylawski's Generalized Duality. 135-146 - Irene Marquez Corbella, Edgar Martínez-Moro:
Decomposition of Modular Codes for Computing Test Sets and Graver Basis. 147-165 - Urszula Romanczuk, Vasyl Ustimenko:
On Families of Graphs of Large Cycle Indicator, Matrices of Large Order and Key Exchange Protocols With Nonlinear Polynomial Maps of Small Degree. 167-180 - Michal Klisowski, Vasyl Ustimenko:
On the Comparison of Cryptographical Properties of Two Different Families of Graphs with Large Cycle Indicator. 181-198
Volume 6, Number 3, September 2012
- Matilde Marcolli, Christopher Perez:
Codes as Fractals and Noncommutative Spaces. 199-215 - Sébastien Orange, Guénaël Renault, Kazuhiro Yokoyama:
Efficient Arithmetic in Successive Algebraic Extension Fields Using Symmetries. 217-233 - Michael Kohlhase, Florian Rabe:
Semantics of OpenMath and MathML3. 235-260 - Franz Aurenhammer, Bert Jüttler:
On Computing the Convex Hull of (Piecewise) Curved Objects. 261-266 - Hongbo Li, Rida T. Farouki, Dingkang Wang:
Foreword to the Special Focus on Mathematics and Algorithms for CAM and CNC. 267-268 - Alessandro Gasparetto, Paolo Boscariol, Albano Lanzutti, Renato Vidoni:
Trajectory Planning in Robotics. 269-279 - Hongbo Li, Shoubin Yao, Ge Li, Yuanjie Liu, Lixian Zhang:
Power Series Solution for Isoscallop Tool Path Generation on Free-form Surface with Ball-end Cutter. 281-296 - Stephen P. Radzevich:
The DG/K-Based Approach for Synthesizing of CAM System for Sculptured Surface Machining on Multi-Axis NC Machine. 297-313 - Yongqing Wang, Haibo Liu, Sennan Yu:
Curvature-Based Real-Time NURBS Surface Interpolator with Look-Ahead ACC/DEC Control. 315-326 - Hongbo Li, Xiao-Shan Gao, Lixian Zhang, Ruiyong Sun:
Discrete Interpolation of G01 Codes in 2D Machining under Bounded Accelerations. 327-344
Volume 6, Number 4, December 2012
- Stefan Ratschan, Thomas Sturm:
Foreword. 345 - Luc Jaulin:
Combining Interval Analysis with Flatness Theory for State Estimation of Sailboat Robots. 347-359 - Yanli Huang, Lam Xuan Châu Ngô, Franz Winkler:
Rational General Solutions of Trivariate Rational Differential Systems. 361-374 - Vladimir Anashin:
The Non-Archimedean Theory of Discrete Systems. 375-393 - Jiang Liu, Naijun Zhan, Hengjun Zhao:
Automatically Discovering Relaxed Lyapunov Functions for Polynomial Dynamical Systems. 395-408 - Arnaud Fietzke, Christoph Weidenbach:
Superposition as a Decision Procedure for Timed Automata. 409-425 - Evgeny Kruglov, Christoph Weidenbach:
Superposition Decides the First-Order Logic Fragment Over Ground Theories. 427-456 - Marc Moreno Maza, Bican Xia, Rong Xiao:
On Solving Parametric Polynomial Systems. 457-473 - Luís Soares Barbosa, Meng Sun:
A Calculus for Generic, QoS-Aware Component Composition. 475-497
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.