Books:
Edited Books:
 P. Buchholz, T. Dayar, eds.,
ACM International Conference Proceeding Series Vol.321:
Proceedings of the International Workshop on Tools for
Solving Structured Markov Chains,
26 October 2007, Nantes, France, ACM Press, 2007.
 C. Aykanat, T. Dayar, and I. Korpeoglu, eds.,
Lecture Notes in Computer Science 3280: Proceedings of the
19th International Symposium on Computer and Information Sciences,
2729 October 2004, KemerAntalya, Turkey, SpringerVerlag, 2004.
 T. Dayar, E. Karasan, and M. Alanyali, eds.,
Proceedings of the 5th Symposium on Computer Networks,
1516 June 2000, Ankara, Turkey, 2000.
 U. Gudukbay, T. Dayar, A. Gursoy, and E. Gelenbe, eds.,
Advances in Computer and Information Sciences '98: Proceedings of the 13th
International Symposium on Computer and Information Sciences,
2628 October 1998, Antalya, Turkey, IOS Press/Ohmsha, 1998.
Book Chapters:
 T. Dayar and W. J. Stewart,
Computational methods for DTMCs,
Wiley Encyclopedia of Operations Research and Management Science,
Eds. J. Cochran, T. Cox, P. Keskinocak, J. P. Kharoufeh, J. C. Smith,
John Wiley & Sons, Inc., New York, USA, 2011, pp. 851862.
(abstract)
 T. Dayar and W. J. Stewart,
Computational methods for CTMCs,
Wiley Encyclopedia of Operations Research and Management Science,
Eds. J. Cochran, T. Cox, P. Keskinocak, J. P. Kharoufeh, J. C. Smith,
John Wiley & Sons, Inc., New York, USA, 2011, pp. 844851.
(abstract)
 T. Dayar,
Analyzing Markov chains based on Kronecker products,
MAM 2006: Markov Anniversary Meeting,
Eds. A. N. Langville, W. J. Stewart, Boson Books, Raleigh,
North Carolina, USA, 2006, pp. 279300.
(abstract)
 T. Dayar, J.M. Fourneau, N. Pekergin, and J.M. Vincent,
Polynomials of a stochastic matrix and strong stochastic bounds,
MAM 2006: Markov Anniversary Meeting,
Eds. A. N. Langville, W. J. Stewart, Boson Books, Raleigh,
North Carolina, USA, 2006, pp. 211228.
(abstract)
 T. Dayar,
Effects of reordering and lumping in the analysis of discretetime SANs,
Mathematics and Computer Science: Algorithms, Trees, Combinatorics and
Probabilities, Eds. D. Gardy, A. Mokkadem, Birkhauser Verlag, Basel,
Switzerland, 2000, pp.209220.
(abstract)
 O. Gusak and T. Dayar,
A generalization of a TCP Model: multiple sourcedestination case with
arbitrary LAN as the access network,
System Performance Evaluation: Methodologies and Applications,
Ed. E. Gelenbe, CRC Press, Boca Raton, Florida, 2000, pp.3949.
(abstract)
Articles in Refereed Journals:
 T. Dayar, M. C. Orhan,
On compact vector formats in the solution of the chemical master equation
with backward differentiation,
Numerical Linear Algebra with Applications (2018), e2158.
(abstract)
 P. Buchholz, T. Dayar, J. Kriege, M.C. Orhan,
On compact solution vectors in Kroneckerbased Markovian analysis,
Performance Evaluation 115 (2017), pp.132149.
(abstract)
 T. Dayar, M. C. Orhan,
Steadystate analysis of a multiclass MAP/PH/c queue with acyclic PH retrials,
Journal of Applied Probability 53 (2016), pp.10981110.
(abstract)
 T. Dayar, M. C. Orhan,
Cartesian product partitioning of multidimensional reachable state spaces,
Probability in the Engineering and Informational Sciences 30 (2016),
pp.413430.
(abstract)
 T. Dayar, M. C. Orhan,
On vectorKronecker product multiplication with rectangular factors,
SIAM Journal on Scientific Computing 37 (2015), pp.S526S543.
(abstract)
 H. Baumann, T. Dayar, M. C. Orhan, and W. Sandmann,
On the numerical solution of Kroneckerbased infinite leveldependent QBD processes,
Performance Evaluation 70 (2013), pp.663681.
(abstract)
 T. Dayar, M. C. Orhan,
Kroneckerbased infinite leveldependent QBDs,
Journal of Applied Probability 49 (2012), pp.11661187.
(abstract)
 T. Dayar, W. Sandmann, D. Spieler, and V. Wolf,
Infinite leveldependent QBD processes and matrix analytic solutions for
stochastic chemical kinetics,
Advances in Applied Probability 43 (2011), pp. 10051026.
(abstract)
 T. Dayar, H. Hermanns, D. Spieler, and V. Wolf,
Bounding the equilibrium distribution of Markov population models,
Numerical Linear Algebra with Applications 18 (2011), pp. 931946.
(abstract)
Check out my coauthors in this video.
 T. Dayar and G. N. Noyan,
Steadystate analysis of Googlelike stochastic matrices with block iterative
methods,
Electronic Transactions on Numerical Analysis 38 (2011), pp. 6997.
(abstract)
 Y. Bao, I. N. Bozkurt, T. Dayar, X. Sun, and K. S. Trivedi,
Decompositional analysis of Kronecker structured Markov chains,
Electronic Transactions on Numerical Analysis 31 (2008), pp. 271294.
(abstract)
 T. Dayar and A. Meric,
Kronecker representation and decompositional analysis of closed queueing networks
with phasetype service distributions and arbitrary buffer sizes,
Annals of Operations Research 164 (2008), pp. 193210.
(abstract)
 P. Buchholz and T. Dayar,
On the convergence of a class of multilevel methods for large, sparse Markov chains,
SIAM Journal on Matrix Analysis and Applications 29 (2007),
pp. 10251049.
(abstract)
 T. Dayar and N. Akar,
Computing moments of first passage times to a subset of states in Markov chains,
SIAM Journal on Matrix Analysis and Applications 27 (2005),
pp. 396412.
(abstract)
 T. Dayar,
On moments of discrete phasetype distributions,
Lecture Notes in Computer Science 3670 (2005), pp. 5163.
(abstract)
 N. Pekergin, T. Dayar, and D. N. Alparslan,
Componentwise bounds for nearly completely decomposable Markov chains using
stochastic comparison and reordering,
European Journal of Operational Research 165 (2005), pp. 810825.
(abstract)
 P. Buchholz and T. Dayar,
Block SOR preconditioned projection methods for Kronecker structured
Markovian representations,
SIAM Journal on Scientific Computing 26 (2005), pp.12891313.
(abstract)
 P. Buchholz and T. Dayar,
Comparison of multilevel methods for Kroneckerbased Markovian representations,
Computing 73 (2004), pp.349371.
(abstract)
 P. Buchholz and T. Dayar,
Block SOR for Kronecker structured representations,
Linear Algebra and Its Applications 386 (2004), pp.83109.
(abstract)
 T. Dayar, J.M. Fourneau, and N. Pekergin,
Transforming stochastic matrices for stochastic comparison with the storder,
RAIRO Operations Research 37 (2003), pp.8597.
(abstract)
 O. Gusak, T. Dayar, and J.M. Fourneau,
Iterative disaggregation for a class of lumpable discretetime stochastic
automata networks,
Performance Evaluation 53 (2003), pp.4369.
(abstract)
 O. Gusak, T. Dayar, and J.M. Fourneau,
Lumpable continuoustime stochastic automata networks,
European Journal of Operational Research 148 (2003), pp.436451.
(abstract)
 T. Dayar and F. Quesette, Quasibirthanddeath processes with levelgeometric
distribution,
SIAM Journal on Matrix Analysis and Applications 24 (2002), pp.281291.
(abstract)
 O. Gusak, T. Dayar, and J.M. Fourneau,
Stochastic automata networks and near complete decomposability,
SIAM Journal on Matrix Analysis and Applications 23 (2001), pp.581599.
(abstract)
 T. Dayar and W. J. Stewart,
Comparison of partitioning techniques for twolevel iterative solvers on
large, sparse Markov chains,
SIAM Journal on Scientific Computing 21 (2000), pp.16911705.
(abstract)
 E. Uysal and T. Dayar,
Iterative methods based on splittings for stochastic automata networks,
European Journal of Operational Research 110 (1998), pp.166186.
(abstract)
 T. Dayar,
State space orderings for GaussSeidel in Markov chains revisited,
SIAM Journal on Scientific Computing 19 (1998), pp.148154.
(abstract)
 T. Dayar and W. J. Stewart,
Quasilumpability, lowerbounding coupling matrices and nearly completely
decomposable Markov chains,
SIAM Journal on Matrix Analysis and Applications 18 (1997),
pp.482498.
(abstract)
 T. Dayar and W. J. Stewart,
On the effects of using the GrassmannTaksarHeyman method in iterative
aggregationdisaggregation,
SIAM Journal on Scientific Computing 17 (1996), pp.287303.
(abstract)
 M. Benzi and T. Dayar,
The arithmetic mean method for finding the stationary vector of Markov chains,
Parallel Algorithms and Applications 6 (1995), pp.2537.
(abstract)
Papers in Refereed Conference Proceedings:
 T. Dayar, M. C. Orhan,
A software tool for the compact solution of the chemical master equation,
19th International GI/ITG Conference on Measurement, Modelling and
Evaluation of Computing Systems, 2628 February 2018, Erlangen, Germany.
Lecture Notes in Computer Science 10740 (2018), pp..
(abstract)
 P. Buchholz, T. Dayar, J. Kriege, and M. C. Orhan,
Compact representation of solution vectors in Kroneckerbased Markovian analysis,
13th International Conference on Quantitative Evaluation of Systems,
2325 August 2016, Quebec City, Canada.
Lecture Notes in Computer Science 9826 (2016), pp.260276.
(abstract)
 T. Dayar, L. Mikeev, and V. Wolf,
On the numerical analysis of stochastic LotkaVolterra models,
Proceedings of the International Multiconference on
Computer Science and Information Technology,
Eds. M. Ghanza, M. Paprzycki, Wisla, Poland, 2010, pp.289296.
(abstract)
 T. Dayar and G. N. Noyan,
A software tool for the steadystate analysis of Googlelike stochastic
matrices,
Proceeding of the 2009 Workshop on Tools for Solving Structured Markov
Chains,
Eds. B. Meini, A. Horvath, Pisa, Italy, ACM International Conference
Proceeding Series, ACM Press, New York, NY, USA, 2009.
(abstract)
 T. Dayar, N. Pekergin, and S. Younes,
Conditional steadystate bounds for a subset of states in Markov chains,
Proceeding of the 2006 Workshop on Tools for Solving Structured Markov
Chains,
Eds. B. Meini, B. van Houdt, Pisa, Italy, ACM International Conference
Proceeding Series, Vol. 201, ACM Press, New York, NY, USA, 2006, Article 3.
(abstract)
 P. Buchholz and T. Dayar,
Block SOR for Kronecker structured representations,
Proceedings of the 2003 International
Conference on the Numerical Solution of Markov Chains,
Eds. A. N. Langville, W. J. Stewart, Urbana, Illinois, USA, 2003,
pp. 121143.
 O. Gusak and T. Dayar,
Iterative aggregationdisaggregation versus block GaussSeidel on
continuoustime stochastic automata networks with unfavorable
partitionings, Proceedings of the 2001 International
Symposium on Performance Evaluation of Computer and Telecommunication
Systems, Eds. M. S. Obaidat, F. Davoli, SCS Press, Orlando, Florida,
USA, 2001, pp. 617623.
(abstract)
 O. Gusak and T. Dayar,
Solving lumpable continuoustime stochastic automata networks with
unfavorable partitionings,
Proceedings of the Sixth Symposium on Computer Networks,
Eds. M. Salamah, I. Aybay, A. Acan, Gazimagusa, TRNC, 2001, pp.3140.
 T. Dayar and N. Pekergin,
Stochastic comparison, reorderings, and nearly completely decomposable Markov
chains,
Numerical Solution of Markov Chains, Eds. B. Plateau, W. J. Stewart,
M. Silva, Prensas Universitarias de Zaragoza, Zaragoza, Spain, 1999,
pp.228246.
(abstract)
 T. Dayar and N. Pekergin,
Reordering Markov chains and stochastic comparison,
Proceedings of the 14th International Symposium on Computer and Information
Sciences, Eds. M. Turksever, N. Y. Topaloglu, N. ZincirHeywood,
A. Kantarci, C. A. Surgevil, O. Ozmen, Izmir, Turkey, 1999, pp.844851.
(abstract)
 O. Gusak and T. Dayar,
A generalization of a TCP Model: multiple sourcedestination case with
arbitrary LAN as the access network,
Proceedings of the Fourth Symposium on Computer Networks,
Eds. S. Oktug, B. Orencik, E. Harmanci, Istanbul, Turkey, 1999, pp.102111.
 O. Gusak and T. Dayar,
Mail message routing in case of Internet link failures,
Proceedings of the Third Symposium on Computer Networks,
Eds. A. Alpkocak, E. Ozkarahan, Izmir, Turkey, 1998, pp.5054.
(abstract)
 D. Tokgoz and T. Dayar,
Addressing and routing in the cube model of Manhattan Street Network,
Proceedings of the Second Symposium on Computer Networks,
Eds. S. Bilgen, A. Ozgit Ankara, Turkey, 1997, pp.113.
(abstract)
 O. Aras and T. Dayar,
Complete buffer sharing with pushout thresholds in ATM networks under bursty
arrivals,
Proceedings of the First Symposium on Computer Networks,
Eds. S. Bilgen, M. U. Caglayan, C. Ersoy, Istanbul, Turkey, 1996, pp.144156.
(abstract)
 M. Benzi and T. Dayar, The arithmetic mean method for finding the
stationary vector of Markov chains, Short Papers and Tool Descriptions of
the 7th International Conference on Modelling Techniques and Tools for
Computer Performance Evaluation, Vienna, Austria, 1994, pp.5762.
Contributed Conferences:
 P. Buchholz, T. Dayar, J. Kriege, and M. Can Orhan,
Representing probability vectors compactly,
25th International Workshop on Matrices and Statistics,
69 June 2016, Funchal, Madeira (Wednesday, 8 June; Special Session Honouring
Professor Jeffrey J. Hunter).
 T. Dayar and M. C. Orhan,
Steadystate analysis of a multiclass MAP/PH/c queue with acyclic PH retrials,
SIAM Conference on Applied Linear Algebra,
2630 October 2015, Atlanta, GA, USA (Friday, October 30; Minisymposium
Numerical Methods for Markov Chains and Stochastic Models)
 T. Dayar and M. C. Orhan,
Cartesian product partitioning of multidimensional reachable state spaces,
A Symposium Honouring Professor Erol Gelenbe,
2124 September 2015, Imperial College, London, UK
(Tuesday, 22 September; Stochastic Networks).
 T. Dayar and M. C. Orhan,
Infinite leveldependent QBD models for call centers with multiclass customers
under balking, impatience, and retrials,
10th International Workshop on Retrial Queues,
2426 July 2014, Tokyo Institute of Technology, Tokyo, Japan.
 T. Dayar,
Analyzing Markov chains using Kronecker products,
23rd International Workshop on Matrices and Statistics,
912 June 2014, Ljubljana, Slovenia (Monday, 7 June).
 T. Dayar,
Iterative aggregationdisaggregation for Markov chains: The Czech perspective,
Preconditioning of Iterative Methods: Theory and Applications,
15 July 2013, Prague, Czech Republic (Thursday, 4 July).
 T. Dayar and M. C. Orhan,
Cartesian product partitioning of reachable state space for multilevel methods,
Preconditioning of Iterative Methods: Theory and Applications,
15 July 2013, Prague, Czech Republic (Tuesday, 2 July).
 T. Dayar and M. C. Orhan,
On the Numerical Solution of Infinite Kroneckerbased LevelDependent QBDs,
When Probability Meets Computation, 68 June 2012, Varese, Italy
(Thursday, 7 June).
 T. Dayar and M. C. Orhan,
Kroneckerbased Infinite Leveldependent QBDs: Matrix Analytic Solution versus
Simulation, Workshop on Modelling and Analysis of Complex Reaction Networks,
21 March 2012, Kasierslautern, Germany.
 T. Dayar, H. Hermanns, D. Spieler, and V. Wolf,
Bounding the Equilibrium Distribution of Markov Population Models,
Sixth International Workshop on the Numerical Solution of Markov Chains,
1617 September 2010, Williamsburg, Virginia, USA.
 T. Dayar, Analyzing Large Sparse Markov Chains of Kronecker Products,
6th International Conference on Quantitative Evaluation of Systems,
1316 September 2009, Budapest, Hungary (Tutorial Session).
 Y. Bao, I. N. Bozkurt, T. Dayar, X. Sun, and K. S. Trivedi,
Decompositional analysis of Kronecker structured Markov chains,
Computational Methods with Applications, 1925 August 2007,
Harrachov, Czech Republic.
 T. Dayar and A. Meric,
A fixed point iteration scheme for closed queueing networks with phasetype
distributions and arbitrary buffer sizes,
Second Madrid Conference on Queueing Theory, 37 July 2006, Madrid, Spain.
 T. Dayar,
Analyzing Markov chains based on Kronecker products,
The A. A. Markov Anniversary Meeting, 1214 June 2006,
Charleston, South Carolina, USA, (Tuesday, June 13; Morning Session 2)
 T. Dayar, J.M. Fourneau, N. Pekergin, and J.M. Vincent,
Polynomials of a stochastic matrix and strong stochastic bounds,
The A. A. Markov Anniversary Meeting, 1214 June 2006, Charleston,
South Carolina, USA, (Wednesday, June 14; Morning Session 1)
 T. Dayar,
Analyzing Markov chains based on Kronecker products,
Colloquium for Humboldt Fellows and Awardees, 79 April 2006,
Istanbul, Turkey, (Saturday, April 8; Session 7: Engineering Sciences)
 T. Dayar,
On moments of discrete phasetype distributions,
European Performance Engineering Workshop and International Workshop on
Web Services and Formal Methods, 13 September 2005, Versailles, France,
(Thursday, September 1; Opening Session).
 T. Dayar, J.M. Fourneau, N. Pekergin, and J.M. Vincent,
A proof of stcomparison for polynomials of a stochastic matrix and how
we can improve the accuracy of stbounds,
Second International Working Conference on Performance Modelling and
Evaluation of Heterogeneous Networks, 2628 July 2004, Ilkley, West Yorkshire,
UK, (Wednesday, July 28; Session 12B: Methodologies & Analytical Tools
VII).
 O. Gusak, T. Dayar, and J.M. Fourneau,
Lumpable continuoustime stochastic automata networks,
International Conference on Mathematical Modelling and Scientific Computing,
26 April 2001, AnkaraKonya, Turkey.
 O. Gusak, T. Dayar, and J.M. Fourneau,
Efficient analysis of discretetime stochastic automata networks,
Seventh SIAM Conference on Applied Linear Algebra, 2326 October 2000,
Raleigh, North Carolina, USA, (Tuesday, October 24; Iterative Methods:
Concurrent Presentation 12; Room 3).
 O. Gusak, T. Dayar, and J.M. Fourneau,
Stochastic automata networks and near complete decomposability,
Workshop on Stochastic Networks, 2630 June 2000, Madison, Wisconsin,
USA, (Thursday, June 29).
 O. Gusak and T. Dayar,
A generalization of a TCP Model: multiple sourcedestination case with
arbitrary LAN as the access network,
PERFORMANCE'99, 1517 October 1999, Bogazici University, Istanbul,
Turkey, (Sunday, October 16; Network Performance).
 T. Dayar,
Commercial and free solvers for linear systems (in Turkish),
Conference on Academic Computing, 1820 March 1999, Middle East Technical
University, Ankara, Turkey, (Thursday, March 18; Computing in Research).
 T. Dayar and W. J. Stewart,
Comparison of partitioning techniques for twolevel iterative solvers on
large, sparse Markov chains,
Copper Mountain Conference on Iterative Methods, 30 March3 April 1998,
Copper Mountain, Colorado, USA, (Monday, March 30; Preconditioning;
Room A).
 T. Dayar, O. I. Pentakalos, and A. B. Stephens,
Analytical modeling of robotic tape libraries using stochastic automata,
IASTED International Conference on Applied Modelling and Simulation, 27
July1 August 1997, Banff, Canada, (Wednesday, July 30; Robotics:
Session 9).
 T. Dayar, W. Gueaieb and W. J. Stewart,
Experiments with twostage iterative solvers and preconditioned Krylov
subspace methods on nearly completely decomposable Markov chains,
Iterative Methods and Parallel Computing (IMPC)'97, 1621 June 1997,
Milovy, Czech Republic, (Wednesday, June 19; Parallel Session No. 2;
Room 2).
 T. Dayar,
State space orderings for GaussSeidel in Markov chains revisited,
Copper Mountain Conference on Iterative Methods, 913 April 1996, Copper
Mountain, Colorado, USA, (Friday, April 12; Markov Chains; Room C).
 T. Dayar and W. J. Stewart,
On the effects of using the GrassmannTaksarHeyman method in the iterative
aggregationdisaggregation technique,
Colorado Conference on Iterative Methods, 49 April 1994, Breckenridge,
Colorado, USA, (Wednesday, April 6; Iterative Methods: Theory; Room A).
Technical Reports:
 T. Dayar and M. C. Orhan,
Cartesian product partitioning of multidimensional reachable state spaces,
Technical Report BUCE1303, Department of Computer Engineering, Bilkent University,
Ankara, Turkey, December 2013.
(abstract)
 H. Baumann, T. Dayar, M. C. Orhan, and W. Sandmann,
On the numerical solution of Kroneckerbased infinite leveldependent QBD processes,
Technical Report BUCE1206, Department of Computer Engineering, Bilkent University,
Ankara, Turkey, December 2012.
(abstract)
 T. Dayar,
Obtaining triangular diagonal blocks in sparse matrices using cutsets,
Technical Report BUCE0701, Department of Computer Engineering, Bilkent University,
Ankara, Turkey, January 2007.
(abstract)
 P. Buchholz and T. Dayar,
On the convergence of a class of multilevel methods for large, sparse Markov chains,
Technical Report BUCE0601, Department of Computer Engineering, Bilkent University,
Ankara, Turkey, January 2006.
(abstract)
 T. Dayar and N. Akar,
Computing moments of first passage times to a subset of states in Markov chains,
Technical Report BUCE0414, Department of Computer Engineering, Bilkent University,
Ankara, Turkey, December 2004.
(abstract)
 P. Buchholz and T. Dayar, Block SOR preconditioned projection methods for
Kronecker structured Markovian representations,
Technical Report TUDFI0305
Department of Computer Science, Dresden University
of Technology, Dresden, Germany, May 2003.
(abstract)
 P. Buchholz and T. Dayar, Block SOR for Kronecker structured representations,
Technical Report TUDFI0302 Department of Computer Science, Dresden University
of Technology, Dresden, Germany, March 2003.
(abstract)
 N. Pekergin, T. Dayar, and D. N. Alparslan, Componentwise bounds for nearly
completely decomposable Markov chains using stochastic comparison and reordering,
Technical Report BUCE0202, Department of Computer Engineering, Bilkent University,
Ankara, Turkey, January 2002.
(abstract)
 T. Dayar and F. Quessette, Quasibirthanddeath processes with levelgeometric
distribution,
Technical Report BUCE0105, Department of Computer Engineering, Bilkent University,
Ankara, Turkey, May 2001.
(abstract)
 O. Gusak, T. Dayar, and J.M. Fourneau, Stochastic automata networks and near
complete decomposability,
Technical Report BUCE0016, Department of Computer Engineering, Bilkent University,
Ankara, Turkey, October 2000.
(abstract)
 T. Dayar, Permuting Markov chains to nearly completely decomposable
form, Technical Report BUCEIS9808, Department of Computer Engineering
and Information Science, Bilkent University, Ankara, Turkey, August 1998.
(abstract)
 T. Dayar and W. J. Stewart, Comparison of partitioning techniques for
twolevel iterative methods on large, sparse Markov chains,
Technical Report BUCEIS9805, Department of Computer Engineering
and Information Science, Bilkent University, Ankara, Turkey, April 1998.
(abstract)
 T. Dayar, O. I. Pentakalos, and A. B. Stephens, Analytical modeling of
robotic tape libraries using stochastic automata, Technical Report
TR97189, Center of Excellence in Space Data & Information Systems,
NASA/Goddard Space Flight Center, Maryland, USA, January 1997.
(abstract)
 T. Dayar, Nonsymmetric skyline versus compressed sparse row format
in direct methods for Markov chains, Technical Report BUCEIS9620,
Department of Computer Engineering and Information Science, Bilkent
University, Ankara, Turkey, September 1996.
(abstract)
 T. Dayar and W. J. Stewart, Exploring states of sparse, large Markov
chains, Technical Report BUCEIS9505, Department of Computer Engineering
and Information Science, Bilkent University, Ankara, Turkey, April 1995.
(abstract)
Reviews:

D. Raz, H. Levy, B. AviItzhak,
On the twin measure and queueing systems predictability,
Performance Evaluation 65 (2009), pp. 839853,
(review
by T. Dayar, ACM Computing Reviews, April 27, 2009, CR 136742)

J. Jurado, F. Nieto, S. Hernandez, A. Mosquera,
Efficient cable arrangement in cable stayed bridges based on sensitivity analysis
of aeroelastic behaviour,
Advances in Engineering Software 39 (2008), pp. 757763.
(review
by T. Dayar, ACM Computing Reviews, December 17, 2008, CR 136354)

A. Holt,
Network Performance Analysis: Using the J Programming Language,
SpringerVerlag, New York, Inc., Secaucus, NJ, 2007.
(review
by T. Dayar, ACM Computing Reviews, March 4, 2008, CR 135336)

R. Orsi,
Numerical methods for solving inverse eigenvalue problems for nonnegative matrices,
SIAM Journal on Matrix Analysis and Applications 28 (2006),
pp.190212.
(review
by T. Dayar, AMS Mathematical Reviews, 25 May 2007, MR2218949)

J. Jahn,
Multiobjective Search Algorithm with Subdivision Technique,
Combinatorial Optimization 35 (2006), pp.161175.
(review
by T. Dayar, ACM Computing Reviews, May 11, 2007, CR 134256)

G. Tsitsiashvili, M. Osipova,
Probability Distribution in VaryingStructure Queueing Networks,
Problems of Information Transmission 42 (2006), pp.158165.
(review
by T. Dayar, ACM Computing Reviews, November 10, 2006, CR 133546)

T. Hagras, J. Janecek,
A High Performance, Low Complexity Algorithm for CompileTime Task Scheduling
in Heterogeneous Systems,
Parallel Computing 31 (2005), pp.653670.
(review
by T. Dayar, ACM Computing Reviews, August 8, 2006, CR 133143)

Y.J. Wang,
The monotonicity of convergence rate for MGS methods,
Numerical Mathematics: A Journal of Chinese Universities 14 (2005),
pp.325329.
(review
by T. Dayar, AMS Mathematical Reviews, 1 July 2006, MR2196840)

D. Miorandi, A. A. Kherani, E. Altman,
A Queueing Model for HTTP Traffic over IEEE 802.11 Wireless LANs,
Computer Networks 50 (2006), pp.6379.
(review
by T. Dayar, ACM Computing Reviews, May 31, 2006, CR 132851)

S. C. Chin, A. Ray, and V. Rajagopalan,
Symbolic time series analysis for anomaly detection: a comparative evaluation,
Signal Processing 85 (2005), pp.18591868.
(review
by T. Dayar, ACM Computing Reviews, February 23, 2006, CR 132471)

P. Husbands, H. Simon, and C. Ding,
Term norm distribution and its effects on latent semantic indexing,
Information Processing and Management: an International Journal 41
(2005), pp.777787.
(review
by T. Dayar, ACM Computing Reviews, November 11, 2005, CR 132023)

M. W. Berry, S. A. Pulatova, and G. W. Stewart,
Algorithm 844: Computing sparse reducedrank approximations to sparse matrices,
ACM Transactions on Mathematical Software 31 (2005), pp.252269.
(review
by T. Dayar, ACM Computing Reviews, August 23, 2005, CR 131704)

E. DeBenedictis,
Reversible logic for supercomputing,
Computing Frontiers: Proceedings of the 2nd Conference, Ischia, Italy,
May 46, 2005, pp.391402.
(review
by T. Dayar, ACM Computing Reviews, July 1, 2005, CR 131443)

A. Lakshmikantha, C. Beck, and R. Srikant,
Robustness of real and virtual queuebased active queue management schemes,
IEEE/ACM Transactions on Networking 13 (2005), pp.8193.
(review
by T. Dayar, ACM Computing Reviews, May 18, 2005, CR 131295)
Coauthors:
 Nail Akar
 Murat Alanyali
 Denizhan N. Alparslan
 Ozgur Aras
 Cevdet Aykanat
 Yujuan Bao
 Hendrik Baumann
 Michele Benzi
 Ilker N. Bozkurt
 Peter Buchholz
 JeanMichele Fourneau
 Erol Gelenbe
 Ugur Gudukbay
 Wael Gueaieb
 Attila Gursoy
 Oleg Gusak
 Holger Hermanns
 Ezhan Karasan
 Ibrahim Korpeoglu
 Jan Kriege
 Akin Meric
 Linar Mikeev
 Gokce N. Noyan
 M. Can Orhan
 Nihal Pekergin
 Odysseas I. Pentakalos
 Franck Quessette
 Werner Sandmann
 David Spieler
 A. Brooke Stephens
 Willam J. Stewart
 Xiaobai Sun
 Davut Tokgoz
 Kishor S. Trivedi
 Ertugrul Uysal
 JeanMarc Vincent
 Verena Wolf
 Sana Younes
1) gzipped postscript or pdf copies of Bilkent University technical reports
may be found at
http://www.cs.bilkent.edu.tr/index.php?p=publications&l=tr
2) gzipped postscript or pdf copies of papers may be found at
http://www.cs.bilkent.edu.tr/~tugrul/pub/Papers