Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
76 | Zhe Feng 0002, Yu Hu 0002, Tong Jing, Xianlong Hong, Xiaodong Hu 0001, Guiying Yan |
An O(nlogn) algorithm for obstacle-avoiding routing tree construction in the lambda-geometry plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2006 International Symposium on Physical Design, ISPD 2006, San Jose, California, USA, April 9-12, 2006, pp. 48-55, 2006, ACM, 1-59593-299-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
?-geometry, O(nlogn), Steiner tree construction, obstacle-avoiding |
63 | Krister M. Swenson, Vaibhav Rajan, Yu Lin 0001, Bernard M. E. Moret |
Sorting Signed Permutations by Inversions in O(nlogn) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Research in Computational Molecular Biology, 13th Annual International Conference, RECOMB 2009, Tucson, AZ, USA, May 18-21, 2009. Proceedings, pp. 386-399, 2009, Springer, 978-3-642-02007-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
47 | Po-Kai Huang, Cheng-Shang Chang, Jay Cheng, Duan-Shin Lee |
Recursive Constructions of Parallel FIFO and LIFO Queues With Switched Delay Lines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(5), pp. 1778-1798, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Markus Holzer 0001, Andreas Maletti |
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings, pp. 4-13, 2009, Springer, 978-3-642-02978-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
40 | JingBo Ni, Pascal Matsakis |
Force histograms computed in O(NlogN). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR ![In: 19th International Conference on Pattern Recognition (ICPR 2008), December 8-11, 2008, Tampa, Florida, USA, pp. 1-4, 2008, IEEE Computer Society, 978-1-4244-2175-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Jieyi Long, Hai Zhou 0001, Seda Ogrenci Memik |
An O(nlogn) edge-based algorithm for obstacle-avoiding rectilinear steiner tree construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPD ![In: Proceedings of the 2008 International Symposium on Physical Design, ISPD 2008, Portland, Oregon, USA, April 13-16, 2008, pp. 126-133, 2008, ACM, 978-1-60558-048-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minimum terminal spanning tree, spanning graph, routing, physical design, steiner tree |
40 | Deok-Soo Kim, Byunghoon Lee, Cheol-Hyung Cho, Kokichi Sugihara |
Plane-Sweep Algorithm of O(nlogn) for the Inclusion Hierarchy among Circles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part III, pp. 53-61, 2004, Springer, 3-540-22057-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Song Chen 0001, Xianlong Hong, Sheqin Dong, Yuchun Ma, Yici Cai, Chung-Kuan Cheng, Jun Gu |
Evaluating a bounded slice-line grid assignment in O(nlogn) time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (4) ![In: Proceedings of the 2003 International Symposium on Circuits and Systems, ISCAS 2003, Bangkok, Thailand, May 25-28, 2003, pp. 708-711, 2003, IEEE, 0-7803-7761-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
40 | Y. Daniel Liang, Glenn K. Manacher |
An O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the ACM 21th Conference on Computer Science, CSC '93, Indianapolis, IN, USA, February 16-18, 1993, pp. 390-397, 1993, ACM, 0-89791-558-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
35 | Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao |
Minkowski Sum Selection and Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 460-471, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Bioinformatics, Sequence analysis, Minkowski sum |
35 | Kuen-Lin Yu, Chung-Shou Liao, D. T. Lee |
Maximizing the Number of Independent Labels in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings, pp. 136-147, 2007, Springer, 978-3-540-73813-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Kazuo Iwama, Hiroki Morizumi |
Reductions for Monotone Boolean Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 540-548, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Murali K. Ganapathy |
Robust Mixing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 351-362, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Cuixiang Zhong, Guo-qiang Han, Minghe Huang |
Some New Parallel Fast Fourier Transform Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDCAT ![In: Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2005), 5-8 December 2005, Dalian, China, pp. 624-628, 2005, IEEE Computer Society, 0-7695-2405-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Michael Clausen, Meinard Müller |
A Fast Program Generator of Fast Fourier Transforms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 13th International Symposium, AAECC-13, Honolulu, Hawaii, USA, November 15-19, 1999, Proceedings, pp. 29-42, 1999, Springer, 3-540-66723-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Mohammad Khalid Imam Rahmani |
Rahmani Sort: A Novel Variant of Insertion Sort Algorithm with O(nlogn) Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.19107, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
28 | Yijie Han, Mishra Sneha, Md Usman Gani Syed |
An NC Algorithm for Sorting Real Numbers in O(nlogn/√loglogn) Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CATA ![In: Proceedings of 34th International Conference on Computers and Their Applications, CATA 2019, Honolulu, Hawaii, USA, March 18-20, 2019., pp. 93-98, 2019, EasyChair. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Morteza Hosseini, Mark Horton, Hiren Paneliya, Utteja Kallakuri, Houman Homayoun, Tinoosh Mohsenin |
On the Complexity Reduction of Dense Layers from O(N2) to O(NlogN) with Cyclic Sparsely Connected Layers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 56th Annual Design Automation Conference 2019, DAC 2019, Las Vegas, NV, USA, June 02-06, 2019, pp. 203, 2019, ACM, 978-1-4503-6725-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
28 | Robert Hildebrand, Matthias Köppe |
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity 2O(nlogn). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 10(1), pp. 69-84, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
28 | Md. Mahbubul Hasan, Md. Shahjalal, M. Kaykobad |
An in-place heapsort algorithm requiring nlogn+nlog*n-0.546871n comparisons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. ![In: Int. J. Comput. Math. 88(16), pp. 3350-3360, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
28 | Peter O. Fedichev, E. G. Getmantsev, L. I. Menshikov |
O(NlogN) Continuous electrostatics method for fast calculation of solvation energies of biomolecules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Chem. ![In: J. Comput. Chem. 32(7), pp. 1368-1376, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
28 | Markus Holzer 0001, Andreas Maletti |
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 411(38-39), pp. 3404-3413, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
28 | Krister M. Swenson, Vaibhav Rajan, Yu Lin 0001, Bernard M. E. Moret |
Sorting Signed Permutations by Inversions in O(nlogn) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Biol. ![In: J. Comput. Biol. 17(3), pp. 489-501, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
28 | Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman |
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, pp. 161-166, 2010, Springer, 978-3-642-11439-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
28 | Marc Mörig, Dieter Rautenbach, Michiel H. M. Smid, Jan Tusch |
An Omega(nlogn) lower bound for computing the sum of even-ranked elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 109(16), pp. 955-956, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Olga Gluchshenko, Horst W. Hamacher, Arie Tamir |
An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 37(3), pp. 168-170, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Muhammad Rezaul Karim 0001, Md. Jawaherul Alam, Md. Saidur Rahman 0001 |
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 310-321, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Label-Constrained Outerplanar Graph, Grid Drawing, Planar Graph, Outerplanar Graph, Dual Graph, Straight-Line Drawing |
28 | Robert L. Scot Drysdale, Asish Mukhopadhyay |
An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 105(2), pp. 47-51, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Gerth Stølting Brodal, Loukas Georgiadis, Irit Katriel |
An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 36(1), pp. 14-18, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Joong Chae Na, Kunsoo Park |
Alphabet-independent linear-time construction of compressed suffix arrays using o(nlogn)-bit working space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 385(1-3), pp. 127-136, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Zeshan Peng, Hing-Fung Ting |
An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 100(4), pp. 137-144, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Sarit Shwartz, Michael Zibulevsky, Yoav Y. Schechner |
ICA Using Kernel Entropy Estimation with NlogN Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA ![In: Independent Component Analysis and Blind Signal Separation, Fifth International Conference, ICA 2004, Granada, Spain, September 22-24, 2004, Proceedings, pp. 422-429, 2004, Springer, 3-540-23056-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Sergei Bespamyatnikh |
An O(nlogn) algorithm for the zoo-keeper's problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Geom. ![In: Comput. Geom. 24(2), pp. 63-74, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Weiping Shi, Zhuo Li 0001 |
An O(nlogn) time algorithm for optimal buffer insertion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 40th Design Automation Conference, DAC 2003, Anaheim, CA, USA, June 2-6, 2003, pp. 580-585, 2003, ACM, 1-58113-688-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
routing, data structure, buffer insertion, Elmore delay |
28 | Sigang Qiu, Feng Zhou, Phyllis E. Crandall |
Discrete Gabor transforms with complexity O (NlogN). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Signal Process. ![In: Signal Process. 77(2), pp. 159-170, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Jin-Tai Yan, Pei-Yung Hsiao |
An O(NlogN) Algorithm for Region Definition Using Channels/Switchboxes and Ordering Assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: VLSI Design 4(1), pp. 11-16, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
28 | Michael S. Warren, John K. Salmon |
An O(NlogN) hypercube N-body integrator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
C³P ![In: Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications - Architecture, Software, Computer Systems, and General Issues, C³P, Pasadena, California, USA, January 19-20, 1988, pp. 971-975, 1988, ACM, 978-0-89791-278-5. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
28 | Angela Y. Wu, S. K. Bhaskar, Azriel Rosenfeld |
Computation of geometric properties from the medial axis transform in (O(nlogn) time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Vis. Graph. Image Process. ![In: Comput. Vis. Graph. Image Process. 34(1), pp. 76-92, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
28 | Sanjay Dhar, Mark A. Franklin, Donald F. Wann |
Timing Control of VLSI Based NlogN and Crossbar Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP ![In: International Conference on Parallel Processing, ICPP'83, Columbus, Ohio, USA, August 1983, pp. 59-64, 1983, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP BibTeX RDF |
|
23 | Hee-Kap Ahn, Sang Won Bae, Sang-Sub Kim 0001, Matias Korman, Iris Reinbacher, Wanbin Son |
Square and Rectangle Covering with Outliers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings, pp. 132-140, 2009, Springer, 978-3-642-02269-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Masaki Yamamoto 0001, Shuji Kijima, Yasuko Matsui |
A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 328-337, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Jens Jägersküpper |
A Blend of Markov-Chain and Drift Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN X, 10th International Conference Dortmund, Germany, September 13-17, 2008, Proceedings, pp. 41-51, 2008, Springer, 978-3-540-87699-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Kooshiar Azimian, Mario Szegedy |
Parallel Repetition of the Odd Cycle Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 676-686, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
two prover games, CHSH, parallel repetition |
23 | Xianchao Zhang 0001, Weifa Liang, Guoliang Chen 0001 |
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 577-586, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Jianxing Feng, Daming Zhu |
Faster algorithms for sorting by transpositions and sorting by block interchanges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(3), pp. 25, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Block interchange, tree, time complexity, permutation, genome, transposition |
23 | James P. Mammen, Devavrat Shah |
Throughput and Delay in Random Wireless Networks With Restricted Mobility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(3), pp. 1108-1116, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Vartika Bhandari, Nitin H. Vaidya |
Capacity of multi-channel wireless networks with random (c, f) assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2007, Montreal, Quebec, Canada, September 9-14, 2007, pp. 229-238, 2007, ACM, 978-1-59593-684-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
random (c, f) assignment, switching constraints, wireless networks, capacity, multiple channels |
23 | Tao Wang, Zhoujun Li, Yuejin Yan, Huowang Chen |
An Incremental Fuzzy Decision Tree Classification Method for Mining Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MLDM ![In: Machine Learning and Data Mining in Pattern Recognition, 5th International Conference, MLDM 2007, Leipzig, Germany, July 18-20, 2007, Proceedings, pp. 91-103, 2007, Springer, 978-3-540-73498-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Threaded Binary Search Tree, Data Streams, Fuzzy, Incremental, Continuous Attribute |
23 | Zhoujun Li 0001, Tao Wang, Ruoxue Wang, Yuejin Yan, Huowang Chen |
A New Fuzzy Decision Tree Classification Method for Mining High-Speed Data Streams Based on Binary Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings, pp. 216-227, 2007, Springer, 978-3-540-73813-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
VFDT, Data Streams, Fuzzy, Binary Search Tree, Continuous Attribute |
23 | Tao Wang, Zhoujun Li 0001, Xiaohua Hu 0001, Yuejin Yan, Huowang Chen |
A New Decision Tree Classification Method for Mining High-Speed Data Streams Based on Threaded Binary Search Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD Workshops ![In: Emerging Technologies in Knowledge Discovery and Data Mining, PAKDD 2007, International Workshops, Nanjing, China, May 22-25, 2007, Revised Selected Papers, pp. 256-267, 2007, Springer, 978-3-540-77016-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
VFDT, Threaded Binary Search Tree, Data Streams, Continuous Attribute |
23 | Fredrik Manne, Qin Xin 0001 |
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAN ![In: Combinatorial and Algorithmic Aspects of Networking, Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers, pp. 125-134, 2006, Springer, 3-540-48822-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Centralized radio networks, randomized schedule, gossiping |
23 | Jianxing Feng, Daming Zhu |
Faster Algorithms for Sorting by Transpositions and Sorting by Block-Interchanges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, pp. 128-137, 2006, Springer, 3-540-34021-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Josiah Carlson, David Eppstein |
The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings, pp. 400-410, 2006, Springer, 3-540-35753-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Philipp Woelfel |
Maintaining External Memory Efficient Hash Tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 508-519, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Weiping Shi, Zhuo Li 0001 |
A fast algorithm for optimal buffer insertion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 24(6), pp. 879-891, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Rahul Shukla, Pier Luigi Dragotti, Minh N. Do, Martin Vetterli |
Rate-distortion optimized tree-structured compression algorithms for piecewise polynomial images. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Image Process. ![In: IEEE Trans. Image Process. 14(3), pp. 343-359, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Aaron Block, James H. Anderson |
Task Reweighting on Multiprocessors: Efficiency versus Accuracy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), CD-ROM / Abstracts Proceedings, 4-8 April 2005, Denver, CO, USA, 2005, IEEE Computer Society, 0-7695-2312-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Jason Cong, Sung Kyu Lim |
Edge separability-based circuit clustering with application to multilevel circuit partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(3), pp. 346-357, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder |
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mob. Networks Appl. ![In: Mob. Networks Appl. 9(2), pp. 141-149, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
distributed algorithm, wireless ad hoc networks, spanning tree, leader election, connected dominating set, independent set |
23 | Xuerong Feng, Z. Meng, Ivan Hal Sudborough |
Improved Upper Bound for Sorting by Short Swaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2004), 10-12 May 2004, Hong Kong, SAR, China, pp. 98-103, 2004, IEEE Computer Society, 0-7695-2135-5. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Sarnath Ramnath |
New approximations for the rectilinear Steiner arborescence problem [VLSI layout]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(7), pp. 859-869, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Ray-I Chang, Meng Chang Chen, Ming-Tat Ko, Jan-Ming Ho |
Optimal Bandwidth-Buffer Trade-Off for VBR Media Transmission over Multiple Relay-Servers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMCS, Vol. 2 ![In: IEEE International Conference on Multimedia Computing and Systems, ICMCS 1999, Florence, Italy, June 7-11, 1999. Volume II, pp. 31-35, 1999, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Palash Sarkar 0001, Bimal K. Roy, Pabitra Pal Choudhury |
VLSI Implementation of Modulo Multiplication Using Carry Free Addition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 10th International Conference on VLSI Design (VLSI Design 1997), 4-7 January 1997, Hyderabad, India, pp. 457-460, 1997, IEEE Computer Society, 0-8186-7755-4. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Hazel Everett, Jean-Marc Robert 0001, Marc J. van Kreveld |
An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, CA, USA, May 19-21, 1993, pp. 38-46, 1993, ACM, 0-89791-582-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
23 | Ke Qiu 0001, Henk Meijer, Selim G. Akl |
Parallel Routing and Sorting of the Pancake Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'91, International Conference on Computing and Information, Ottawa, Canada, May 27-29, 1991, Proceedings, pp. 360-371, 1991, Springer, 3-540-54029-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
23 | Victor Y. Pan, John H. Reif |
On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings, pp. 612-625, 1990, Springer, 3-540-52826-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
23 | Tung-Hsin Su, Ruei-Chuan Chang |
The K-Gabriel Graphs and Their Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGAL International Symposium on Algorithms ![In: Algorithms, International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990, Proceedings, pp. 66-75, 1990, Springer, 3-540-52921-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
23 | David Eppstein |
Finding the k Smallest Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings, pp. 38-47, 1990, Springer, 3-540-52846-6. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
23 | Subhas C. Nandy, Bhargab B. Bhattacharya, Sibabrata Ray |
Efficient algorithms for Identifying All Maximal Isothetic Empty Rectangles in VLSI Layout Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings, pp. 255-269, 1990, Springer, 3-540-53487-3. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
interval trees, complexity, Computational geometry, placement, VLSI layout, geometric algorithms |
23 | Paul G. Spirakis, Basil Tampakas, Athanasios Tsiolis |
Symmetry Breaking in Asynchronous Rings with O(n) Messages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WDAG ![In: Distributed Algorithms, 3rd International Workshop, Nice, France, September 26-28, 1989, Proceedings, pp. 233-241, 1989, Springer, 3-540-51687-5. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
23 | Charles R. Bonapace, Chi-Yuan Lo |
An O(nlogm) Algorithm for VLSI Design Rule Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 26th ACM/IEEE Design Automation Conference, Las Vegas, Nevada, USA, June 25-29, 1989., pp. 503-507, 1989, ACM Press. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
23 | Sanjiv Kapoor, S. N. Maheshwari |
Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fourth Annual Symposium on Computational Geometry, Urbana-Champaign, IL, USA, June 6-8, 1988, pp. 172-182, 1988, ACM, 0-89791-270-5. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
23 | Akira Ito, Katsushi Inoue, Itsuo Takanami |
The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMYCS ![In: Machines, Languages, and Complexity, 5th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 14-18, 1988, Proceedings, pp. 92-101, 1988, Springer, 3-540-51516-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
23 | Panagiotis Alevizos, Jean-Daniel Boissonnat, Mariette Yvinec |
An Optimal O(n log n) Algorithm for Contour Reconstruction from Rays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Third Annual Symposium on Computational Geometry, Waterloo, Ontario, Canada, June 8-10, 1987, pp. 162-170, 1987, ACM, 0-89791-231-4. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
12 | A. Prasad Sistla, Ouri Wolfson, Bo Xu 0001, Naphtali Rishe |
Answer-pairs and processing of continuous nearest-neighbor queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOMC ![In: FOMC'11, The Seventh ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing (part of FCRC 2011), San Jose, CA, USA, June 9, 2011, Proceedings, pp. 16-24, 2011, ACM, 978-1-4503-0779-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
12 | Shlomi Dolev, Nir Tzachar |
Spanders: distributed spanning expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 1309-1314, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
self-orgenization, self-stabilization, expanders |
12 | Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, Stephane Durocher, Meng He 0001, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson, Alejandro Salinger, Matthew Skala |
Untangled Monotonic Chains and Adaptive Range Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 203-212, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Colin Cooper, Alan M. Frieze |
The cover time of random geometric graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 48-57, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann |
Fast RNA Structure Alignment for Crossing Input Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings, pp. 236-248, 2009, Springer, 978-3-642-02440-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
sequence structure alignment, simultaneous alignment and folding, RNA |
12 | Haim Kaplan, Yahav Nussbaum |
Maximum Flow in Directed Planar Graphs with Vertex Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 397-407, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid |
Geometric Spanners for Weighted Point Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 190-202, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Brigitte Vallée, Julien Clément 0001, James Allen Fill, Philippe Flajolet |
The Number of Symbol Comparisons in QuickSort and QuickSelect. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 750-763, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Rachid Guerraoui, Eric Ruppert |
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, pp. 484-495, 2009, Springer, 978-3-642-02929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Alberto Ochoa 0003, María Beatríz Bernábe Loranca, Omar Ochoa |
A Complex Networks Approach to Demographic Zonification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICAI ![In: MICAI 2009: Advances in Artificial Intelligence, 8th Mexican International Conference on Artificial Intelligence, Guanajuato, Mexico, November 9-13, 2009. Proceedings, pp. 177-188, 2009, Springer, 978-3-642-05257-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Serdar Boztas, Simon J. Puglisi, Andrew Turpin |
Testing Stream Ciphers by Finding the Longest Substring of a Given Density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACISP ![In: Information Security and Privacy, 14th Australasian Conference, ACISP 2009, Brisbane, Australia, July 1-3, 2009, Proceedings, pp. 122-133, 2009, Springer, 978-3-642-02619-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Karthik S. Gurumoorthy, Anand Rangarajan 0001 |
A Schrödinger Equation for the Fast Computation of Approximate Euclidean Distance Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSVM ![In: Scale Space and Variational Methods in Computer Vision, Second International Conference, SSVM 2009, Voss, Norway, June 1-5, 2009. Proceedings, pp. 100-111, 2009, Springer, 978-3-642-02255-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen |
LPF Computation Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 158-169, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
longest previous factor, Ziv-Lempel factorisation, detection of repetitions, suffix array, text compression |
12 | K. Subramani 0001, Kamesh Madduri |
Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 186-196, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang 0001 |
Variable-Size Rectangle Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 145-154, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Hengwu Li |
Approximation algorithm and scheme for RNA structure prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIS ![In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (ICIS 2009), Seoul, Korea, 24-26 November 2009, pp. 1364-1367, 2009, ACM, 978-1-60558-710-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithm, approximation scheme, RNA structure, pseudoknot |
12 | Jieyi Long, Hai Zhou 0001, Seda Ogrenci Memik |
EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(12), pp. 2169-2182, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
12 | Hiroki Morizumi, Genki Suzuki |
Negation-Limited Inverters of Linear Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 605-614, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
12 | Ludmila Scharf, Marc Scherfenberg |
Inducing Polygons of Line Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 507-519, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
12 | Zeyu Guo 0001, He Sun 0001, Hong Zhu 0004 |
Greedy Construction of 2-Approximation Minimum Manhattan Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 4-15, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Minimum Manhattan Network, greedy strategy, approximation algorithm |
12 | Risto Honkanen |
Scheduled Routing in an Optical Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPDC ![In: 7th International Symposium on Parallel and Distributed Computing (ISPDC 2008), 1-5 July 2008, Krakow, Poland, pp. 300-305, 2008, IEEE Computer Society, 978-0-7695-3472-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
12 | Tapio Elomaa, Petri Lehtinen, Matti Saarela |
Obtaining Low-Arity Discretizations from Online Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 17th International Symposium, ISMIS 2008, Toronto, Canada, May 20-23, 2008, Proceedings, pp. 90-99, 2008, Springer, 978-3-540-68122-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
12 | John Z. Zhang, Tsunehiko Kameda |
A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings, pp. 502-513, 2008, Springer, 978-3-540-79227-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
12 | Trong Duc Le, Hyunseung Choo |
Efficient Flooding Scheme Based on 2-Hop Backward Information in Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2008, Beijing, China, 19-23 May 2008, pp. 2443-2447, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
12 | Stefan Felsner, Martin Pergel |
The Complexity of Sorting with Networks of Stacks and Queues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 417-429, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
12 | Maria Cristina Tugurlan, Blaise Bourdin |
Distributed fast marching methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mardi Gras Conference ![In: Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities, Baton Rouge, Louisiana, USA, January 29 - February 3, 2008, pp. 29, 2008, ACM, 978-1-59593-835-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|