Publications
Filters: First Letter Of Last Name is A [Clear All Filters]
[AtHiLuMa06] .
2007. Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing. 37:671-705.
[ESDAICC] .
2004. Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
[1256] .
2009. Qualitative versus Quantitative Techniques in a Petri net settings. Buletinul Institutului Politehnic din Iasi. Tomul LV (LIX), Fasc. 4:35-46.
[CelayaAGRID06] .
2006. YA: Fast and Scalable Discovery of Idle CPUs in a P2P Network. :49-55.
[CelayaAHPCC06] .
2006. Scalable Architecture for Allocation of Idle CPUs in a P2P Network. :240-249.
[1246] .
2006. YA: Fast and Scalable Discovery of Idle CPUs in a P2P network. 7th IEEE/ACM International Conference on Grid Computing.
[1247] .
2006. Scalable Architecture for Allocation of Idle CPUs in a P2P Network. 2nd International Conference on High Performance Computing and Communications.
[1248] .
2010. Distributed Scheduler of Workflows with Deadlines in a P2P Desktop Grid. 18th Euromicro International Conference on Parallel, Distributed and Network-Based Computing.
[1253] .
2009. An Efficient Heuristics for Minimum Time Control of Continuous Petri nets. 3rd IFAC Conference on Analysis and Design of Hybrid Systems (2009).
[1255] .
2010. A Control Method for Timed Distributed Continuous Petri nets. ACC'10: Proceedings of the 2010 conference on American Control Conference.
[1279] .
2010. Approaching Minimum Time Control of Timed Continuous Petri nets. Nonlinear Analysis: Hybrid Systems.
[1280] .
2010. An Iterative Control Method for Distributed Continuous Petri Nets. CDC10: 49th IEEE Conference on Decision and Control.
[238] .
1995. Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. Quantitative Methods in Parallel Systems. :161-174.
[245] .
1994. Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. Performance Evaluation of parallel and distributed systems. Solution Methods. :197-213.
[250] .
1993. Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. IEEE 5th International Workshop on Petri Nets and Performance Models (PNPM'93). :128-137.
[AmbMay97] .
1997. Resource Bounded Measure and Randomness. :1-47.
[AmMaZh96] .
1996. A Comparison of Weak Completeness Notions. :171-178.
[AMWZ96] .
1996. Resource bounded balanced genericity stochasticity and weak randomness. 1046:63-74.
[1412] .
2012. PHYSER: An Algorithm to Detect Sequencing Errors from Phylogenetic Information. 6th International Conference on Practical Applications of Computational Biology & Bioinformatics (PACBB 2012).
[1304] .
2011. Workflows with model selection: a multilocus approach to phylogenetic analysis. 5th International Conference on Practical Applications of Computational Biology & Bioinformatics (PACBB 2011). 93/2011:39-47.
[RP-85-03] .
1985. Generalized Inverses and the Calculation of Symbolic Invariants for Colored Petri Nets. Technique et Science Informatique (TSI). 4:113-126.
[RP-86-03] .
1986. Petri nets for the specification of FMSs. :389-406.
[1303] .
2010. Scalable Phylogenetics through Input Preprocessing.
[AMMP08] .
2008. Pushdown compression. :39-48.
]