CTAN Comprehensive TeX Archive Network

Search index

The search found 16 of 170 hits in 6ms.

Unicode-compatible index generation
Last modified in Catalogue: 2025-01-28 21:35
Document packages in a consistent way
Last modified in Catalogue: 2025-02-02 09:35
Name authority mechanism for consistency in body text and index
Last modified in Catalogue: 2025-02-06 09:35
A template for the University of Alberta
Last modified in Catalogue: 2025-02-22 07:35
Enhanced index typesetting
Last modified in Catalogue: 2025-03-05 06:35
PDF collection of typeset C/WEB sources in Live
Last modified in Catalogue: 2025-03-16 16:35
Unicode Collation Algorithm library for Lua
Last modified in Catalogue: 2025-04-01 07:35
templates of Technische Universität Darmstadt
Last modified in Catalogue: 2025-04-03 22:35
Typeset scholarly editions
Last modified in Catalogue: 2025-04-13 21:35
Converts to HTML
Last modified in Catalogue: 2025-04-23 12:35
Tools to load and manipulate data
Last modified in Catalogue: 2025-04-25 18:35
Displaying, hyperlinking, and indexing notions in a document
Last modified in Catalogue: 2025-05-10 08:35
Documentation for Mendex index processor
Last modified in Catalogue: 2025-05-10 13:35
Create glossaries and lists of acronyms
Last modified in Catalogue: 2025-05-15 07:35
Preprocessor for MusiX
Last modified in Catalogue: 2025-05-21 19:35
Typesetting music with
Last modified in Catalogue: 2025-05-21 19:35

Tips for the Search

TL;DR: the extended search tries to interprete some words and characters specially. This is not just Google.

The CTAN search provides some powerful features to express the query. You can use these features to get better results. Some of the features are described here. This feature list is by far not complete. It will be extended when required.

Prefix Search

The search term is split into words. The search engine finds the items containing all search terms at the beginning of words. The comparison is performed case-insensitive.

This is the same as adding the wildcard character * to the end of all words.

Word-based Search

The search term is split into words. The search engine finds the items containing all search terms as words. The order of the words just influences the order of the hits. The comparison is performed case-insensitive.

Wildcard Search

The meta-characters * and ? can be contained in the search term to denote an arbitrary number of characters and a single character respective.

bibtool*

Note that wildcards are not allowed at the beginning of a word.

Excluding words

Prefixing a word by - or NOT (in upper case) will exclude all hits for this word from the results.

sudoku -related

sudoku NOT related

Boolean Combinations

A boolean query can be formulated with the operators AND, OR, and NOT. Parentheses can be used to group sub-expressions.

tex AND NOT knuth

Fuzzy Search

If you are not sure about the spelling of your search you can initiate a fuzzy search. For this purpose append a ~ to the search word. This search also returns hits which are not literal matches but variations thereof.

bibtol~

Note that fuzzy search usually returns lots of hits. Thus be careful.

Guest Book Sitemap Contact Contact Author