Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Cüneyt F. Bazlamaçci
2010 – today
- 2012
[j6]Oguzhan Erdem, Cüneyt F. Bazlamaçci: High-performance IP Lookup Engine with Compact Clustered Trie Search. Comput. J. 55(12): 1447-1466 (2012)- [j5]Fatih Say, Cüneyt F. Bazlamaçci: A reconfigurable computing platform for real time embedded applications. Microprocessors and Microsystems - Embedded Hardware Design 36(1): 13-32 (2012)
- [c4]Coskun Çelik, Cüneyt F. Bazlamaçci: Effect of Application Mapping on Network-on-Chip Performance. PDP 2012: 465-472
- 2011
- [c3]Oguzhan Erdem, Hoang Le, Viktor K. Prasanna, Cüneyt F. Bazlamaçci: Hybrid data structure for IP lookup in virtual routers using FPGAs. ASAP 2011: 95-102
- [c2]Oguzhan Erdem, Hoang Le, Viktor K. Prasanna, Cüneyt F. Bazlamaçci: Hybrid Data Structure for IP Lookup in Virtual Routers Using FPGAs. FCCM 2011: 253
- 2010
- [j4]Oguzhan Erdem, Cüneyt F. Bazlamaçci: Array Design for Trie-based IP Lookup. IEEE Communications Letters 14(8): 773-775 (2010)
2000 – 2009
- 2009
- [c1]Oguzhan Erdem, Cüneyt F. Bazlamaçci: MIPS extension for a TCAM based parallel architecture for fast IP lookup. ISCIS 2009: 310-315
- 2008
- [j3]Sertac Cinel, Cüneyt F. Bazlamaçci: A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem. IEEE Trans. on CAD of Integrated Circuits and Systems 27(11): 2083-2087 (2008)
- 2007
- [j2]Cüneyt F. Bazlamaçci, Fatih Say: Minimum concave cost multicommodity network design. Telecommunication Systems 36(4): 181-203 (2007)
- 2001
- [j1]Cüneyt F. Bazlamaçci, Khalil S. Hindi: Minimum-weight spanning tree algorithms A survey and empirical study. Computers & OR 28(8): 767-785 (2001)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-27 18:36 CET by the dblp team