Result 1 to 20 of 79 total
Synthesis and some of its challenges. (English)
Madhusudan, P. (ed.) et al., Computer aided verification. 24th international conference, CAV 2012, Berkeley, CA, USA, July 7‒13, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31423-0/pbk). Lecture Notes in Computer Science 7358, 1 (2012).
1
Counting walks in a quadrant: a unified approach via boundary value problems. (English)
J. Eur. Math. Soc. (JEMS) 14, No. 3, 749-777 (2012).
2
Inexact uniformization and GMRES methods for large Markov chains. (English)
Numer. Linear Algebra Appl. 18, No. 6, 947-960 (2011).
3
The Church synthesis problem with metric. (English)
Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12‒15, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPICS ‒ Leibniz International Proceedings in Informatics 12, 307-321, electronic only (2011).
4
A refined EM algorithm for PH distributions. (English)
Perform. Eval. 68, No. 10, 938-954 (2011).
5
On the admissible sets of type ${\bbfH}{\bbfY}{\bbfP}(\frak M)$ over recursively saturated models. (English)
Sib. Math. J. 52, No. 6, 951-968 (2011); translation from Sib. Mat. Zh. 52, No. 6, 1199-1220 (2011).
6
Effectivity properties of intuitionistic set theory with collection scheme. (English)
Math. Notes 89, No. 5, 619-632 (2011); translation from Mat. Zametki 89, No. 5, 658-672 (2011).
7
Explicit expression for the generating function counting Gessel’s walks. (English)
Adv. Appl. Math. 47, No. 3, 414-433 (2011).
8
Reverse mathematics and uniformity in proofs without excluded middle. (English)
Notre Dame J. Formal Logic 52, No. 2, 149-162 (2011).
9
On the numerical analysis of inhomogeneous continuous-time Markov chains. (English)
INFORMS J. Comput. 22, No. 3, 416-432 (2010).
10
Selection over classes of ordinals expanded by monadic predicates. (English)
Ann. Pure Appl. Logic 161, No. 8, 1006-1023 (2010).
11
Strongly splitting systematic authentication codes. (Chinese)
J. Shanghai Univ., Nat. Sci. 15, No. 3, 265-271 (2009).
12
Time-bounded model checking of infinite-state continuous-time Markov chains. (English)
Fundam. Inform. 95, No. 1, 129-155 (2009).
13
Surface quasi-conformal mapping by solving Beltrami equations. (English)
Hancock, Edwin R. (ed.) et al., Mathematics of surfaces XIII. 13th IMA international conference York, UK, September 7‒9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03595-1/pbk). Lecture Notes in Computer Science 5654, 391-408 (2009).
14
A $Π^1_1$-uniformization principle for reals. (English)
Trans. Am. Math. Soc. 361, No. 8, 4233-4245 (2009).
15
Analysis of $GI^{X}/ M(n)// N$ systems with stochastic customer acceptance policy. (English)
Queueing Syst. 58, No. 1, 29-55 (2008).
16
Computing general geometric structures on surfaces using Ricci flow. (English)
Comput.-Aided Des. 39, No. 8, 663-675 (2007).
17
Inexact uniformization method for computing transient distributions of Markov chains. (English)
SIAM J. Sci. Comput. 29, No. 6, 2562-2580 (2007).
18
Stationary analysis of a fluid queue driven by some countable state space Markov chain. (English)
Methodol. Comput. Appl. Probab. 9, No. 4, 521-540 (2007).
19
Computable Riemann surfaces (extended abstract). (English)
Cooper, S. Barry (ed.) et al., Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18‒23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73000-2/pbk). Lecture Notes in Computer Science 4497, 638-647 (2007).
20
Result 1 to 20 of 79 total
Start
Contact
Print
General Help
