Conference Service Mandl

abstract: A special Memorial Session of Uri N. Peled will be held on May 23. Submissions related to Uri's work on threshold graphs, Boolean functions, and many other topics in graph theory and combinatorics would be especially welcome.

abstract: The 7th International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.

abstract: The ACA series of conferences is devoted to promoting all manner of computer algebra applications, and encouraging the interaction of developers of computer algebra systems and packages with researchers and users (including scientists, engineers, educators, etc.). Topics include, but are not limited to, computer algebra in the sciences, engineering, medicine, pure and applied mathematics, education and computer science.

abstract: These 'Jornadas' on Discrete Mathematics bring together, every two years, researchers related to both theoretical and applied discrete mathematics. Although their scope was originally Spanish, more and more European and international researchers are coming to recent editions.

abstract: The main objective of this workshop is to have timely reviews and discussions of recent results and current issues in (1) the mathematical foundations of integral-equation methods and associated fast algorithms, (2) implementations and performance assessments of such methods on a variety of computer architectures, and (3) existing and new application areas. A plethora of computational techniques already exists, and includes tree-codes, pre-corrected fast Fourier transforms, Ewald procedures, and the many classes of fast multipole methods. This workshop will help clarify the relative advantages of existing schemes, and elucidate the trajectories and applications of many methods now under development.

abstract: The ODSA 2010 conference, to be held at the University of Rostock, continues the ODSA series following previous conferences in 1997, 2000 and 2006. The conference aims at the interactions between several aspects of Discrete Mathematics, Mathematical Optimization, Theoretical Computer Science, and their applications. In particular, the scope of the conference includes combinatorial optimization and algorithms on discrete structures, extremal problems in posets, design theory, coding theory, and graph theory.

abstract: This congress is the third in the series, where the first meeting was held in Beijing in 2002 and the previous one in Castro Urdiales, Spain in 2006; see http://www.icms2006.unican.es/ . We will welcome developers of mathematical software systems as well as researchers in algorithms and mathematicians who are interested in the development of mathematical software and systems. This is an almost unique chance to meet people in different disciplines in mathematics and computer science and exchange ideas on developments on mathematical software and systems. While the main audience of this meeting is assumed to be developers of mathematical software and software systems, we welcome the participation of mathematicians and scientists who are interested in using mathematical software for their research. The proceedings of the congress is planned and all accepted papers and short communications will be published as Springer Lecture Notes in Computer Science (LNCS).

abstract: Multigrid methods (efficiency, robustness, adaptivity, parallelism), Multiscale methods, Domain decomposition, Related iterative schemes and discretization methods, Software, tools, and high performance computing, Applications in classical and emerging areas like Analysis of images, financial problems, inverse problems, models related to medicine and biosciences, multiscale and coupled systems, optimization and design.

abstract: Recently, computational science has been offered the prospect of vast increases in capability, thanks to a paradigm shift in hardware architectures. The IT industry has sidestepped the bottlenecks it faced (memory, power, complexity) by opting for on-chip parallelism. This brought first the multi-core model, and now promises many-core as the future. In addition, we have a great opportunity in the tremendous computing power of graphics processors (GPUs). With this opportunity, however, comes the challenge of adapting the large toolbox of scientific computing to the unstoppable changes in computer architectures. The latest studies indicate that some algorithms have more potential than others for extracting performance from modern many-core architectures. A difficult task involves reformulating algorithms to adapt to the hardware in a resource-conscious way. This workshop will discuss the algorithms and their formulations for extracting performance of the modern architectures.

abstract: SODA is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics.

abstract: It aims the promotion of evolutionary algorithms in Iran industry and scientific centers.