Result 1 to 20 of 99 total
Computing growth functions of braid monoids and counting vertex-labelled bipartite graphs. (English)
J. Comb. Theory, Ser. A 120, No. 1, 232-244 (2013).
1
Reaction-diffusion automata. Phenomenology, localisations, computation. (English)
Emergence, Complexity and Computation 1. Berlin: Springer (ISBN 978-3-642-31077-5/hbk; 978-3-642-31078-2/ebook). xiv, 329~p. EUR~139.05; SFR~173.00; \sterling~117.00; \$~179.00/hbk (2013).
2
Generalizing the splits equivalence theorem and four gamete condition: Perfect phylogeny on three-state characters. (English)
SIAM J. Discrete Math. 25, No. 3, 1144-1175 (2011).
3
Further results on the perfect state transfer in integral circulant graphs. (English)
Comput. Math. Appl. 61, No. 2, 300-312 (2011).
4
Perfect state transfer, integral circulants, and join of graphs. (English)
Quantum Inf. Comput. 10, No. 3-4, 325-342 (2010).
5
On the chromatic number of integral circulant graphs. (English)
Comput. Math. Appl. 60, No. 1, 144-150 (2010).
6
Perfect state transfer in integral circulant graphs of non-square-free order. (English)
Linear Algebra Appl. 433, No. 1, 149-163 (2010).
7
Derivation of input-state-output port-Hamiltonian systems from bond graphs. (English)
Simul. Model. Pract. Theory 17, No. 1, 137-151 (2009).
8
Perfect state transfer in integral circulant graphs. (English)
Appl. Math. Lett. 22, No. 7, 1117-1121 (2009).
9
Cayley graphs as classifiers for data mining: the influence of asymmetries. (English)
Discrete Math. 309, No. 17, 5360-5369 (2009).
10
A graph-based operational semantics of OO programs. (English)
Breitman, Karin (ed.) et al., Formal methods and software engineering. 11th international conference on formal engineering methods, ICFEM 2009, Rio de Janeiro, Brazil, December 9‒12, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10372-8/pbk). Lecture Notes in Computer Science 5885, 347-366 (2009).
11
On the clique number of integral circulant graphs. (English)
Appl. Math. Lett. 22, No. 9, 1406-1411 (2009).
12
Some classes of integral circulant graphs either allowing or not allowing perfect state transfer. (English)
Appl. Math. Lett. 22, No. 10, 1609-1615 (2009).
13
A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles. (English)
Inf. Sci. 179, No. 17, 2934-2947 (2009).
14
Communication in $XYZ$ all-to-all quantum networks with a missing link. (English)
Int. J. Quantum Inf. 7, No. 4, 713-723 (2009).
15
Hardware technologies for high-performance data-intensive computing. (English)
Computer 41, No. 04, 60-68 (2008).
16
Bridging the semantic gap: Visualizing transition graphs with user-defined diagrams. (English)
IEEE Computer Graphics and Applications 27, No. 05, 58-66 (2007).
17
Finite automata on unranked and unordered dags. (English)
Harju, Tero (ed.) et al., Developments in language theory. 11th international conference, DLT 2007, Turku, Finland, July 3‒6, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73207-5/pbk). Lecture Notes in Computer Science 4588, 346-360 (2007).
18
Time and space-efficient architecture for a corpus-based text-to-speech synthesis system. (English)
Speech Commun. 49, No. 3, 230-249 (2007).
19
Improved decomposition of signal transition graphs. (English)
Fundam. Inform. 78, No. 1, 161-197 (2007).
20
Result 1 to 20 of 99 total
Start
Contact
Print
General Help
