When.com Web Search

  1. Ads

    related to: skovby round expanding dining table

Search results

  1. Results From The WOW.Com Content Network
  2. Systofte Skovby - Wikipedia

    en.wikipedia.org/wiki/Systofte_Skovby

    Systofte Skovby is a village 3 kilometres (1.9 mi) east of Nykøbing on the Danish island of Falster. Today it serves as a satellite village for Nykøbing. As of 2024, it has a population of 339.

  3. Schuby - Wikipedia

    en.wikipedia.org/wiki/Schuby

    Schuby (Danish: Skovby) is a municipality in the district Schleswig-Flensburg, in Schleswig-Holstein in northern Germany.It is only a few kilometres west from Schleswig.. The name comes from the Danish "Skovby", meaning the "Village in the Woods".

  4. Table (furniture) - Wikipedia

    en.wikipedia.org/wiki/Table_(furniture)

    Loo tables were very popular in the 18th and 19th centuries as candlestands, tea tables, or small dining tables, although they were originally made for the popular card game loo or lanterloo. Their typically round or oval tops have a tilting mechanism , which enables them to be stored out of the way (e.g. in room corners) when not in use.

  5. Scandinavian flat-plane style of woodcarving - Wikipedia

    en.wikipedia.org/wiki/Scandinavian_flat-plane...

    The Scandinavian flat-plane style of woodcarving is a style of figure carving. The figures are carved in large flat planes, created primarily using a carving knife.Tool marks are left in the carving and very little (if any) rounding or sanding is done.

  6. List of Super Bowl starting quarterbacks - Wikipedia

    en.wikipedia.org/wiki/List_of_Super_Bowl...

    Tom Brady started ten Super Bowls, double that of John Elway, who is second.Brady won seven. John Elway started five Super Bowls, winning two. Jim Kelly started four Super Bowls without winning any, a record.

  7. Dining philosophers problem - Wikipedia

    en.wikipedia.org/wiki/Dining_philosophers_problem

    In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers competing for access to tape drive ...