Skip to search formSkip to main contentSkip to account menu

Directory (computing)

Known as: DNLC, 🖿, 🗀 
In computing, a directory is a file system cataloging structure which contains references to other computer files, and possibly other directories. On… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
CPANCache (computing)Cache coherenceCd (command)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
The journal coverage of Web of Science and Scopus: a comparative analysis
Bibliometric methods are used in multiple fields for a variety of purposes, namely for research evaluation. Most bibliometric… 
Review
2010
Review
2010
NWChem: A comprehensive and scalable open-source solution for large scale molecular simulations
Highly Cited
2009
Highly Cited
2009
Index Herbariorum: a global directory of public herbaria and associated staff. New York Botanical Garden's Virtual Herbarium.
Highly Cited
2003
Highly Cited
2003
Rserve A fast way to provide R functionality to applications
Rserve is a TCP/IP server which allows other programs to use facilities of R from various languages without the need to… 
Highly Cited
2003
Highly Cited
2003
Simulation of Ground Motion Using the Stochastic Method
Abstract — A simple and powerful method for simulating ground motions is to combine parametric or functional descriptions of the… 
Highly Cited
2001
Highly Cited
2001
The X-tree : An Index Structure for High-Dimensional Data
Highly Cited
2000
Highly Cited
2000
Summary cache: a scalable wide-area web cache sharing protocol
The sharing of caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks… 
Highly Cited
1998
Highly Cited
1998
Index Herbariorum: A global directory of public herbaria and associated staff
Highly Cited
1996
Highly Cited
1996
Bagging Predictors
Bagging predictors is a method for generating multiple versions of a predictor and using these to get an aggregated predictor… 
Highly Cited
1990
Highly Cited
1990
The R*-tree: an efficient and robust access method for points and rectangles
The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)