: Why the relational data model can be considered as a formal basis for group operations in object-oriented systems.
: Efficient Divide-and-Conquer Simulations Of Symmetric FSAs.
: An Application of Chromatic Prototypes for a Universal Information System.
: Relations between random coding exponents and the statistical physics of random codes.
: A Portal Analysis for the Design of a Collaborative Research Environment for Students and Supervisors (CRESS) within the CSCR Domain.
: Modeling Visual Information Processing in Brain: A Computer Vision Point of View and Approach.
: Nodally 3-connected planar graphs and convex combination mappings.
: Mathematical analysis of the recoil growth algorithm to generate multi-polymer systems.
: Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks.
Mark A. Iwen
: A Deterministic Sub-linear Time Sparse Fourier Algorithm via Non-adaptive Compressed Sensing Methods.
: A Light-Based Device for Solving the Hamiltonian Path Problem.
: Defensive forecasting for optimal prediction with expert advice.
: Solving the Hamiltonian path problem with a light-based computer.
: Designing a Collaborative Research Environment for Students and their Supervisors (CRESS).
: A nearly tight memory-redundancy trade-off for one-pass compression.
, Maike Buchin
: Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance.
: Collection analysis for Horn clause programs.
: Opportunism in Multiuser Relay Channels: Scheduling, Routing and Spectrum Reuse.
Walid S. Saba
: Compositional Semantics Grounded in Commonsense Metaphysics.
: Randomized algorithm for the k-server problem on decomposable spaces.
: Continuous and randomized defensive forecasting: unified view.
M. M. Chowdhury
: Key Agreement and Authentication Schemes Using Non-Commutative Semigroups.
, Eun Jung Kim
: On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments.
Eun Jung Kim
, Gregory Gutin
: Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops.
M. M. Chowdhury
: On the Security of the Cha-Ko-Lee-Han-Cheon Braid Group Public Key Cryptosystem.
: The universal evolutionary computer based on super-recursive algorithms of evolvability.
: The Fuzzy Vault for fingerprints is Vulnerable to Brute Force Attack.
: On predicate constraints with efficiently solvable task of fitting to training set.
: Can Alice and Bob be random: a study on human playing zero knowledge protocols.
, Philippe Wenger
: Architecture Optimization of a 3-DOF Translational Parallel Mechanism for Machining Applications, the Orthoglide.
, Il-Min Kim
: The Impact of Noise Correlation and Channel Phase Information on the Data-Rate of the Single-Symbol ML Decodable Distributed STBCs.
David S. Planeta
: Linear Time Algorithms Based on Multilevel Prefix Tree for Finding Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks.
: A Polynomial-time Algorithm for Computing the Permanent in GF(3^q).
: Ambient Multimodality: an Asset for Developing Universal Access to the Information Society.
: Inference from correlated patterns: a unified theory for perceptron learning and linear vector channels.
: Optimal Per-Edge Processing Times in the Semi-Streaming Model.
: 2006: Celebrating 75 years of AI - History and Outlook: the Next 25 Years.
, G. Pamula
: The Local Fractal Properties of the Financial Time Series on the Polish Stock Exchange Market.
: From symmetry break to Poisson point process in 2D Voronoi tessellations: the generic nature of hexagons.
: Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems.
, Marc Dohm
: Implicitization of Bihomogeneous Parametrizations of Algebraic Surfaces via Linear Syzygies.