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, 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,
27-29 October 2004, Kemer-Antalya, Turkey, Springer-Verlag, 2004.
- T. Dayar, E. Karasan, and M. Alanyali, eds.,
Proceedings of the 5th Symposium on Computer Networks,
15-16 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,
26-28 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. 851-862.
(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. 844-851.
(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. 279-300.
(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. 211-228.
(abstract)
- T. Dayar,
Effects of reordering and lumping in the analysis of discrete-time SANs,
Mathematics and Computer Science: Algorithms, Trees, Combinatorics and
Probabilities, Eds. D. Gardy, A. Mokkadem, Birkhauser Verlag, Basel,
Switzerland, 2000, pp.209-220.
(abstract)
- O. Gusak and T. Dayar,
A generalization of a TCP Model: multiple source-destination case with
arbitrary LAN as the access network,
System Performance Evaluation: Methodologies and Applications,
Ed. E. Gelenbe, CRC Press, Boca Raton, Florida, 2000, pp.39-49.
(abstract)
Articles in Refereed Journals:
- H. Baumann, T. Dayar, M. C. Orhan, and W. Sandmann,
On the numerical solution of Kronecker-based infinite level-dependent QBD processes,
to appear in
Performance Evaluation.
- T. Dayar, M. C. Orhan,
Kronecker-based infinite level-dependent QBDs,
Journal of Applied Probability 49 (2012), pp.1166-1187.
(abstract)
- T. Dayar, W. Sandmann, D. Spieler, and V. Wolf,
Infinite level-dependent QBD processes and matrix analytic solutions for
stochastic chemical kinetics,
Advances in Applied Probability 43 (2011), pp. 1005-1026.
(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. 931-946.
(abstract)
Check out my co-authors in this video.
- T. Dayar and G. N. Noyan,
Steady-state analysis of Google-like stochastic matrices with block iterative
methods,
Electronic Transactions on Numerical Analysis 38 (2011), pp. 69-97.
(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. 271-294.
(abstract)
- T. Dayar and A. Meric,
Kronecker representation and decompositional analysis of closed queueing networks
with phase-type service distributions and arbitrary buffer sizes,
Annals of Operations Research 164 (2008), pp. 193-210.
(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. 1025-1049.
(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. 396-412.
(abstract)
- T. Dayar,
On moments of discrete phase-type distributions,
Lecture Notes in Computer Science 3670 (2005), pp. 51-63.
(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. 810-825.
(abstract)
- P. Buchholz and T. Dayar,
Block SOR preconditioned projection methods for Kronecker structured
Markovian representations,
SIAM Journal on Scientific Computing 26 (2005), pp.1289-1313.
(abstract)
- P. Buchholz and T. Dayar,
Comparison of multilevel methods for Kronecker-based Markovian representations,
Computing 73 (2004), pp.349-371.
(abstract)
- P. Buchholz and T. Dayar,
Block SOR for Kronecker structured representations,
Linear Algebra and Its Applications 386 (2004), pp.83-109.
(abstract)
- T. Dayar, J.-M. Fourneau, and N. Pekergin,
Transforming stochastic matrices for stochastic comparison with the st-order,
RAIRO Operations Research 37 (2003), pp.85-97.
(abstract)
- O. Gusak, T. Dayar, and J.-M. Fourneau,
Iterative disaggregation for a class of lumpable discrete-time stochastic
automata networks,
Performance Evaluation 53 (2003), pp.43-69.
(abstract)
- O. Gusak, T. Dayar, and J.-M. Fourneau,
Lumpable continuous-time stochastic automata networks,
European Journal of Operational Research 148 (2003), pp.436-451.
(abstract)
- T. Dayar and F. Quesette, Quasi-birth-and-death processes with level-geometric
distribution,
SIAM Journal on Matrix Analysis and Applications 24 (2002), pp.281-291.
(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.581-599.
(abstract)
- T. Dayar and W. J. Stewart,
Comparison of partitioning techniques for two-level iterative solvers on
large, sparse Markov chains,
SIAM Journal on Scientific Computing 21 (2000), pp.1691-1705.
(abstract)
- E. Uysal and T. Dayar,
Iterative methods based on splittings for stochastic automata networks,
European Journal of Operational Research 110 (1998), pp.166-186.
(abstract)
- T. Dayar,
State space orderings for Gauss-Seidel in Markov chains revisited,
SIAM Journal on Scientific Computing 19 (1998), pp.148-154.
(abstract)
- T. Dayar and W. J. Stewart,
Quasi-lumpability, lower-bounding coupling matrices and nearly completely
decomposable Markov chains,
SIAM Journal on Matrix Analysis and Applications 18 (1997),
pp.482-498.
(abstract)
- T. Dayar and W. J. Stewart,
On the effects of using the Grassmann-Taksar-Heyman method in iterative
aggregation-disaggregation,
SIAM Journal on Scientific Computing 17 (1996), pp.287-303.
(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.25-37.
(abstract)
Papers in Refereed Conference Proceedings:
- T. Dayar, L. Mikeev, and V. Wolf,
On the numerical analysis of stochastic Lotka-Volterra models,
Proceedings of the International Multiconference on
Computer Science and Information Technology,
Eds. M. Ghanza, M. Paprzycki, Wisla, Poland, 2010, pp.289-296.
(abstract).
- T. Dayar and G. N. Noyan,
A software tool for the steady-state analysis of Google-like 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.
- T. Dayar, N. Pekergin, and S. Younes,
Conditional steady-state 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. 121-143.
- O. Gusak and T. Dayar,
Iterative aggregation-disaggregation versus block Gauss-Seidel on
continuous-time 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. 617-623.
(abstract)
- O. Gusak and T. Dayar,
Solving lumpable continuous-time 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.31-40.
- 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.228-246.
(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. Zincir-Heywood,
A. Kantarci, C. A. Surgevil, O. Ozmen, Izmir, Turkey, 1999, pp.844-851.
(abstract)
- O. Gusak and T. Dayar,
A generalization of a TCP Model: multiple source-destination 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.102-111.
- 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.50-54.
(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.1-13.
(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.144-156.
(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.57-62.
Contributed Conferences:
- T. Dayar,
Iterative aggregation-disaggregation for Markov chains: The Czech perspective,
Preconditioning of Iterative Methods: Theory and Applications,
1-5 July 2013, Prague, Czech Republic.
- T. Dayar and M. C. Orhan,
Cartesian product partitioning of reachable state space for multilevel methods,
Preconditioning of Iterative Methods: Theory and Applications,
1-5 July 2013, Prague, Czech Republic.
- T. Dayar and M. C. Orhan,
On the Numerical Solution of Infinite Kronecker-based Level-Dependent QBDs,
When Probability Meets Computation, 6-8 June 2012, Varese, Italy.
- T. Dayar and M. C. Orhan,
Kronecker-based Infinite Level-dependent 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,
16-17 September 2010, Williamsburg, Virginia, USA.
- T. Dayar, Analyzing Large Sparse Markov Chains of Kronecker Products,
6th International Conference on Quantitative Evaluation of Systems,
13-16 September 2009, Budapest, Hungary.
- Y. Bao, I. N. Bozkurt, T. Dayar, X. Sun, and K. S. Trivedi,
Decompositional analysis of Kronecker structured Markov chains,
Computational Methods with Applications, 19-25 August 2007,
Harrachov, Czech Republic.
- T. Dayar and A. Meric,
A fixed point iteration scheme for closed queueing networks with phase-type
distributions and arbitrary buffer sizes,
Second Madrid Conference on Queueing Theory, 3-7 July 2006, Madrid, Spain.
- T. Dayar,
Analyzing Markov chains based on Kronecker products,
The A. A. Markov Anniversary Meeting, 12-14 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, 12-14 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, 7-9 April 2006,
Istanbul, Turkey, (Saturday, April 8; Session 7: Engineering Sciences)
- T. Dayar,
On moments of discrete phase-type distributions,
European Performance Engineering Workshop and International Workshop on
Web Services and Formal Methods, 1-3 September 2005, Versailles, France,
(Thursday, September 1; Opening Session).
- T. Dayar, J.-M. Fourneau, N. Pekergin, and J.-M. Vincent,
A proof of st-comparison for polynomials of a stochastic matrix and how
we can improve the accuracy of st-bounds,
Second International Working Conference on Performance Modelling and
Evaluation of Heterogeneous Networks, 26-28 July 2004, Ilkley, West Yorkshire,
UK, (Wednesday, July 28; Session 12-B: Methodologies & Analytical Tools
VII).
- O. Gusak, T. Dayar, and J.-M. Fourneau,
Lumpable continuous-time stochastic automata networks,
International Conference on Mathematical Modelling and Scientific Computing,
2-6 April 2001, Ankara-Konya, Turkey.
- O. Gusak, T. Dayar, and J.-M. Fourneau,
Efficient analysis of discrete-time stochastic automata networks,
Seventh SIAM Conference on Applied Linear Algebra, 23-26 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, 26-30 June 2000, Madison, Wisconsin,
USA, (Thursday, June 29).
- O. Gusak and T. Dayar,
A generalization of a TCP Model: multiple source-destination case with
arbitrary LAN as the access network,
PERFORMANCE'99, 15-17 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, 18-20 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 two-level iterative solvers on
large, sparse Markov chains,
Copper Mountain Conference on Iterative Methods, 30 March-3 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
July-1 August 1997, Banff, Canada, (Wednesday, July 30; Robotics:
Session 9).
- T. Dayar, W. Gueaieb and W. J. Stewart,
Experiments with two-stage iterative solvers and preconditioned Krylov
subspace methods on nearly completely decomposable Markov chains,
Iterative Methods and Parallel Computing (IMPC)'97, 16-21 June 1997,
Milovy, Czech Republic, (Wednesday, June 19; Parallel Session No. 2;
Room 2).
- T. Dayar,
State space orderings for Gauss-Seidel in Markov chains revisited,
Copper Mountain Conference on Iterative Methods, 9-13 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 Grassmann-Taksar-Heyman method in the iterative
aggregation-disaggregation technique,
Colorado Conference on Iterative Methods, 4-9 April 1994, Breckenridge,
Colorado, USA, (Wednesday, April 6; Iterative Methods: Theory; Room A).
Technical Reports:
- H. Baumann, T. Dayar, M. C. Orhan, and W. Sandmann,
On the numerical solution of Kronecker-based infinite level-dependent QBD processes,
Technical Report BU-CE-1206, Department of Computer Engineering, Bilkent University,
Ankara, Turkey, December 2012.
(abstract)
- T. Dayar,
Obtaining triangular diagonal blocks in sparse matrices using cutsets,
Technical Report BU-CE-0701, 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 BU-CE-0601, 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 BU-CE-0414, 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 TUD-FI03-05
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 TUD-FI03-02 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 BU-CE-0202, Department of Computer Engineering, Bilkent University,
Ankara, Turkey, January 2002.
(abstract)
- T. Dayar and F. Quessette, Quasi-birth-and-death processes with level-geometric
distribution,
Technical Report BU-CE-0105, 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 BU-CE-0016, Department of Computer Engineering, Bilkent University,
Ankara, Turkey, October 2000.
(abstract)
- T. Dayar, Permuting Markov chains to nearly completely decomposable
form, Technical Report BU-CEIS-9808, 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
two-level iterative methods on large, sparse Markov chains,
Technical Report BU-CEIS-9805, 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
TR-97-189, 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 BU-CEIS-9620,
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 BU-CEIS-9505, Department of Computer Engineering
and Information Science, Bilkent University, Ankara, Turkey, April 1995.
(abstract)
Reviews:
-
D. Raz, H. Levy, B. Avi-Itzhak,
On the twin measure and queueing systems predictability,
Performance Evaluation 65 (2009), pp. 839-853,
(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. 757-763.
(review
by T. Dayar, ACM Computing Reviews, December 17, 2008, CR 136354)
-
A. Holt,
Network Performance Analysis: Using the J Programming Language,
Springer-Verlag, 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.190-212.
(review
by T. Dayar, AMS Mathematical Reviews, 25 May 2007, MR2218949)
-
J. Jahn,
Multiobjective Search Algorithm with Subdivision Technique,
Combinatorial Optimization 35 (2006), pp.161-175.
(review
by T. Dayar, ACM Computing Reviews, May 11, 2007, CR 134256)
-
G. Tsitsiashvili, M. Osipova,
Probability Distribution in Varying-Structure Queueing Networks,
Problems of Information Transmission 42 (2006), pp.158-165.
(review
by T. Dayar, ACM Computing Reviews, November 10, 2006, CR 133546)
-
T. Hagras, J. Janecek,
A High Performance, Low Complexity Algorithm for Compile-Time Task Scheduling
in Heterogeneous Systems,
Parallel Computing 31 (2005), pp.653-670.
(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.325-329.
(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.63-79.
(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.1859-1868.
(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.777-787.
(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 reduced-rank approximations to sparse matrices,
ACM Transactions on Mathematical Software 31 (2005), pp.252-269.
(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 4-6, 2005, pp.391-402.
(review
by T. Dayar, ACM Computing Reviews, July 1, 2005, CR 131443)
-
A. Lakshmikantha, C. Beck, and R. Srikant,
Robustness of real and virtual queue-based active queue management schemes,
IEEE/ACM Transactions on Networking 13 (2005), pp.81-93.
(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
- Jean-Michele Fourneau
- Erol Gelenbe
- Ugur Gudukbay
- Wael Gueaieb
- Attila Gursoy
- Oleg Gusak
- Holger Hermanns
- Ezhan Karasan
- Ibrahim Korpeoglu
- 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
- Jean-Marc 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