Publications
Filters: First Letter Of Title is T [Clear All Filters]
[278] Tight Polynomial Bounds for Steady-State Performance of Marked Graphs. Third IEEE International Workshop on Petri Nets and Performance Models (PNPM'89). :200-209.
.
1989.
[RP-96-12] A Throughtput Approximation Algorithm for Decision Free Processes. :161-178.
.
1996.
[CS-Melbourne-91] Throughput Upper Bounds for Markovian Petri Nets Embedded Subnets and Queueing Networks. :312-321.
.
1991.
[PFMBC-JCST-13] Throughput Quantitative Analysis of EDCA 802.11e in Different Scenarios. Journal of Computer Science & Technology. 13(1):16-23.
.
2013.
[CSS-Melbourne-91] Throughput Lower Bounds for Markovian Petri Nets Transformation Techniques. :322-331.
.
1991.
[RP-97-06] Throughput Approximation of Decision Free Processes Using Decomposition. :174-182.
.
1997.
[RP-86-06] Terminal controllers for robots: Shooting and optimal control. :384-389.
.
1986.
[1320] Temporal Logics for Phylogenetic Analysis via Model Checking. Workshop on Mining and Management of Biological and Health Data – A Satellite Workshop of the 2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM10). :152-157.
.
2010.
[1475] Temporal Logics for Phylogenetic Analysis via Model Checking. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 10(4):1058-1070. Abstract
.
2013.
.
2002.
[BLV07] Tail estimates and a random embedding of l^p_n to l_r^{(1+ε)n}, 0<r<p<2.. Publ. Math. Debrecen. 70
.
2007.
[1396] Table-based Recursive Method for Function Evaluation. International Conference of Numerical Analysis and Applied Mathematics 2007.
.
2007.
[1399] Table-based Recursive Method for Function Evaluation. Numerical Analysis and Applied Mathematics 2007.
.
2007.
[1393] Table-based Method for Reconfigurable Function Evaluation. 23rd IEEE International Symposium on Parallel and Distributed Processing (IPDPS) 2009.
.
2009.