text:
Data Structures/Trees

Trees
A tree is a non-empty set with an element that is designated as the root of the tree while the remaining elements are partitioned into non-empty sets each of which is a subtree of the root.

Tree nodes have many useful properties. The depth of a node is the length of the path (or the number of edges) from the root to that node. The height of a node is the longest path from that node to its leaves. The height of a tree is the height of the root. A leaf node has no children—its only path is up to its parent.

See the axiomatic development of trees and its consequences for more information.

Types of trees:

Binary: Each node has zero, one, or two children. This assertion makes many tree operations simple and efficient.

Binary Search: A binary tree where any left child node has a value less than its parent node and any right child node has a value greater than or equal to that of its parent node.

Traversal
Many problems require we visit the nodes of a tree in a systematic way: tasks such as counting how many nodes exist or finding the maximum element. Three different methods are possible for binary trees: preorder, postorder, and in-order, which all do the same three things: recursively traverse both the left and right subtrees and visit the current node. The difference is when the algorithm visits the current node:

preorder: Current node, left subtree, right subtree (DLR)

postorder: Left subtree, right subtree, current node (LRD)

in-order: Left subtree, current node, right subtree (LDR)

levelorder: Level by level, from left to right, starting from the root node.

 * Visit means performing some operation involving the current node of a tree, like incrementing a counter or checking if the value of the current node is greater than any other recorded.

Sample implementations for Tree Traversal
preorder(node) visit(node) if node.left ≠ null then preorder(node.left) if node.right ≠ null then preorder(node.right)

inorder(node) if node.left ≠ null then inorder(node.left) visit(node) if node.right ≠ null then inorder(node.right)

postorder(node) if node.left ≠ null then postorder(node.left) if node.right ≠ null then postorder(node.right) visit(node)

levelorder(root) queue q q.push(root) while not q.empty do node = q.pop visit(node) if node.left ≠ null then q.push(node.left) if node.right ≠ null then q.push(node.right)

For an algorithm that is less taxing on the stack, see Threaded Trees.

Examples of Tree Traversals

preorder: 50,30, 20, 40, 90, 100 inorder: 20,30,40,50, 90, 100 postorder: 20,40,30,100,90,50

Balancing
When entries that are already sorted are stored in a tree, all new records will go the same route, and the tree will look more like a list (such a tree is called a degenerate tree). Therefore the tree needs balancing routines, making sure that under all branches are an equal number of records. This will keep searching in the tree at optimal speed. Specifically, if a tree with n nodes is a degenerate tree, the longest path through the tree will be n nodes; if it is a balanced tree, the longest path will be log n nodes.

Algorithms/Left rotation: This shows how balancing is applied to establish a priority heap invariant in a Treap, a data structure which has the queueing performance of a heap, and the key lookup performance of a tree. A balancing operation can change the tree structure while maintaining another order, which is binary tree sort order. The binary tree order is left to right, with left nodes' keys less than right nodes' keys, whereas the priority order is up and down, with higher nodes' priorities greater than lower nodes' priorities. Alternatively, the priority can be viewed as another ordering key, except that finding a specific key is more involved.

The balancing operation can move nodes up and down a tree without affecting the left right ordering.

AVL: A balanced binary search tree according to the following specification: the heights of the two child subtrees of any node differ by at most one.

Red-Black Tree: A balanced binary search tree using a balancing algorithm based on colors assigned to a node, and the colors of nearby nodes.

 AA Tree: A balanced tree, in fact a more restrictive variation of a red-black tree.

Binary Search Trees
A typical binary search tree looks like this:

Terms
Node Any item that is stored in the tree. Root The top item in the tree. (50 in the tree above) Child Node(s) under the current node. (20 and 40 are children of 30 in the tree above) Parent The node directly above the current node. (90 is the parent of 100 in the tree above) Leaf A node which has no children. (20 is a leaf in the tree above)

Searching through a binary search tree
To search for an item in a binary tree:

 * 1) Start at the root node
 * 2) If the item that you are searching for is less than the root node, move to the left child of the root node, if the item that you are searching for is more than the root node, move to the right child of the root node and if it is equal to the root node, then you have found the item that you are looking for.
 * 3) Now check to see if the item that you are searching for is equal to, less than or more than the new node that you are on. Again if the item that you are searching for is less than the current node, move to the left child, and if the item that you are searching for is greater than the current node, move to the right child.
 * 4) Repeat this process until you find the item that you are looking for or until the node does not have a child on the correct branch, in which case the tree doesn't contain the item which you are looking for.

Example

For example, to find the node 40...

.........
 * 1) The root node is 50, which is greater than 40, so you go to 50's left child.
 * 2) 50's left child is 30, which is less than 40, so you next go to 30's right child.
 * 3) 30's right child is 40, so you have found the item that you are looking for :)

Adding an item to a binary search tree

 * 1) To add an item, you first must search through the tree to find the position that you should put it in. You do this following the steps above.
 * 2) When you reach a node which doesn't contain a child on the correct branch, add the new node there.

For example, to add the node 25...

 * 1) The root node is 50, which is greater than 25, so you go to 50's left child.
 * 2) 50's left child is 30, which is greater than 25, so you go to 30's left child.
 * 3) 30's left child is 20, which is less than 25, so you go to 20's right child.
 * 4) 20's right child doesn't exist, so you add 25 there :)

Deleting an item from a binary search tree
It is assumed that you have already found the node that you want to delete, using the search technique described above.

Case 1: The node you want to delete is a leaf

For example, to delete 40...

 * Simply delete the node!

Case 2: The node you want to delete has one child

 * 1) Directly connect the child of the node that you want to delete, to the parent of the node that you want to delete.

For example, to delete 90...

 * Delete 90, then make 100 the child node of 50.

Case 3: The node you want to delete has two children
One non-standard way, is to rotate the node into a chosen subtree, and attempt to delete the key again from that subtree, recursively, until Case 1 or Case 2 occurs. This could unbalance a tree, so randomly choosing whether to right or left rotate may help.

The standard way is to pick either the left or right child, say the right, then get the right's leftmost descendent by following left ,starting from the right child, until the next left is null. Then remove this leftmost descendant of the right child, replacing it with its right sub-tree ( it has a left child of null). Then use the contents of this former leftmost descendant of the right child, as replacement for the key and value of the node being deleted, so that its values now are in the deleted node, the parent of the right child. This still maintains the key ordering for all nodes. Example java code is below in the treap example code.

The following examples use the standard algorithm, that is, the successor is the left-most node in the right subtree of the node to be deleted.

For example, to delete 30

 * 1) The right node of the node which is being deleted is 40.
 * 2) (From now on, we continually go to the left node until there isn't another one...) The first left node of 40, is 35.
 * 3) 35 has no left node, therefore 35 is the successor!
 * 4) 35 replaces 30, at the original right node, and the node with 35 is deleted, replacing it with the right sub-tree, which has the root node 37.

Case 1 of two-children case: The successor is the right child of the node being deleted

 * 1) Directly move the child to the right of the node being deleted into the position of the node being deleted.
 * 2) As the new node has no left children, you can connect the deleted node's left subtree's root as it's left child.

For example, to delete 30

 * 1) replace the contents to be deleted (30), with the successor's contents( 40).
 * 2) delete the successor node (contents 40), replacing it with its right subtree (head contents 45).

Case 2 of two-children case: The successor isn't the right child of the node being deleted
This is best shown with an example

To delete 30...

 * 1) Replace the contents to be deleted (30) with the successor's contents (35).
 * 2) replace the successor (35) with it's right subtree (37). There is no left subtree because the successor is leftmost.

Red-Black trees
A red-black tree is a self-balancing tree structure that applies a color to each of its nodes. The structure of a red-black tree must adhere to a set of rules which dictate how nodes of a certain color can be arranged. The application of these rules is performed when the tree is modified in some way, causing the rotation and recolouring of certain nodes when a new node is inserted or an old node is deleted. This keeps the red-black tree balanced, guaranteeing a search complexity of O(log n).

The rules that a red-black tree must adhere to are as follows:

 * 1) Each node must be either red or black.
 * 2) The root is always black.
 * 3) All leaves within the tree are black (leaves do not contain data and can be modelled as null or nil references in most programming languages).
 * 4) Every red node must have two black child nodes.
 * 5) Every path from a given node to any of its descendant leaves must contain the same number of black nodes.

A red-black tree can be modelled as 2-3-4 tree, which is a sub-class of B tree (below). A black node with one red node can be seen as linked together as a 3-node, and a black node with 2 red child nodes can be seen as a 4-node.

4-nodes are split, producing a two node, and the middle node made red, which turns a parent of the middle node which has no red child from a 2-node to a 3-node, and turns a parent with one red child into a 4-node (but this doesn't occur with always left red nodes).

A in-line arrangement of two red nodes, is rotated into a parent with two red children, a 4-node, which is later split, as described before.

A right rotate     'split 4-node'  | red red / \ -->    B      --->  B   B        red / \ red        / \ red / \       C  A        C  A  C  D         /          / D         D

An optimization mentioned by Sedgewick is that all right inserted red nodes are left rotated to become left red nodes, so that only inline left red nodes ever have to be rotated right before splitting. AA-trees (above) by Arne Anderson, described in a paper in 1993 , seem an earlier exposition of the simplification, however he suggested right-leaning 'red marking' instead of left leaning , as suggested by Sedgewick, but AA trees seem to have precedence over left leaning red black trees. It would be quite a shock if the Linux CFS scheduler was described in the future as 'AA based'.

In summary, red-black trees are a way of detecting two insertions into the same side, and levelling out the tree before things get worse. Two left sided insertions will be rotated, and the two right sided insertions, would look like two left sided insertions after left rotation to remove right leaning red nodes. Two balanced insertions for the same parent could result in a 4-node split without rotation, so the question arises as to whether a red black tree could be attacked with serial insertions of one sided triads of a < P < b, and then the next triad's P' < a.

Python illustrative code follows

Summary

 * Whereas binary trees have nodes that have two children, with the left child and all of its descendants less than the "value" of the node, and the right child and all of its children more than the "value" of the node, a B-tree is a generalization of this.
 * The generalization is that instead of one value, the node has a list of values, and the list is of size n ( n > 2 ). n is chosen to optimize storage, so that a node corresponds in size to a block for instance. This is in the days before ssd drives, but searching binary nodes stored on ssd ram would still be slower than searching ssd ram for a block of values, loading into normal ram and cpu cache, and searching the loaded list.
 * At the start of the list, the left child of the first element of the list has a value less than the first element, and so do all its children. To the right of the first element, is a child which has values more than the first element's value, as do all of its children, but also less than the value of the second element. Induction can be used , and this holds so for the child between element 1 and 2, 2 and 3, ... so on until n-1 and nth node.
 * To insert into a non-full B tree node, is to do a insertion into a sorted list.
 * In a B+ tree, insertions can only be done in leaf nodes, and non-leaf nodes hold copies of a demarcating value between adjacent child nodes e.g. the left most value of an element's right child's list of nodes.
 * Whenever a list becomes full e.g. there are n nodes, the node is "split", and this means making two new nodes, and passing the demarcating value upto the parent.

B Trees were described originally as generalizations of binary search trees, where a binary tree is a 2-node B-Tree, the 2 standing for two children, with 2-1 = 1 key separating the 2 children. Hence a 3-node has 2 values separating 3 children, and a N node has N children separated by N-1 keys.

A classical B-Tree can have N-node internal nodes, and empty 2-nodes as leaf nodes, or more conveniently, the children can either be a value or a pointer to the next N-node, so it is a union.

The main idea with B-trees is that one starts with a root N-node, which is able to hold N-1 entries, but on the Nth entry, the number of keys for the node is exhausted, and the node can be split into two half sized N/2 sized N nodes, separated by a single key K, which is equal to the right node's leftmost key, so any entry with key K2 equal or greater than K goes in the right node, and anything less than K goes in the left. When the root node is split, a new root node is created with one key, and a left child and a right child. Since there are N children but only N-1 entries, the leftmost child is stored as a separate pointer. If the leftmost pointer splits, then the left half becomes the new leftmost pointer, and the right half and separating key is inserted into the front of the entries.

An alternative is the B+ tree which is the most commonly used in database systems, because only values are stored in leaf nodes, whereas internal nodes only store keys and pointers to other nodes, putting a limit on the size of the datum value as the size of a pointer. This often allows internal nodes with more entries able to fit a certain block size, e.g. 4K is a common physical disc block size. Hence, if a B+ tree internal node is aligned to a physical disc block, then the main rate limiting factor of reading a block of a large index from disc because it isn't cached in a memory list of blocks is reduced to one block read.

A B+ tree has bigger internal nodes, so is wider and shorter in theory than an equivalent B tree which must fit all nodes within a given physical block size, hence overall it is a faster index due to greater fan out and less height to reach keys on average.

Apparently, this fan out is so important, compression can also be applied to the blocks to increase the number of entries fitting within a given underlying layer's block size (the underlying layer is often a filesystem block).

Most database systems use the B+ tree algorithm, including postgresql, mysql, derbydb, firebird, many Xbase index types, etc.

Many filesystems also use a B+ tree to manage their block layout (e.g. xfs, NTFS, etc).

Transwiki has a java implementation of a B+ Tree which uses traditional arrays as key list and value list.

Below is an example of a B Tree with test driver, and a B+ tree with a test driver. The memory / disc management is not included, but a usable hacked example can be found at /Hashing Memory Checking Example/.

This B+ tree implementation was written out of the B Tree, and the difference from the transwiki B+ tree is that it tries to use the semantics of SortedMap and SortedSet already present in the standard Java collections library.

Hence, the flat leaf block list of this B+ implementation can't contain blocks that don't contain any data, because the ordering depends on the first key of the entries, so a leaf block needs to be created with its first entry.

A B+ tree java example
Experiments include timing the run ( e.g. time java -cp . btreemap.BPlusTreeTest1 ), using an external blocksize + 1 sized leaf block size, so that this is basically the underlying entries TreeMap only, vs , say, 400 internal node size, and 200 external node size. Other experiments include using a SkipListMap instead of a TreeMap.

Treaps
The invariant in a binary tree is that left is less than right with respect to insertion keys. e.g. for a key with order, ord(L) < ord(R). This doesn't dictate the relationship of nodes however, and left and right rotation does not affect the above. Therefore another order can be imposed. If the order is randomised, it is likely to counteract any skewness of a plain binary tree e.g. when inserting an already sorted input in order.

Below is a java example implementation, including a plain binary tree delete code example.

title: Data Structures/Trees


text:
Sprungfeder

Etymology
From.

Noun

 * 1) A spring, made of flexible material, as in a car to absorb shocks

source: wikimedia

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: Sprungfeder


text:
User:Luhur

Muhammad Ramzan Luhur is a PhD Researcher in Germany. He was born on October 05, 1977 in a small village named Jhando Luhur in Taluka Ratodero District Larkana. His father Bahadur Luhur was a farmer in Jhando Luhur. He received his primary education in Juma Agham for two years and then continued in Ratodero. He did his secondary education from pilot school Larkana with first position in district. He passed his higher secondary education from degree college of Larkana.

In 1997, Mr. Luhur got admission in Quaid-e-Awam University of Engineering, Sciences and Technology (QUEST), Nawabshah, Pakistan and passed his bachelor in mechanical engineering (B.E) with first position in department. After graduation he worked in Chemi Visco Fibre Ltd (a private factory in Nawabshah) for 14 months. In April, 2004 he appointed as a lecturer in QUEST Nawabshah. He taught for 3 years in QUEST and then in 2007 qualified for a masters leading to PhD scholarship under Faculty Development Program of QUEST funded by Higher Education Commission (HEC) Islamabad Pakistan. In October 2007, he left for higher education abroad and achieved his masters degree in sustainable energy engineering from Royal Institute of Technology (KTH) Stockholm Sweden. After masters, in end of 2009 he moved to Oldenburg Germany for his PhD studies.

title: User:Luhur


text:
User:Aqibazadjanjua

Ranjali (Urdu: رنجالی ) is a town which is located in Gujar Khan Tehsil, Rawalpindi District, Punjab, Pakistan. The major caste of Ranjali are (Choudary چودهرى), (Janjua Rajput جنجوعہ راجپوت ) and (Chohan Rajpoot). Union Council of ranjali is Manghot.

= RANJALI = Ranjali (Urdu: رنجالی ) is a town which is located in Gujar Khan Tehsil, Rawalpindi District, Punjab, Pakistan. The major caste of Ranjali are (Choudary چودهرى) , (Janjua Rajput جنجوعہ راجپوت ) and (Chohan Rajpoot). Union Council of ranjali is Manghot.

Touring Ranjali in Pakistan.
The most tourist place is Darbar of Baba Jaffar Shah Shaib.

Ranjali in the region of Punjab is located in Pakistan - some 28 mi (or 46 km) South of Islamabad, the country's capital city.

See also[edit source]

 * Janjua Rajput
 * The Janjua (also spelt Janjooa, Janjuha, Janjuah) is a caste often found among the Sikh, Muslim and HinduRajput communities of Pakistan and India.
 * Raja Dhrupet Dev was the father of a famous Janjua Chief Raja Ajmal Dev Janjuawho embraced Islam in the 12th century and rose to become the next rising force of the Janjua Rajput. He followed the Islamic tradition of changing his name after conversion but was better known as Raja Mal Khan.

References[edit source]
Categories:
 * Union councils of Rawalpindi District
 * Union Councils Of Tehsil Gujar Khan
 * Rawalpindi District geography stubs

Navigation menu

 * Aqibazadjanjua
 * Alerts (0)
 * Notice (1)
 * Talk
 * Sandbox
 * Preferences
 * Beta
 * Watchlist
 * Contributions
 * Log out

 * Article
 * Talk

 * Read
 * Edit source
 * View history
 * Watch

 * Main page
 * Contents
 * Featured content
 * Current events
 * Random article
 * Donate to Wikipedia
 * Wikipedia store

Interaction

 * Help
 * About Wikipedia
 * Community portal
 * Recent changes
 * Contact page

Tools

 * What links here
 * Related changes
 * Upload file
 * Special pages
 * Permanent link
 * Page information
 * Wikidata item
 * Cite this page

Print/export

 * Create a book
 * Download as PDF
 * Printable version

Languages
Edit links
 * پنجابی
 * اردو
 * This page was last edited on 20 September 2017, at 14:30.
 * Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.

title: User:Aqibazadjanjua


text:
Cookbook:Tex-Mex Cuisine

| North America | United States Tex-Mex cuisine could be considered as being a type or style of Mexican cuisine, of the type or style practiced with gusto in Texas. In addition to the ancient roots of many of its ingredients and types of food items, Tex-Mex cuisine is a vibrant cuisine which is becoming increasingly known and ably practiced throughout the world.

Perhaps the very most fundamental recipes of Tex-Mex cuisine to learn and attempt to master are tacos (including an appropriate main filling), pinto beans (including refried beans), enchiladas, and fajitas. Tortillas are a very fundamental part of Tex-Mex cuisine, although, in modern times, tortillas are often purchased, rather than being made by exclusively by hand, a primary emphasis being on freshness.

Tex-Mex cuisine is distinguishable from Texas cuisine in that the foundations of Texas cuisine seem to relate more to a cuisine developed by settlers who immigrated to Texas from the U.S. in the 1800’s (with substantial contributions from other cuisines of the time), although there are overlaps, similarities, and borrowing between the two.

Recipes
For a list of recipes see the Tex-Mex recipes category.

If you are reading this on the Tex-Mex cooking page, all of the recipes in Tex-Mex recipes category are already listed to the right.

Here are a few selected recipes:

 * Black Bean Soup and Salsa Verde
 * Burrito
 * Cheese Enchiladas
 * Nachos
 * Queso
 * Tacos
 * Pinto Beans Recipe from South Texas

title: Cookbook:Tex-Mex Cuisine


text:
Free Learning

Welcome to the A. S. Neill School of Free Learning.

Content development project
The School of Free Learning promotes efforts to develop Wikiversity learning resources for learners who are encouraged to explore their personal interests while participating in a self-governing learning community. This style of education was developed by A. S. Neill at Summerhill School and is well suited for Wikiversity, where learners are free to come and go as they please and make use of the collaborative wiki environment for exploration of their personal learning goals. See: the Wikiversity learning model.

Special content development efforts
The School of Free Learning is a central hub for coordination of more focused content development projects.

One focus area for content development in the School of Free Learning is the development of learning resources about Wikiversity itself. Wikiversity provides learning opportunities that are strange and unfamiliar for most learners. The Wikiversity content development project coordinates efforts to help new Wikiversity participants become familiar with using wiki technology as a tool to assist them in their pursuit of learning goals.

Wikiversity is one of the family of education-oriented wiki websites of the Wikimedia Foundation. It is important that Wikiversity participants understand the cooperative relationship between Wikiversity and its sister projects. Topic:Wikimedia is a content development project that coordinates the development of learning resources about Wikipedia, Wikibooks, Wikimedia Commons and the other Wikimedia Foundation wiki projects.

Wiki websites are just one type of website that characterizes the growing trend of websites that support online communities of participants who are engaged in the creation and sharing of digital files. Topic:Web 2.0 is a content development project that coordinates the development of learning resources about Web 2.0 and supports Wikiversity participants who want to make and share digital media files such as podcasts.

Learning Resources

 * Learning fun - exploration of how to have fun while editing Wikiversity webpages.
 * How to use wiki technology as a free learner - strategies for how to explore personal learning goal by making use of wiki technology.
 * History of free learning - Historical review of A. S. Neill, Summerhill School, Unschooling and related educational philosophies.
 * Composing free and open online educational resources - The course reading and the assignments will familiarize the participants with the main concepts related to open education resources and to the historical and philosophical ideas behind them. The participants will also carry out hands-on exercises and will this way learn to create and participate in projects producing free and open educational resources.

 * Ivan Illich: Deschooling Society/Learning Webs

title: Free Learning


text:
Mali Hingano

Malietoa Seuli Hingano also known as Malietoa Hingano (born 27 January 1992) is an Australian born Tongan rugby union player who generally plays as a centre represents Tonga internationally and currently plays for French club Aviron Bayonnais. He was included in the Tongan squad for the 2019 Rugby World Cup which was held in Japan for the first time and also marks his first World Cup appearance.

Career
He made his international debut for Tonga against Samoa on 27 July 2019.

title: Mali Hingano


text:
Wikipedia:WikiProject Indonesia/Assessment

Welcome to the assessment department of WikiProject Indonesia! This department focuses on assessing the quality of Wikipedia's Indonesia articles. While much of the work is done in conjunction with the WP:1.0 program, the article ratings are also used within the project itself to aid in recognising excellent contributions and identifying topics in need of further work.

The ratings are done in a distributed fashion through parameters in the WikiProject Indonesia project banner; this causes the articles to be placed in the appropriate sub-categories of Category:Indonesia articles by quality and Category:Indonesia articles by importance, which serve as the foundation for an automatically generated worklist.

Frequently asked questions

 * How do I add an article to the WikiProject? : Just add WikiProject Indonesia to the talk page; there's no need to do anything else.
 * How can I get my article rated? : Please list it in the section for assessment requests below.
 * Who can assess articles? : Any member of the Indonesia WikiProject is free to add—or change—the rating of an article. Please add your name to the list of participants if you wish to assess articles on a regular basis.
 * Why didn't the reviewer leave any comments? : Unfortunately, due to the volume of articles that need to be assessed, we are unable to leave detailed comments in most cases. If you have particular questions, you might ask the person who assessed the article; they will usually be happy to provide you with their reasoning.
 * Where can I get more comments about my article? : The Status requester can conduct more thorough examination of articles; please submit it for review there.
 * What if I don't agree with a rating? : You can list it in the section for assessment requests below, and someone will take a look at it. Alternately, you can ask any member of the project to rate the article again.
 * Aren't the ratings subjective? : Yes, they are (see, in particular, the disclaimers on the importance scale), but it's the best system we've been able to devise; if you have a better idea, please don't hesitate to let us know!
 * How can I keep track of changes in article ratings? : A full log of changes over the past thirty days is available here. If you are just looking for an overview, however, the statistics may be more accessible.

If you have any other questions not listed here, please feel free to ask them on the discussion page for this department.

Importance assessment

 * Cities & administrative areas - Generally classed as high to mid importance.
 * Lists - Generally classed as mid to low importance, unless the subject is high (e.g. List of Presidents)
 * People - Generally classed as mid to high importance.
 * Provinces - Generally classed as top to high importance.
 * Places - Generally classed as mid to low importance.
 * Schools - Generally classed as mid to low importance.

Importance scale
The criteria used for rating article importance are not meant to be an absolute or canonical view of how significant the topic is. Rather, they attempt to gauge the probability of the average reader of Wikipedia needing to look up the topic (and thus the immediate need to have a suitably well-written article on it).

Subjects with greater popular notability may be rated higher than topics which are arguably more "important" but which are of interest primarily to students of Indonesia.

''Note that general notability need not be from the perspective of editor demographics; generally notable topics should be rated similarly regardless of the country or region in which they hold said notability. Thus, topics which may seem obscure to a Western audience—but which are of high notability in other places—should still be highly rated.''

Requesting an assessment
If you have made significant changes to an article and would like an outside opinion on a new rating for it, please feel free to list it below. If you are interested in more extensive comments on an article, please use the peer review department instead.

click here to add new request

Participants
Feel free to add your name to this list if you would like to join the assessment team

 * 1) - last edited on WP in 2007
 * 2) - last edited on WP in mid 2008

Example assessments
To assess an article, paste one of the following onto the article's talk page.

Quality

 *   - to rate an article at FA-Class
 *   - to rate an article at A-Class
 *   - to rate an article at GA-Class
 *   - to rate an article at B-Class
 *   - to rate an article at Start-Class
 *   - to rate an article at Stub-Class
 *   - to leave the article un-assessed.

Importance

 *   - to rate an article at Top importance
 *   - to rate an article at High importance
 *   - to rate an article at Mid importance
 *   - to rate an article at Low importance


text:
Kenneth Robertson Dempster

Kenneth Robertson Dempster (1924 – 6 March 2001),also known as Claude Dempster, was a British pathologist at the King Edward VII Hospital, Windsor, who in 1945, while studying at St Thomas' Hospital, assisted at Bergen-Belsen concentration camp when he volunteered as a medical student.

title: Kenneth Robertson Dempster


text:
Hovann Simonian

Hovann Simonian (born in Beirut, Lebanon) is an Armenian Swiss scholar in Armenian history, historical geography and culture. Born in Beirut to Armenian parents, he was raised in Switzerland where his family moved at the beginning of the Civil War in Lebanon in 1975.

He is the editor of The Hemshin: History, Society and Identity in the Highlands of Northeast Turkey and co-author of Troubled Waters : the Geopolitics of the Caspian Region with Richard Dekmejian. He is also the administrator, along with Peter Hrechdakian and Mark Arslan, of the Armenian DNA Project.

title: Hovann Simonian


text:
Talk:Lists of country subdivision flags

This article is too big, takes long time to load and difficult to get an overview of -- the sections that has sub-articles should IMO be cut. -- Himasaram 13:58, 11 August 2006 (UTC)

Done! ;) -- Himasaram 11:00, 29 August 2006 (UTC)

U.S. County Flags
I know of at least one state (probably all) whose counties each have an official flag. Any chance of a mention of these? Mapsax 21:46, 9 July 2007 (UTC)

Fair use rationale for Image:Hsinchu County flag.png
Image:Hsinchu County flag.png is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

BetacommandBot (talk) 06:53, 1 January 2008 (UTC)

Fair use rationale for Image:Nantou flag.png
Image:Nantou flag.png is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

BetacommandBot (talk) 16:37, 2 January 2008 (UTC)

Fair use rationale for Image:MiaoliCounty seal.png
Image:MiaoliCounty seal.png is being used on this article. I notice the image page specifies that the image is being used under fair use but there is no explanation or rationale as to why its use in this Wikipedia article constitutes fair use. In addition to the boilerplate fair use template, you must also write out on the image description page a specific explanation or rationale for why using this image in each article is consistent with fair use.

BetacommandBot (talk) 16:25, 8 March 2008 (UTC)

Image copyright problem with Image:Chiayi County flag.png
The image Image:Chiayi County flag.png is used in this article under a claim of fair use, but it does not have an adequate explanation for why it meets the requirements for such images when used here. In particular, for each page the image is used on, it must have an explanation linking to that page which explains why it needs to be used on that page. Please check

 * That this article is linked to from the image description page.

This is an automated notice by FairuseBot. For assistance on the image use policy, see Media copyright questions. --22:12, 19 May 2008 (UTC)

Split this article?
This article is extremely large and takes a noticeable amount of time to load. How do people feel about turning this page into a spin-out article and splitting the content into two or more article. For now, I'm proposing a two-way split into Flags of country subdivisions (A - L) and Flags of country subdivisions (M - Z). NewYorkActuary (talk) 15:36, 29 June 2016 (UTC)
 * A split by continent is an alternative option, though that would require splitting into four or more articles, or using arbitrary combinations of continents. SiBr4 (talk ) 20:20, 7 July 2016 (UTC)
 * User:SiBr4. Although I have this article on my watchlist, I missed your posting amidst all of the revisions that have been taking place with the article itself.  Sorry about the delay in response.
 * I like your idea about splitting by continents much better than my idea. So, I now propose to split them by continents and, for consistency, will use the country listings that appear in the Wikipedia articles on each continent.  In cases where a "country" is listed under a certain continent, but is actually a possession of a country listed under another continent, then I'll have an entry in the location-continent that merely links to the substantive entry in the possession-continent.  Similar treatment will be given to Russia (i.e., it will appear under Europe, but also have an entry under Asia that links to it).
 * I expect to start the process this weekend, but I'll wait to hear if you have any objections or suggestions. NewYorkActuary (talk) 16:54, 22 July 2016 (UTC)
 * To be clear, I am now proposing spin-outs to separate articles on (i) North America, (ii) South America, (iii) Europe, (iv) Africa, (v) Asia, and (vi) Oceania. NewYorkActuary (talk) 16:56, 22 July 2016 (UTC)
 * The number of currently included countries in each continent:
 * Africa: 10
 * Asia: 18
 * Europe: 37
 * North America: 11
 * Oceania: 6
 * South Africa: 10
 * I said "four or more" above because some combinations of continents are used often enough as to not be considered "arbitrary", particularly the Americas and possibly Asia and Oceania, and a separate Oceania article in particular would be rather small. I'm not opposing a six-way split, though.
 * As for transcontinental countries, I had wanted to suggest using the continent divisions from the UN geoscheme, which puts Russia in Europe and the remaining Asian-European countries (of which currently only Georgia is in the article) in Asia. AFAICT, French Polynesia is the only dependent territory whose subdivisions are currently listed, so would that be the only territory (other than transcontinental countries) requiring a cross-link? SiBr4 (talk ) 15:46, 23 July 2016 (UTC)
 * My purpose in specifying the listings used in Wikipedia's continent articles was simply to have something to point to in case anyone wanted to argue that a particular country should appear in a different spin-out article. Although the UN geoschemes would serve the same purpose, I'm having a tough time accepting that the entire Western Hemisphere should be viewed as a single "continent".  My first thought when reading your suggestion was that the defining rule for the spin-outs might be "UN geoscheme, but South America is separate".  But this isn't what the UN does -- they lump South America in with Central America and the Carribean.  So, in the absence of objection from you, I'll stick with the Wikipedia definitions.
 * As for cross-linking, I was thinking more about the territories themselves. For example, I intend to have an entry for Greenland in the spin-out article for North America.  However, no flag would appear there.  Instead, the entry would identify Greenland as an autonomous member of the Danish Realm, and would provide a link to the entry on Denmark (which would, of course, appear in the spin-out article for Europe).
 * I'll probably get started on this tomorrow, and will look to do one spin-out per day (but not necessarily every day). I expect the entire process to take no more than two weeks, and probably will be faster than that.  NewYorkActuary (talk) 22:29, 23 July 2016 (UTC)
 * Although the UN has a single "macro-geographical" entry for the Americas and divides it into Northern and Latin America, it does describe North America (including Central America and the Caribbean) as a continent in a footnote. By implication, South America would be a continent too. I didn't suggest making a single page for the Americas just because the UN geoscheme does that, and, as I said, am perfectly fine with having six pages.
 * Minor issue, but trying to imagine what a reader would expect upon seeing a section called Flags of country subdivisions (North America), I would have flags of subdivisions of Greenland in mind, not the flag of Greenland itself, so I would be surprised (albeit mildly) to only find the latter after being soft-redirected to the Europe page. Alternatively, I would understand if there was Flags of country subdivisions (North America) linking to a section containing the flags of the North American subdivisions/territories of Denmark. That format would also avoid having many cross-links to the same section for countries with a lot of territories in a continent (e.g., the British Caribbean dependencies). SiBr4 (talk ) 00:06, 24 July 2016 (UTC)

Those flags are fake
Hi,

All the flags below are fake flags only created and added on Wikimedia Commons by SiBr4 by combinations of old flags. Those regions don't even have their defenitives names. You really should have a look on Nouvelle-Aquitaine. Please remove those fake flags.

Thank you. --Mattho69 (talk) 23:16, 29 June 2016 (UTC)

Commons files used on this page have been nominated for deletion
The following Wikimedia Commons files used on this page have been nominated for deletion: Participate in the deletion discussions at the nomination pages linked above. —Community Tech bot (talk) 13:10, 3 April 2019 (UTC)
 * Flag of Central Java.svg (discussion)
 * Flag of East Java.svg (discussion)
 * Flag of South Sulawesi.svg (discussion)

A Commons file used on this page has been nominated for deletion
The following Wikimedia Commons file used on this page has been nominated for deletion: Participate in the deletion discussion at the nomination page. —Community Tech bot (talk) 16:22, 3 April 2019 (UTC)
 * Flag of Amazonas State.svg

A Commons file used on this page has been nominated for deletion
The following Wikimedia Commons file used on this page has been nominated for deletion: Participate in the deletion discussion at the. —Community Tech bot (talk) 22:30, 9 June 2019 (UTC)
 * Flag of East Kalimantan.svg

A Commons file used on this page or its Wikidata item has been nominated for deletion
The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion: Participate in the deletion discussion at the. —Community Tech bot (talk) 08:37, 28 March 2020 (UTC)
 * Flag of Lampung.svg

A Commons file used on this page or its Wikidata item has been nominated for deletion
The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion: Participate in the deletion discussion at the. —Community Tech bot (talk) 16:53, 1 April 2020 (UTC)
 * Flag of North Maluku.png

A Commons file used on this page or its Wikidata item has been nominated for deletion
The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion: Participate in the deletion discussion at the. —Community Tech bot (talk) 17:52, 1 April 2020 (UTC)
 * Flag of Riau.svg

A Commons file used on this page or its Wikidata item has been nominated for deletion
The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion: Participate in the deletion discussion at the. —Community Tech bot (talk) 18:07, 1 April 2020 (UTC)
 * Flag of Maluku.png

Recent IP edits
These have been reverted by myself, and. This article is called "Flags of country subdivisions", so sections with no information about flags and links to articles such as Counties of Albania and Municipalities of El Salvador do not belong in this article, since they are only talking about subdivisions not flags. FDW777 (talk) 10:27, 30 July 2020 (UTC)

A Commons file used on this page or its Wikidata item has been nominated for deletion
The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion: Participate in the deletion discussion at the. —Community Tech bot (talk) 19:24, 27 November 2020 (UTC)
 * Jarvis Island flag.png

East Timor
See this detail at FOTW about the origin of these designs. Note also that the original author have categorised these files on commons as "proposals". No source is provided that they are anything more.

Semi-protected edit request on 18 April 2021
.o]-pu oo jpo klin Jurisdrew (talk) 03:20, 18 April 2021 (UTC)
 * Red question icon with gradient background.svg Not done: it's not clear what changes you want to be made. Please mention the specific changes in a "change X to Y" format and provide a reliable source if appropriate. Kpg  jhp  jm  03:26, 18 April 2021 (UTC)

A Commons file used on this page or its Wikidata item has been nominated for deletion
The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion: Participate in the deletion discussion at the. —Community Tech bot (talk) 07:26, 30 June 2021 (UTC)
 * Jharkhand Government Logo.svg

Changing format
I think we should change the lists below the names to Galleries instead of bullet points. Ranamode (talk) 16:39, 27 July 2021 (UTC)

Shortening of the article
Is it possible if the countries which have a separate article for subdivision flags (e.g. Japan has this article: https://en.wikipedia.org/wiki/Lists_of_Japanese_municipal_flags) should have that as the only entry under their names? It would drastically shorten the page. Ranamode (talk) 20:43, 10 August 2021 (UTC)

Flags of municipalities
Flags of municipalities (eg Liechtenstein, Malta, San Marino. Etc) need to be moved to this article (List of city flags) for the Municipal flags please refer to city flags — Preceding unsigned comment added by Alexphangia (talk • contribs) 12:51, 15 December 2021 (UTC)

 * I don't agree, flags municiplates may be included in this list but only if theres a small amount of number of municipalities. 2A02:A453:D05E:1:7D56:CF99:A5F5:2859 (talk) 08:37, 25 April 2022 (UTC)

A Commons file used on this page or its Wikidata item has been nominated for deletion
The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion: Participate in the deletion discussion at the. —Community Tech bot (talk) 16:53, 12 January 2022 (UTC)
 * Banner of Pashalik of Ioannina based on Ali Pasha's medalion.png

A Commons file used on this page or its Wikidata item has been nominated for deletion
The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion: Participate in the deletion discussion at the. —Community Tech bot (talk) 17:37, 26 January 2022 (UTC)
 * Bahrain Northern Governorate Flag.svg

National flags
Since this is Flags of country subdivisions, they have no place here. Especially when the page already loads slowly due to the number of images. Please stop adding off-topic flags. FDW777 (talk) 20:44, 13 April 2022 (UTC)

A thought based on the recent deletion nomination discussion
Most voters of the recent discussion were considering reverting the article back to this version.

I want to remind you all that the images were changed from templates to galleries, so that the article was easier to edit.

The site was further altered by adding links to other articles, so that the article loaded faster. This also made it easier to update flag information as editors would focus on flags of their own countries, therefore getting more contributors to the flag articles by "outsourcing" the work.

I would request fellow editors to not revert to the old version, but improve upon the current version. Flag Mechanic (talk) 12:20, 6 August 2022 (UTC)

A Commons file used on this page or its Wikidata item has been nominated for deletion
The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion: Participate in the deletion discussion at the. —Community Tech bot (talk) 04:38, 8 August 2022 (UTC)
 * Flag of Tarija.svg

Commons files used on this page or its Wikidata item have been nominated for deletion
The following Wikimedia Commons files used on this page or its Wikidata item have been nominated for deletion: Participate in the deletion discussion at the nomination page. —Community Tech bot (talk) 02:58, 15 August 2022 (UTC)
 * Flag of Brong-Ahafo Region.svg
 * Flag of Central Region (Ghana).gif
 * Flag of Greater Accra Region.svg
 * Flag of Volta Region.png
 * Flag of Western Region (Ghana).gif
 * Flag of the Eastern Region, Ghana.svg

Requested move 22 November 2022

The result of the move request was: moved. (closed by non-admin page mover) Skarmory   (talk •   contribs)  23:22, 29 November 2022 (UTC)

Flags of country subdivisions → List of country subdivision flags – reflects the article more clearly <IP_ADDRESS> (talk) 14:15, 22 November 2022 (UTC) The discussion above is closed. Please do not modify it. Subsequent comments should be made on the appropriate discussion page. No further edits should be made to this discussion.
 * Support. If anything, this is necessary to avoid example farming. Right now anyone can add a gallery of flags they believe to be the best gallery and it will technically be within the scope. CPORfan (talk) 02:54, 27 November 2022

A Commons file used on this page or its Wikidata item has been nominated for deletion
The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion: Participate in the deletion discussion at the. —Community Tech bot (talk) 08:08, 3 February 2023 (UTC)
 * Flag province Kuna de Madungandi (Panama).jpg

A Commons file used on this page or its Wikidata item has been nominated for deletion
The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion: Participate in the deletion discussion at the. —Community Tech bot (talk) 18:08, 3 February 2023 (UTC)
 * Bandera de la Comarca Guna de Wargandí.svg

A Commons file used on this page or its Wikidata item has been nominated for speedy deletion
The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for speedy deletion: You can see the reason for deletion at the file description page linked above. —Community Tech bot (talk) 20:12, 2 May 2023 (UTC)
 * Flag of Aitutaki, Cook Islands.gif

Split the article
Due to the size of the article, I would recommend to split it. For the nth time (talk) 10:27, 20 April 2024 (UTC)

Change from lists to galleries?
One change I noticed in the subarticles was the addition of tables for flags, as the subarticles have been called as lists instead of galleries. Shall we rename the subarticles as galleries, to get rid of the tables? Also should we delete entries which we cannot cite? For the nth time (talk) 14:24, 9 July 2024 (UTC)

title: Talk:Lists of country subdivision flags


text:
pugo

Etymology
From. Cognate with 🇨🇬.

Coined by Kálmán Kalocsay, and popularized by his erotic poetry collection Sekretaj Sonetoj.

Noun

 * 1)  arse, ass, buttocks

Etymology
From, from , from.

Noun

 * 1) quail

Noun

 * 1) quail

title: pugo


text:
Nikola Arsenović

Nikola Arsenović (Никола Арсеновић,, 1823 – July 18, 1887) is a Serb designer and illustrator of folk costume; being posthumously dubbed a "Yugoslav ethnographer". A tailor by profession, he started illustrating peasant clothing while traveling the lands after having left his family and shop due to unknown reasons. The Ethnographic Museum in Belgrade acquired most of his work, the rest having been bought by various painters.

Life
He was born in Retfala, near Osijek, in 1823, the area being part of the Kingdom of Slavonia of the Austrian Empire (now part of Croatia).

He finished primary school in Osijek, and then decided to become a tailor. As a youngster, he travelled to Pest and Vienna, to perfect the craft, and also further to Paris and in Germany. He was away for 7 years, then returned, settling in Vukovar, where he married and opened a large tailor shop with eight workers. Apart from peasant (or "national") clothing, he also tailored for military officers, clergy and citizens.

He died in Belgrade, on July 18, 1887. He was a Yugoslavist, and called himself a Yugoslav.

title: Nikola Arsenović


text:
John A. C. Greppin

John Aird Coutts Greppin (April 2, 1937 – May 3, 2016) was an American scholar of Armenian studies, linguist, and a professor at the Cleveland State University.

Biography
He attended the Allendale School in Rochester, New York, Dartmouth College, and University of Rochester. Greppin received a Ph.D. in Indo-European Studies at the University of California-Los Angeles in 1972. He taught Greek and Latin at the Woodstock Country School in South Woodstock, Vermont, and was a professor at Cleveland State University from 1975 to 2010. Greppin was an author of 16 books and 500 articles and reviews. His academic specialty was Classical Armenian. He spent a year in Soviet Armenia on a State Department grant in 1974-75. In 1998 he spent a semester in Göttingen, Germany as a visiting professor. He founded the Annual of Armenian Linguistics and edited it for 25 years. He also co-edited Raft, a Journal of Armenian Poetry and Criticism.

In 2013 he donated his Armenian collection to the National Association for Armenian Studies and Research (NAASR) library.

With his wife Mary E. Greppin (Hannan) they had two children.

Awards

 * Distinguished Faculty Award for Research, Cleveland State University (2010)

Works

 * The Diffusion of Greco-Roman Medicine into the Middle East and the Caucasus. Emilie Savage-Smith (Editor), John L. Gueriguian (Editor), John AC Greppin (Editor). 1999. ISBN<PHONE_NUMBER>965
 * Handbook of Armenian Dialectology (Anatolian and Caucasian studies). by John A. C. Greppin, Amalya Khachaturyan, New York : Caravan, 1986, 253 p.
 * "Bark Galianosi": The Greek-Armenian Dictionary to Galen. Author: John AC Greppin. December 1985. ISBN<PHONE_NUMBER>644
 * Interrogativity: A Colloquium on the Grammar, Typology, and Pragmatics of Questions in Seven Diverse Languages, Cleveland, Ohio, October 5th, 1981-May 3rd, 1982. Author: John AC Greppin, Louis Tonko Milic, William Chisholm. January 1984. ISBN<PHONE_NUMBER>;
 * Studies in Classical Armenian Literature (Anatolian and Caucasian Studies), by John A. C. Greppin, 1994, 261 p. ISBN<PHONE_NUMBER>

title: John A. C. Greppin


text:
Heo Kyung-hwan

Heo Kyung-hwan (born February 16, 1981), is a South Korean comedian. He debuted as a comedian on Gag Concert, and is best known for his acts 'Four Men', 'Seoul Mate', and 'Dignity of a Beggar'. He is also known for the shows The Human Condition and Mamma Mia. It was revealed that he signed a contract with Cube Entertainment on 4 February 2016. In February 2022, Heo signed with Think Entertainment.

title: Heo Kyung-hwan


text:
2019 Oeste Ladies Open – Singles

This was the first edition of the tournament.

Isabella Shinikova won the title after Natalija Kostić retired in the final at 6–3, 2–0.

Seeds
• # 🇪🇪 Kaia Kanepi (quarterfinals)

• # 🇮🇹 Giulia Gatto-Monticone (first round)

• # 🇧🇬 Viktoriya Tomova (quarterfinals)

• # 🇹🇷 Pemra Özgen (second round)

• # 🇩🇪 Katharina Hobgarski (second round)

• # Diāna Marcinkēviča (first round)

• # 🇫🇷 Jessika Ponchet (semifinals)

• # 🇧🇬 Elitsa Kostova (first round)

title: 2019 Oeste Ladies Open – Singles


text:
Firecracker (disambiguation)

Firecracker is a small explosive device primarily designed to produce a large amount of noise.

Firecracker may also refer to:

Media

 * Firecrackers. A Realistic Novel (1925), by Carl Van Vechten
 * Firecracker (film), a 2005 film starring Mike Patton and Karen Black
 * Firecracker, a television ident for BBC Two, first aired in 1993 (see BBC Two '1991–2001' idents)
 * Firecracker Award for best independently published literature

Music

 * Firecracker (Lisa Loeb album), 1997
 * Firecracker (The Wailin' Jennys album), 2006
 * Firecracker EP by Unwed Sailor, 1999
 * "Firecracker" (Josh Turner song), 2007
 * "Firecracker", a song by Mass Production, 1979
 * "Firecracker", a song by Ryan Adams from Gold, 2001
 * "Firecracker", a song by Yellow Magic Orchestra from Yellow Magic Orchestra, 1978
 * "Fire Cracker", a song by 808 State from Quadrastate, 1989

Nature and wildlife

 * Firecracker plant, ornamental plants of the genus Russelia
 * Firecracker Skimmer (Libellula saturata), a North American species of dragonfly
 * Arizona firecracker (Ipomopsis arizonica), a flowering plant native to the mountains of the Mojave Desert

Other uses

 * Pepsi 400, an annual NASCAR race previously known as the Firecracker 400 (1963–1988) and the Firecracker 250 (1959–1962)
 * Firecracker (software), virtualization software

title: Firecracker (disambiguation)


text:
Catherine Webb

Catherine Webb (born 1986) is a British author. Under the pseudonym Kate Griffin, she writes fantasy novels for adults. As Claire North, she writes science fiction and novels based upon the work of Homer.

Life
Webb was educated at the Godolphin and Latymer School, London, and the London School of Economics.

She was 14 years old when she completed Mirror Dreams, which was written during her school holidays. Her father is author and publisher Nick Webb, and he suggested she should send the manuscript to an agent he knew, who eventually offered to represent her. The book was published in 2002 by Atom Books, and Webb was named Young Trailblazer of the Year by the magazine CosmoGirl UK. She has published eight young adult novels, all with Atom Books, and studied at the Royal Academy of Dramatic Art, from which she graduated in 2010.

A lifelong Londoner, Webb enjoys walking through the areas she describes in her books – Bethnal Green, Clerkenwell, and along the River Thames – comparing the city of London as it is now with how it was at various times in the past. She appeared in CosmoGirl in 2006/7 in an interview. She also appeared in online interviews with CBBC and nzgirl when she was 15, and also with The Daily Telegraph, which described her as a teen queen.

As Catherine Webb

 * Mirror Dreams (2002)
 * Mirror Wakes (2003)
 * Waywalkers (2003)
 * Timekeepers (2004)
 * The Extraordinary and Unusual Adventures of Horatio Lyle (2006)
 * The Obsidian Dagger: Being the Further Extraordinary Adventures of Horatio Lyle (2006)
 * The Doomsday Machine: Another Astounding Adventure of Horatio Lyle (2008)
 * The Dream Thief: An Extraordinary Horatio Lyle Mystery (2010)

As Kate Griffin

 * A Madness of Angels (2009) (Matthew Swift series, book 1)
 * The Midnight Mayor (2010) (Matthew Swift series, book 2)
 * The Neon Court (2011) (Matthew Swift series, book 3)
 * The Minority Council (2012) (Matthew Swift series, book 4)
 * Stray Souls (2012) (Magicals Anonymous series, book 1)
 * The Glass God (2013) (Magicals Anonymous series, book 2)

As Claire North

 * The First Fifteen Lives of Harry August (2014)
 * Touch (2015)
 * The Gameshouse (2015)
 * The Sudden Appearance of Hope (2016)
 * The End of the Day (2017)
 * 84K (2018)
 * The Pursuit of William Abbey (2019)
 * Notes from the Burning Age (2021)
 * The Songs of Penelope trilogy
 * Ithaca (2022)
 * House of Odysseus (2023)
 * The Last Song of Penelope (2024)

Awards and nominations

 * 2005, Timekeepers nominated for the Carnegie Medal
 * 2006, The Extraordinary and Unusual Adventures of Horatio Lyle nominated for the Carnegie Medal
 * 2014, The First Fifteen Lives of Harry August (as Claire North) nominated for the BSFA Award for Best Novel
 * 2015, The First Fifteen Lives of Harry August (as Claire North) won the John W. Campbell Memorial Award
 * 2015, The First Fifteen Lives of Harry August (as Claire North) nominated for the Arthur C. Clarke Award
 * 2017, The Sudden Appearance of Hope (as Claire North) won the World Fantasy Award—Novel

title: Catherine Webb


text:
Zamia onan-reyesii

Zamia onan-reyesii is a species of cycad in the family Zamiaceae endemic to Cortés Department, northern Honduras.

title: Zamia onan-reyesii