journal of universal computer science سال:2007 - دوره:13

Fa | Ar | En


journal of universal computer science
سال:2007 - دوره:13 - شماره:11

Accepting Networks of Evolutionary Processors with Filtered Connections - صفحه:1598-1614 Analysis of two Sweep-line Algorithms for Constructing Spanning Trees and Steiner Trees - صفحه:1615-1627 Balance in Systems of Finite Sets with Applications - صفحه:1755-1766 Combinatorics and Related Areas A Collection of Papers in Honour of the 65th Birthday of Ioan Tomescu J.UCS Special Issue - صفحه:1498-1500 Connectivity and Reachability in Signed Networks - صفحه:1779-1790 Equivalent Transformations of Automata by Using Behavioural Automata - صفحه:1540-1549 Graded Sparse Graphs and Matroids - صفحه:1671-1679 Hamiltonicity of Topological Grid Graphs - صفحه:1791-1800 High-level Structured Interactive Programs with Registers and Voices - صفحه:1722-1754 Matrices and α-Stable Bipartite Graphs - صفحه:1692-1706 Metric-Entropy Pairs on Lattices - صفحه:1767-1778 On BCK Algebras - Part I.a: An Attempt to Treat Unitarily the Algebras of Logic. New Algebras - صفحه:1628-1654 On the Forcing Semantics for Monoidal τ-norm Based Logic - صفحه:1550-1572 Perfect Matchings in Polyhexes, or Recent Graph-theoretical Contributions to Benzenoids - صفحه:1514-1539 Rates of Asymptotic Regularity for Halpern Iterations of Nonexpansive Mappings - صفحه:1680-1691 Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps - صفحه:1655-1670 Spectral Densest Subgraph and Independence Number of a Graph - صفحه:1501-1513 Spiking Neural P Systems with Astrocyte-Like Control - صفحه:1707-1721 The Gray Code - صفحه:1573-1597