|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1416 occurrences of 795 keywords
|
|
|
Results
Found 3177 publication records. Showing 3177 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
111 | Yen-Chun Lin, Yao-Hsien Hsu, Chun-Keng Liu |
Constructing H4, a Fast Depth-Size Optimal Parallel Prefix Circuit. |
J. Supercomput. |
2003 |
DBLP DOI BibTeX RDF |
depth-size optimal, prefix circuits, size optimal, parallel algorithms, depth, fan-out |
96 | Yen-Chun Lin, Li-Ling Hung |
Straightforward construction of depth-size optimal, parallel prefix circuits with fan-out 2. |
ACM Trans. Design Autom. Electr. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Depth-size optimal, parallel prefix circuits, fan-out |
90 | Hitesh Ballani, Paul Francis, Xinyang Zhang |
A study of prefix hijacking and interception in the internet. |
SIGCOMM |
2007 |
DBLP DOI BibTeX RDF |
hijacking, routing, BGP, interception |
89 | Haibin Lu, Kun Suk Kim, Sartaj K. Sahni |
Prefix and Interval-Partitioned Dynamic IP Router-Tables. |
IEEE Trans. Computers |
2005 |
DBLP DOI BibTeX RDF |
dynamic router-tables, prefix partitioning, interval partitioning, Packet routing, longest-prefix matching |
82 | Mitsuho Tahara, Naoki Tateishi, Toshio Oimatsu, Souhei Majima |
A Method to Detect Prefix Hijacking by Using Ping Tests. |
APNOMS |
2008 |
DBLP DOI BibTeX RDF |
Prefix Hijacking, Ping Test, Border Gateway Protocol (BGP) |
82 | Ruy Luiz Milidiú, Eduardo Sany Laber |
Bounding the Inefficiency of Length-Restricted Prefix Codes. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
Huffman trees, Approximative algorithm, Compression, Redundancy, Prefix codes |
82 | Yen-Chun Lin, Chao-Cheng Shih |
A New Class of Depth-Size Optimal Parallel Prefix Circuits. |
J. Supercomput. |
1999 |
DBLP DOI BibTeX RDF |
depth-size optimal, unbounded fan-out, VLSI, Combinational circuits, parallel prefix |
78 | Na Wang, Yingjian Zhi, Binqiang Wang |
AT: An Origin Verification Mechanism Based on Assignment Track for Securing BGP. |
ICC |
2008 |
DBLP DOI BibTeX RDF |
|
77 | Fernando Sanchez, Zhenhai Duan |
Region-based BGP announcement filtering for improved BGP security. |
AsiaCCS |
2010 |
DBLP DOI BibTeX RDF |
BGP security, network prefix hijacking, BGP |
76 | Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp |
Prefix Reversals on Binary and Ternary Strings. |
AB |
2007 |
DBLP DOI BibTeX RDF |
|
75 | Yaping Zhu, Jennifer Rexford, Subhabrata Sen, Aman Shaikh |
Impact of prefix-match changes on IP reachability. |
Internet Measurement Conference |
2009 |
DBLP DOI BibTeX RDF |
ip reachability, longest-matching prefix, bgp |
75 | Taeko Matsunaga, Yusuke Matsunaga |
Area minimization algorithm for parallel prefix adders under bitwise delay constraints. |
ACM Great Lakes Symposium on VLSI |
2007 |
DBLP DOI BibTeX RDF |
arithmetic synthesis, dynamic programming, parallel prefix adder |
75 | Haikun Zhu, Chung-Kuan Cheng, Ronald L. Graham |
On the construction of zero-deficiency parallel prefix circuits with minimum depth. |
ACM Trans. Design Autom. Electr. Syst. |
2006 |
DBLP DOI BibTeX RDF |
Zero-deficiency, depth-size trade-off, parallel prefix circuits |
70 | Daniel Panario, L. Bruce Richmond |
Smallest Components in Decomposable Structures: Exp-Log Class. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
Huffman trees, Approximative algorithm, Compression, Redundancy, Prefix codes |
70 | Thomas Eiter, Yuri Gurevich, Georg Gottlob |
Existential second-order logic over strings. |
J. ACM |
2000 |
DBLP DOI BibTeX RDF |
S1S, existential fragment, finite satisfiability, finite words, prefix classes, model checking, strings, regular languages, descriptive complexity, finite model theory, decision problem, NP, second-order logic |
69 | Haikun Zhu, Chung-Kuan Cheng, Ronald L. Graham |
Constructing zero-deficiency parallel prefix adder of minimum depth. |
ASP-DAC |
2005 |
DBLP DOI BibTeX RDF |
|
68 | Junghwan Kim, Jinsoo Kim 0002 |
Scheduling of Updates in an IP Forwarding Engine with Partitioned Prefix Tables. |
ICCSA (2) |
2008 |
DBLP DOI BibTeX RDF |
update scheduling, partitioned prefix tables, IP address lookup |
68 | Yen-Chun Lin, Jun-Wei Hsiao |
A New Approach to Constructing Optimal Prefix Circuits with Small Depth. |
ISPAN |
2002 |
DBLP DOI BibTeX RDF |
depth-size optimal, prefix circuits, parallel algorithms, fan-out |
68 | Jianhua Liu, Yi Zhu 0002, Haikun Zhu, Chung-Kuan Cheng, John Lillis |
Optimum Prefix Adders in a Comprehensive Area, Timing and Power Design Space. |
ASP-DAC |
2007 |
DBLP DOI BibTeX RDF |
optimum prefix adders, static power consumptions, dynamic power consumptions, high-level synthesis, integer linear programming, buffer insertion, gate sizing, power models, ASIC designs, parallel prefix adder, binary adder |
64 | Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu |
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns. |
ICDM |
2002 |
DBLP DOI BibTeX RDF |
|
63 | Haibin Lu, Sartaj Sahni |
Enhanced Interval Trees for Dynamic IP Router-Tables. |
IEEE Trans. Computers |
2004 |
DBLP DOI BibTeX RDF |
Interval trees, router tables, highest-priority matching, dynamic rule-tables, rule insertion and deletion, packet classification, packet routing, longest-prefix matching |
62 | Bhadrachalam Chitturi, Ivan Hal Sudborough |
Bounding Prefix Transposition Distance for Strings and Permutations. |
HICSS |
2008 |
DBLP DOI BibTeX RDF |
|
62 | JooChul Lee, Hyoung-Jun Kim |
Implementation of Prefix Delegation Mechanism Using DHCPv6 Protocol. |
ACIS-ICIS |
2005 |
DBLP DOI BibTeX RDF |
|
62 | Jun (Jim) Xu, Jinliang Fan, Mostafa H. Ammar, Sue B. Moon |
Prefix-Preserving IP Address Anonymization: Measurement-Based Security Evaluation and a New Cryptography-Based Scheme. |
ICNP |
2002 |
DBLP DOI BibTeX RDF |
|
62 | Feng Zhou, Peter Kornerup |
Computing Moments by Prefix Sums. |
J. VLSI Signal Process. |
2000 |
DBLP DOI BibTeX RDF |
|
61 | Satendra Kumar Maurya, Lawrence T. Clark |
Low power fast and dense longest prefix match content addressable memory for IP routers. |
ISLPED |
2009 |
DBLP DOI BibTeX RDF |
content addressable memory (CAM), internet protocol (IP) routing, ternary content addressable memory (TCAM), longest prefix match |
61 | Seong-Cheol Hong, Hong-Taek Ju, James W. Hong |
IP Prefix Hijacking Detection Using Idle Scan. |
APNOMS |
2009 |
DBLP DOI BibTeX RDF |
IP Prefix Hijacking, Security, Routing, BGP |
61 | Kun Suk Kim, Sartaj Sahni |
IP Lookup By Binary Search On Prefix Length. |
ISCC |
2003 |
DBLP DOI BibTeX RDF |
router tables, binary search on length, dynamic programming, Packet routing, longest-prefix matching, controlled prefix expansion |
61 | Venkatachary Srinivasan, George Varghese |
Fast Address Lookups Using Controlled Prefix Expansion. |
ACM Trans. Comput. Syst. |
1999 |
DBLP DOI BibTeX RDF |
Internet address lookup, binary search on levels, expanded tries, multibit tries, router preformance, longest-prefix match, controlled prefix expansion |
56 | Sartaj Sahni, Kun Suk Kim |
An O(log n) Dynamic Router-Table Design. |
IEEE Trans. Computers |
2004 |
DBLP DOI BibTeX RDF |
Packet routing, longest matching prefix, red-black trees |
54 | Changxi Zheng, Lusheng Ji, Dan Pei, Jia Wang 0001, Paul Francis |
A light-weight distributed scheme for detecting ip prefix hijacks in real-time. |
SIGCOMM |
2007 |
DBLP DOI BibTeX RDF |
hijacking, routing, detection, BGP, interception |
54 | Xiaosong Ma, Vincent W. Freeh, Tao Yang, Sudharshan Vazhkudai, Tyler A. Simon, Stephen L. Scott |
Coupling prefix caching and collective downloads for remote dataset access. |
ICS |
2006 |
DBLP DOI BibTeX RDF |
|
54 | H. J. Sander Bruggink |
A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property. |
RTA |
2006 |
DBLP DOI BibTeX RDF |
|
54 | Zhiyong Liang, Ke Xu 0002, Jianping Wu |
A Scalable Parallel Lookup Framework Avoiding Longest Prefix Match. |
ICOIN |
2004 |
DBLP DOI BibTeX RDF |
|
54 | Dany Breslauer, Livio Colussi, Laura Toniolo |
On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). |
ESA |
1994 |
DBLP DOI BibTeX RDF |
|
54 | Paolo Baldan, Andrea Corradini 0001, Barbara König 0001, Stefan Schwoon |
McMillan's Complete Prefix for Contextual Nets. |
Trans. Petri Nets Other Model. Concurr. |
2008 |
DBLP DOI BibTeX RDF |
read arcs, complete finite prefix, verification, Petri nets, unfolding |
54 | Sarang Dharmapurikar, Praveen Krishnamurthy, David E. Taylor |
Longest prefix matching using bloom filters. |
IEEE/ACM Trans. Netw. |
2006 |
DBLP DOI BibTeX RDF |
computer networking, IP, Bloom filter, IP lookup, longest prefix Matching |
54 | Jie Wu 0001, Li Sheng 0001 |
Deadlock-Free Multicasting in Irregular Networks Using Prefix Routing. |
J. Supercomput. |
2005 |
DBLP DOI BibTeX RDF |
prefix routing, multicasting, multiprocessor systems, deadlock |
54 | Giorgos Dimitrakopoulos, Dimitris Nikolos |
High-Speed Parallel-Prefix VLSI Ling Adders. |
IEEE Trans. Computers |
2005 |
DBLP DOI BibTeX RDF |
parallel-prefix carry computation, computer arithmetic, VLSI design, Adders |
54 | Sarang Dharmapurikar, Praveen Krishnamurthy, David E. Taylor |
Longest prefix matching using bloom filters. |
SIGCOMM |
2003 |
DBLP DOI BibTeX RDF |
forwarding, IP lookup, longest prefix matching |
52 | Abdelghani Bellaachia, Iehab Al Rassan |
Efficiency of prefix and non-prefix codes in string matching over compressed databases on handheld devices. |
SAC |
2005 |
DBLP DOI BibTeX RDF |
compress, PDA, string matching, handheld, prefix code |
49 | Changqing Li, Tok Wang Ling, Jiaheng Lu, Tian Yu |
On reducing redundancy and improving efficiency of XML labeling schemes. |
CIKM |
2005 |
DBLP DOI BibTeX RDF |
XML, redundancy, query, labeling scheme |
49 | Haibin Lu, Sartaj K. Sahni |
A B-tree dynamic router-table design. |
ISCC |
2004 |
DBLP DOI BibTeX RDF |
|
49 | Rob J. van Glabbeek |
Axiomatizing Flat Iteration. |
CONCUR |
1997 |
DBLP DOI BibTeX RDF |
|
49 | Yongxi Cheng |
Generating Combinations by Three Basic Operations. |
J. Comput. Sci. Technol. |
2007 |
DBLP DOI BibTeX RDF |
generating combinations, prefix shifts, gray codes |
49 | Haibin Lu, Sartaj Sahni |
A B-Tree Dynamic Router-Table Design. |
IEEE Trans. Computers |
2005 |
DBLP DOI BibTeX RDF |
dynamic router-tables, highest-priority-range matching, nonintersecting ranges, B-trees, Packet routing, longest-prefix matching |
49 | Xianghui Hu, Bei Hua, Xinan Tang |
TrieC: A High-Speed IPv6 Lookup with Fast Updates Using Network Processor. |
ICESS |
2005 |
DBLP DOI BibTeX RDF |
IPv6 lookup, prefix expansion, routing, parallel programming, Network processor, embedded system design |
49 | Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick |
Existential second-order logic over graphs: Charting the tractability frontier. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
Existential second-order logic, graph constraints, prefix classes, graph coloring, NP-complete problems, finite model theory |
47 | Mohit Lad, Ricardo V. Oliveira, Beichuan Zhang 0001, Lixia Zhang 0001 |
Understanding Resiliency of Internet Topology against Prefix Hijack Attacks. |
DSN |
2007 |
DBLP DOI BibTeX RDF |
|
47 | Andrea Sattler-Klein |
Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
47 | Gesan Wang, Nian-Feng Tzeng |
Bounded prefix expansion and compression in support of fast TCAM updating. |
BROADNETS |
2007 |
DBLP DOI BibTeX RDF |
|
47 | Fong Pong, Nian-Feng Tzeng |
Storage-Efficient Architecture for Routing Tables via Prefix Transformation. |
LCN |
2007 |
DBLP DOI BibTeX RDF |
|
47 | Mohammad J. Akhbarizadeh, Mehrdad Nourani, Deepak S. Vijayasarathi, Poras T. Balsara |
PCAM: A Ternary CAM Optimized for Longest Prefix Matching Tasks. |
ICCD |
2004 |
DBLP DOI BibTeX RDF |
|
47 | Andrew Beaumont-Smith, Cheng-Chew Lim |
Parallel Prefix Adder Design. |
IEEE Symposium on Computer Arithmetic |
2001 |
DBLP DOI BibTeX RDF |
|
47 | Rudolf Bayer, Karl Unterauer |
Prefix B-Trees. |
ACM Trans. Database Syst. |
1977 |
DBLP DOI BibTeX RDF |
multiway search trees, B-trees, key compression |
47 | Yong-Geun Hong, Hyoung-Jun Kim, Joosang Youn, Younghyun Kim 0002, Sangheon Pack |
Dynamic home network prefix assignment for multi-homing in proxy mobile IPv6. |
IWCMC |
2010 |
DBLP DOI BibTeX RDF |
dynamic home network prefix assignment, interface handoff, multi-homing, proxy mobile IPv6 |
47 | T. Srinivasan 0001, D. Vijayalakshmi, A. A. Azeezunnisa |
PTSPM: A Novel PTS Based Prefix Matching Scheme with Reduced Collision for IPv6 Routers. |
CNSR |
2007 |
DBLP DOI BibTeX RDF |
Parallel Ternary Search, IPv6 address lookup, multiple ha shing, routing, controlled prefix expansion |
47 | Peter Sanders 0001, Jesper Larsson Träff |
Parallel Prefix (Scan) Algorithms for MPI. |
PVM/MPI |
2006 |
DBLP DOI BibTeX RDF |
MPI implementation, pipelining, collective communication, prefix sum, Cluster of SMPs |
47 | Haibin Lu, Sartaj Sahni |
Conflict detection and resolution in two-dimensional prefix router tables. |
IEEE/ACM Trans. Netw. |
2005 |
DBLP DOI BibTeX RDF |
filter conflict, two-dimensional prefix filters, packet classification |
47 | Neil Burgess |
New Models of Prefix Adder Topologies. |
J. VLSI Signal Process. |
2005 |
DBLP DOI BibTeX RDF |
prefix addition, absolute difference, VLSI, delay model, idempotency |
47 | Amitava Datta |
Multiple Addition and Prefix Sum on a Linear Array with a Reconfigurable Pipelined Bus System. |
J. Supercomput. |
2004 |
DBLP DOI BibTeX RDF |
pipelined bus, reconfigurable bus, matrix multiplication, addition, optical computing, prefix sum |
47 | Rong Lin, Koji Nakano, Stephan Olariu, Albert Y. Zomaya |
An Efficient Parallel Prefix Sums Architecture with Domino Logic. |
IEEE Trans. Parallel Distributed Syst. |
2003 |
DBLP DOI BibTeX RDF |
shift switching, binary prefix sums, binary counting, VLSI design, scalable architectures, domino logic, Hardware-algorithms |
47 | Adam L. Buchsbaum, Glenn S. Fowler, Balachander Krishnamurthy, Kiem-Phong Vo, Jia Wang 0001 |
Fast prefix matching of bounded strings. |
ACM J. Exp. Algorithmics |
2003 |
DBLP DOI BibTeX RDF |
prefix matching, tries, table look-up, IP routing |
47 | Alan A. Bertossi, Alessandro Mei |
A Residue Number System on Reconfigurable Mesh with Applications to Prefix Sums and Approximate String Matching. |
IEEE Trans. Parallel Distributed Syst. |
2000 |
DBLP DOI BibTeX RDF |
string matching with $k$ mismatches, VLSI, residue number system, reconfigurable mesh, prefix sums, Number representation |
47 | Rong Lin, Koji Nakano, Stephan Olariu, Maria Cristina Pinotti, James L. Schwing, Albert Y. Zomaya |
Scalable Hardware-Algorithms for Binary Prefix Sums. |
IEEE Trans. Parallel Distributed Syst. |
2000 |
DBLP DOI BibTeX RDF |
shift switching, binary prefix sums, binary counting, pipelining, scalable architectures, Hardware-algorithms |
47 | Robert Cremanns |
Prefix-Rewriting on Context-Free Groups. |
Appl. Algebra Eng. Commun. Comput. |
1997 |
DBLP DOI BibTeX RDF |
Context-free groups, Generalized word problem, Prefix-rewriting systems, Subgroups, String-rewriting systems |
47 | Mohammad J. Akhbarizadeh, Mehrdad Nourani, Cyrus D. Cantrell |
Prefix Segregation Scheme for a TCAM-Based IP Forwarding Engine. |
IEEE Micro |
2005 |
DBLP DOI BibTeX RDF |
IP Forwarding Engine, Prefix Segregation, Route Lookup Table, Internet Protocol, Ternary Content Addressable memory, Longest Matching Prefix |
47 | Marcel Waldvogel |
Multi-Dimensional Prefix Matching Using Line Search. |
LCN |
2000 |
DBLP DOI BibTeX RDF |
multidimensional prefix matching, filter database, 1D binary search, prefix lengths, transport header match, 5D IP, quality of service, quality of service, Internet, Internet, transport protocols, packet switching, Internet protocol, firewalls, search problems, QoS routing, telecommunication network routing, packet classification, VPN, virtual private networks, line search |
42 | Paula Severi, Fer-Jan de Vries |
Order Structures on Böhm-Like Models. |
CSL |
2005 |
DBLP DOI BibTeX RDF |
|
42 | Thomas Eiter, Georg Gottlob, Thomas Schwentick |
Second-Order Logic over Strings: Regular and Non-regular Fragments. |
Developments in Language Theory |
2001 |
DBLP DOI BibTeX RDF |
|
42 | Dongyang Long, Weijia Jia 0001 |
Optimal Maximal Encoding Different from Huffman Encoding. |
ITCC |
2001 |
DBLP DOI BibTeX RDF |
|
42 | J. Paul Myers Jr. |
Adaptive approaches to structural software testing (abstract only). |
ACM Conference on Computer Science |
1987 |
DBLP DOI BibTeX RDF |
|
42 | Xia Yin, Xin Wu, Zhiliang Wang |
Measuring IP Address Fragmentation from BGP Routing Dynamics. |
Infoscale |
2009 |
DBLP DOI BibTeX RDF |
Prefix Distance, Geographic Distance, BGP |
42 | Young-Koo Lee, Woong-Kee Loh, Yang-Sae Moon, Kyu-Young Whang, Il-Yeol Song |
An Efficient Algorithm for Computing Range-Groupby Queries. |
DASFAA |
2006 |
DBLP DOI BibTeX RDF |
range-groupby queries, prefix-sum arrays, data cubes, aggregation queries |
42 | S. M. Yong, Hong Tat Ewe |
Robust Routing Table Design for IPv6 Lookup. |
ICITA (1) |
2005 |
DBLP DOI BibTeX RDF |
longest prefix match (LPM), IP table lookup, IPv6 |
42 | Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung |
A Programming Methodology for Designing Block Recursive Algorithms on Various Computer Networks. |
ICPP Workshops |
2002 |
DBLP DOI BibTeX RDF |
block recursive algorithm, baseline network, parallel processing, hypercube network, omega network, tensor product, programming methodology, parallel prefix |
42 | Yen-Cheng Chen, Wen-Tsuen Chen, Gen-Huey Chen, Jang-Ping Sheu |
Designing Efficient Parallel Algorithms on Mech-Connected Computers with Multiple Broadcasting. |
IEEE Trans. Parallel Distributed Syst. |
1990 |
DBLP DOI BibTeX RDF |
mech-connected computers, 2-MCCMBs, parallel algorithms, parallel algorithms, computational complexity, parallel architectures, time complexity, multiprocessorinterconnection networks, prefix computations, prefix computations, multiple broadcasting, multiple broadcasting, semigroup computations |
40 | Moshe Malkin, Chan-Soo Hwang, John M. Cioffi |
Transmitter Precoding for Insufficient-Cyclic-Prefix Distortion in Multicarrier Systems. |
VTC Spring |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Taeko Matsunaga, Shinji Kimura, Yusuke Matsunaga |
Synthesis of parallel prefix adders considering switching activities. |
ICCD |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Zheng Zhang 0009, Ying Zhang 0022, Y. Charlie Hu, Zhuoqing Morley Mao |
Practical defenses against BGP prefix hijacking. |
CoNEXT |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Yibo Wang, Jun Li 0001 |
Is your IP address prefix well-served by internet routing? |
CoNEXT |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Yo-Sub Han, Yajun Wang, Derick Wood |
Prefix-Free Regular-Expression Matching. |
CPM |
2005 |
DBLP DOI BibTeX RDF |
|
40 | James E. Stine, Christopher R. Babb, Vibhuti B. Dave |
Constant addition utilizing flagged prefix structures. |
ISCAS (1) |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Giorgos Dimitrakopoulos, Pavlos Kolovos, P. Kalogerakis, Dimitris Nikolos |
Design of High-Speed Low-Power Parallel-Prefix VLSI Adders. |
PATMOS |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Kengo Nagahashi, Hiroshi Esaki, Jun Murai |
BGP Integrity Check for the Conflict Origin AS Prefix in the Inter-domain Routing. |
SAINT |
2003 |
DBLP DOI BibTeX RDF |
|
40 | Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter |
Prime Decompositions of Regular Prefix Codes. |
CIAA |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Marcel Waldvogel, George Varghese, Jonathan S. Turner, Bernhard Plattner |
Scalable high-speed prefix matching. |
ACM Trans. Comput. Syst. |
2001 |
DBLP DOI BibTeX RDF |
forwarding lookups, high-speed networking, collision resolution |
40 | Yeh-Ching Chung, Ching-Jung Liao, Don-Lin Yang |
A Prefix Code Matching Parallel Load-Balancing Method for Solution-Adaptive Unstructured Finite Element Graphs on Distributed Memory Multicomputers. |
J. Supercomput. |
2000 |
DBLP DOI BibTeX RDF |
solution-adaptive unstructured finite element models, load balancing, partitioning, mapping, distributed memory multicomputers, remapping |
40 | Venkatachary Srinivasan, George Varghese |
Faster IP Lookups Using Controlled Prefix Expansion. |
SIGMETRICS |
1998 |
DBLP DOI BibTeX RDF |
IP |
40 | Kuo-Liang Chung |
Prefix Computations on a Generalized Mesh-Connected Computer with Multiple Buses. |
IEEE Trans. Parallel Distributed Syst. |
1995 |
DBLP DOI BibTeX RDF |
|
40 | Leszek Gasieniec, Kunsoo Park |
Work-Time Optimal Parallel Prefix Matching (Extended Abstract). |
ESA |
1994 |
DBLP DOI BibTeX RDF |
|
40 | Véronique Bruyère |
On Maximal Prefix Sets of Words. |
MFCS |
1988 |
DBLP DOI BibTeX RDF |
|
40 | Ashok K. Chandra, Steven Fortune, Richard J. Lipton |
Lower Bounds for Constant Depth Circuits for Prefix Problems. |
ICALP |
1983 |
DBLP DOI BibTeX RDF |
|
40 | Ya-Chun Li, Tin Yu Wu, Wei-Tsong Lee, Yueh-Min Huang |
The promotion of WAVE contention performance by variable cyclic prefix mechanism. |
IWCMC |
2009 |
DBLP DOI BibTeX RDF |
CTS, RTS, cyclic prefix, CSMA/CA |
40 | Jin Hwan Park, H. K. Dai 0001 |
Reconfigurable hardware solution to parallel prefix computation. |
J. Supercomput. |
2008 |
DBLP DOI BibTeX RDF |
Parallel prefix computation, Field-programmable gate arrays, Pipeline, Dataflow, Reconfigurable hardware |
40 | Tsung-Han Tsai 0001, Chun-Nan Liu |
A Low-Latency Multi-layer Prefix Grouping Technique for Parallel Huffman Decoding of Multimedia Standards. |
J. Signal Process. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Prefix grouping, VLIW DSP processor, Multimedia, Parallel processing, Huffman coding |
40 | Jianlin Feng, Qiong Fang, Hulin Ding |
PrefixCube: prefix-sharing condensed data cube. |
DOLAP |
2004 |
DBLP DOI BibTeX RDF |
cuboid, prefix-sharing, prefixCube, OLAP, BST |
40 | Neil Burgess |
The Flagged Prefix Adder and its Applications in Integer Arithmetic. |
J. VLSI Signal Process. |
2002 |
DBLP DOI BibTeX RDF |
prefix adders, absolute difference, end-around carry, computer arithmetic |
40 | Lampros Kalampoukas, Dimitris Nikolos, Costas Efstathiou, Haridimos T. Vergos, John Kalamatianos |
High-Speed Parallel-Prefix Modulo 2n-1 Adders. |
IEEE Trans. Computers |
2000 |
DBLP DOI BibTeX RDF |
Modulo $2^n-1$ adders, VLSI design, parallel-prefix adders, carry look-ahead adders |
40 | Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough |
Embedding hypercubes into pancake, cycle prefix and substring reversal networks. |
HICSS (2) |
1995 |
DBLP DOI BibTeX RDF |
hypercube embedding, graph diameter, pancake network, burnt pancake network, cycle prefix network, substring reversal network, low dilation embeddings, graph theory, generators, hypercube networks, Cayley graphs, group theory, star network, symmetric group |
Displaying result #1 - #100 of 3177 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|