Search results for "O(nlogn)"

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.	ISPD	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.	RECOMB	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.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
40	Markus Holzer 0001, Andreas Maletti	An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton.	CIAA	2009	DBLP DOI BibTeX RDF
40	JingBo Ni, Pascal Matsakis	Force histograms computed in O(NlogN).	ICPR	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.	ISPD	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.	ICCSA (3)	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.	ISCAS (4)	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.	ACM Conference on Computer Science	1993	DBLP DOI BibTeX RDF
35	Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao	Minkowski Sum Selection and Finding.	ISAAC	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.	FAW	2007	DBLP DOI BibTeX RDF
35	Kazuo Iwama, Hiroki Morizumi	Reductions for Monotone Boolean Circuits.	MFCS	2006	DBLP DOI BibTeX RDF
35	Murali K. Ganapathy	Robust Mixing.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
35	Cuixiang Zhong, Guo-qiang Han, Minghe Huang	Some New Parallel Fast Fourier Transform Algorithms.	PDCAT	2005	DBLP DOI BibTeX RDF
35	Michael Clausen, Meinard Müller	A Fast Program Generator of Fast Fourier Transforms.	AAECC	1999	DBLP DOI BibTeX RDF
28	Mohammad Khalid Imam Rahmani	Rahmani Sort: A Novel Variant of Insertion Sort Algorithm with O(nlogn) Complexity.	CoRR	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.	CATA	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.	DAC	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).	Discret. Optim.	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.	Int. J. Comput. Math.	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.	J. Comput. Chem.	2011	DBLP DOI BibTeX RDF
28	Markus Holzer 0001, Andreas Maletti	An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton.	Theor. Comput. Sci.	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.	J. Comput. Biol.	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.	WALCOM	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.	Inf. Process. Lett.	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.	Oper. Res. Lett.	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).	WALCOM	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.	Inf. Process. Lett.	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.	Oper. Res. Lett.	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.	Theor. Comput. Sci.	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.	Inf. Process. Lett.	2006	DBLP DOI BibTeX RDF
28	Sarit Shwartz, Michael Zibulevsky, Yoav Y. Schechner	ICA Using Kernel Entropy Estimation with NlogN Complexity.	ICA	2004	DBLP DOI BibTeX RDF
28	Sergei Bespamyatnikh	An O(nlogn) algorithm for the zoo-keeper's problem.	Comput. Geom.	2003	DBLP DOI BibTeX RDF
28	Weiping Shi, Zhuo Li 0001	An O(nlogn) time algorithm for optimal buffer insertion.	DAC	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).	Signal Process.	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.	VLSI Design	1996	DBLP DOI BibTeX RDF
28	Michael S. Warren, John K. Salmon	An O(NlogN) hypercube N-body integrator.	C³P	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.	Comput. Vis. Graph. Image Process.	1986	DBLP DOI BibTeX RDF
28	Sanjay Dhar, Mark A. Franklin, Donald F. Wann	Timing Control of VLSI Based NlogN and Crossbar Networks.	ICPP	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.	FAW	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.	COCOON	2009	DBLP DOI BibTeX RDF
23	Jens Jägersküpper	A Blend of Markov-Chain and Drift Analysis.	PPSN	2008	DBLP DOI BibTeX RDF
23	Kooshiar Azimian, Mario Szegedy	Parallel Repetition of the Odd Cycle Game.	LATIN	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.	COCOON	2008	DBLP DOI BibTeX RDF
23	Jianxing Feng, Daming Zhu	Faster algorithms for sorting by transpositions and sorting by block interchanges.	ACM Trans. Algorithms	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.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
23	Vartika Bhandari, Nitin H. Vaidya	Capacity of multi-channel wireless networks with random (c, f) assignment.	MobiHoc	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.	MLDM	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.	FAW	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.	PAKDD Workshops	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.	CAAN	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.	TAMC	2006	DBLP DOI BibTeX RDF
23	Josiah Carlson, David Eppstein	The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems.	SWAT	2006	DBLP DOI BibTeX RDF
23	Philipp Woelfel	Maintaining External Memory Efficient Hash Tables.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
23	Weiping Shi, Zhuo Li 0001	A fast algorithm for optimal buffer insertion.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	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.	IEEE Trans. Image Process.	2005	DBLP DOI BibTeX RDF
23	Aaron Block, James H. Anderson	Task Reweighting on Multiprocessors: Efficiency versus Accuracy.	IPDPS	2005	DBLP DOI BibTeX RDF
23	Jason Cong, Sung Kyu Lim	Edge separability-based circuit clustering with application to multilevel circuit partitioning.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	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.	Mob. Networks Appl.	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.	ISPAN	2004	DBLP DOI BibTeX RDF
23	Sarnath Ramnath	New approximations for the rectilinear Steiner arborescence problem [VLSI layout].	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	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.	ICMCS, Vol. 2	1999	DBLP DOI BibTeX RDF
23	Palash Sarkar 0001, Bimal K. Roy, Pabitra Pal Choudhury	VLSI Implementation of Modulo Multiplication Using Carry Free Addition.	VLSI Design	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.	SCG	1993	DBLP DOI BibTeX RDF
23	Ke Qiu 0001, Henk Meijer, Selim G. Akl	Parallel Routing and Sorting of the Pancake Network.	ICCI	1991	DBLP DOI BibTeX RDF
23	Victor Y. Pan, John H. Reif	On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid.	ICALP	1990	DBLP DOI BibTeX RDF
23	Tung-Hsin Su, Ruei-Chuan Chang	The K-Gabriel Graphs and Their Applications.	SIGAL International Symposium on Algorithms	1990	DBLP DOI BibTeX RDF
23	David Eppstein	Finding the k Smallest Spanning Trees.	SWAT	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.	FSTTCS	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.	WDAG	1989	DBLP DOI BibTeX RDF
23	Charles R. Bonapace, Chi-Yuan Lo	An O(nlogm) Algorithm for VLSI Design Rule Checking.	DAC	1989	DBLP DOI BibTeX RDF
23	Sanjiv Kapoor, S. N. Maheshwari	Efficient Algorithms for Euclidean Shortest Path and Visibility Problems with Polygonal Obstacles.	SCG	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.	IMYCS	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.	SCG	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.	FOMC	2011	DBLP DOI BibTeX RDF
12	Shlomi Dolev, Nir Tzachar	Spanders: distributed spanning expanders.	SAC	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.	ISAAC	2009	DBLP DOI BibTeX RDF
12	Colin Cooper, Alan M. Frieze	The cover time of random geometric graphs.	SODA	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.	CPM	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.	ESA	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.	ESA	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.	ICALP (1)	2009	DBLP DOI BibTeX RDF
12	Rachid Guerraoui, Eric Ruppert	Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures.	ICALP (2)	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.	MICAI	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.	ACISP	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.	SSVM	2009	DBLP DOI BibTeX RDF
12	Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen	LPF Computation Revisited.	IWOCA	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.	COCOA	2009	DBLP DOI BibTeX RDF
12	Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang 0001	Variable-Size Rectangle Covering.	COCOA	2009	DBLP DOI BibTeX RDF
12	Hengwu Li	Approximation algorithm and scheme for RNA structure prediction.	ICIS	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.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2008	DBLP DOI BibTeX RDF
12	Hiroki Morizumi, Genki Suzuki	Negation-Limited Inverters of Linear Size.	ISAAC	2008	DBLP DOI BibTeX RDF
12	Ludmila Scharf, Marc Scherfenberg	Inducing Polygons of Line Arrangements.	ISAAC	2008	DBLP DOI BibTeX RDF
12	Zeyu Guo 0001, He Sun 0001, Hong Zhu 0004	Greedy Construction of 2-Approximation Minimum Manhattan Network.	ISAAC	2008	DBLP DOI BibTeX RDF	Minimum Manhattan Network, greedy strategy, approximation algorithm
12	Risto Honkanen	Scheduled Routing in an Optical Hypercube.	ISPDC	2008	DBLP DOI BibTeX RDF
12	Tapio Elomaa, Petri Lehtinen, Matti Saarela	Obtaining Low-Arity Discretizations from Online Data Streams.	ISMIS	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.	TAMC	2008	DBLP DOI BibTeX RDF
12	Trong Duc Le, Hyunseung Choo	Efficient Flooding Scheme Based on 2-Hop Backward Information in Ad Hoc Networks.	ICC	2008	DBLP DOI BibTeX RDF
12	Stefan Felsner, Martin Pergel	The Complexity of Sorting with Networks of Stacks and Queues.	ESA	2008	DBLP DOI BibTeX RDF
12	Maria Cristina Tugurlan, Blaise Bourdin	Distributed fast marching methods.	Mardi Gras Conference	2008	DBLP DOI BibTeX RDF