BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Graph explorer

Fast domino tileability

Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area. In this paper, we improve upon Thurston's height function approach to a nearly linear time in the perimeter.

5 nodes4 linksoverview mapFast domino tileability
SearchCollections
5 nodes4 links
Fast domino tileability5 visible / 5 total nodes / 7 links
Co-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipTopic signalWFast domino tileabilitypreprint / 2016AIgor PakResearcherAAdam ShefferResearcherAMartin TassyResearcherTmath.CO8936 works
PaperSignal 104 links

Fast domino tileability

preprint / 2016

Open

Personal maps

Sign in to save graph views

Saved views keep the query, focus and filters attached so you can return to the same research slice later.

Sign in

Public snapshots

1 shared view(s)