Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
TLCA
2005
Springer
favorite
Email
discuss
report
98
views
Theoretical Computer Science
»
more
TLCA 2005
»
Reducibility and TT-Lifting for Computation Types
14 years 4 months ago
Download
homepages.inf.ed.ac.uk
Sam Lindley, Ian Stark
Real-time Traffic
Theoretical Computer Science
|
TLCA 2005
|
claim paper
Related Content
»
Reducing computational complexity with array predicates
»
Parallel Reducibility for InformationTheoretically Secure Computation
»
Radix2 algorithm for the fast computation of typeIII 3D discrete W transform
»
Cech Type Approach to Computing Homology of Maps
»
Interpreting Localized Computational Effects Using Operators of Higher Type
»
On the Values of Reducibility Candidates
»
Declared Type Generalization Checker An Eclipse PlugIn for Systematic Programming with Mor...
»
Reducing the Cost of Generating APHDistributed Random Numbers
»
Traceable data types for selfadjusting computation
more »
Post Info
More Details (n/a)
Added
28 Jun 2010
Updated
28 Jun 2010
Type
Conference
Year
2005
Where
TLCA
Authors
Sam Lindley, Ian Stark
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision